./Ultimate.py --spec /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/properties/unreach-call.prp --file /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/combinations/pc_sfifo_1.cil-2+token_ring.08.cil-2.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version fca748b1 Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/combinations/pc_sfifo_1.cil-2+token_ring.08.cil-2.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash e8ee20bd48f38d06d172550f7b4afad7a85599a8fd397bba890e4eeccd52db93 --- Real Ultimate output --- This is Ultimate 0.2.5-wip.dd.update-z3-fca748b-m [2024-11-20 00:06:09,726 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-20 00:06:09,773 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-20 00:06:09,776 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-20 00:06:09,777 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-20 00:06:09,795 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-20 00:06:09,795 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-20 00:06:09,796 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-20 00:06:09,796 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-20 00:06:09,800 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-20 00:06:09,800 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-20 00:06:09,801 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-20 00:06:09,801 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-20 00:06:09,801 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-20 00:06:09,802 INFO L153 SettingsManager]: * Use SBE=true [2024-11-20 00:06:09,802 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-20 00:06:09,802 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-20 00:06:09,802 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-20 00:06:09,803 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-20 00:06:09,803 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-20 00:06:09,803 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-20 00:06:09,803 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-20 00:06:09,804 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-20 00:06:09,804 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-20 00:06:09,804 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-20 00:06:09,804 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-20 00:06:09,805 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-20 00:06:09,805 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-20 00:06:09,805 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-20 00:06:09,805 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-20 00:06:09,806 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-20 00:06:09,806 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-20 00:06:09,806 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-20 00:06:09,806 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-20 00:06:09,806 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-20 00:06:09,807 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-20 00:06:09,807 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-20 00:06:09,807 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-20 00:06:09,807 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-20 00:06:09,807 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-20 00:06:09,807 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-20 00:06:09,809 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-20 00:06:09,809 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 -> e8ee20bd48f38d06d172550f7b4afad7a85599a8fd397bba890e4eeccd52db93 [2024-11-20 00:06:10,030 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-20 00:06:10,055 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-20 00:06:10,058 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-20 00:06:10,059 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-20 00:06:10,059 INFO L274 PluginConnector]: CDTParser initialized [2024-11-20 00:06:10,060 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/combinations/pc_sfifo_1.cil-2+token_ring.08.cil-2.c [2024-11-20 00:06:11,250 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-20 00:06:11,438 INFO L384 CDTParser]: Found 1 translation units. [2024-11-20 00:06:11,439 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/combinations/pc_sfifo_1.cil-2+token_ring.08.cil-2.c [2024-11-20 00:06:11,456 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2f81b87e0/14c6c996451c406085402fd2022e1c92/FLAG9821e781e [2024-11-20 00:06:11,819 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2f81b87e0/14c6c996451c406085402fd2022e1c92 [2024-11-20 00:06:11,821 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-20 00:06:11,822 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-20 00:06:11,823 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-20 00:06:11,823 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-20 00:06:11,828 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-20 00:06:11,828 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.11 12:06:11" (1/1) ... [2024-11-20 00:06:11,830 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4b35f706 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 12:06:11, skipping insertion in model container [2024-11-20 00:06:11,830 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.11 12:06:11" (1/1) ... [2024-11-20 00:06:11,887 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-20 00:06:12,028 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/combinations/pc_sfifo_1.cil-2+token_ring.08.cil-2.c[913,926] [2024-11-20 00:06:12,069 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/combinations/pc_sfifo_1.cil-2+token_ring.08.cil-2.c[5977,5990] [2024-11-20 00:06:12,144 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-20 00:06:12,155 INFO L200 MainTranslator]: Completed pre-run [2024-11-20 00:06:12,166 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/combinations/pc_sfifo_1.cil-2+token_ring.08.cil-2.c[913,926] [2024-11-20 00:06:12,183 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/combinations/pc_sfifo_1.cil-2+token_ring.08.cil-2.c[5977,5990] [2024-11-20 00:06:12,221 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-20 00:06:12,249 INFO L204 MainTranslator]: Completed translation [2024-11-20 00:06:12,249 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 12:06:12 WrapperNode [2024-11-20 00:06:12,250 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-20 00:06:12,251 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-20 00:06:12,251 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-20 00:06:12,251 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-20 00:06:12,257 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 12:06:12" (1/1) ... [2024-11-20 00:06:12,267 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 12:06:12" (1/1) ... [2024-11-20 00:06:12,314 INFO L138 Inliner]: procedures = 64, calls = 73, calls flagged for inlining = 38, calls inlined = 38, statements flattened = 849 [2024-11-20 00:06:12,317 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-20 00:06:12,317 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-20 00:06:12,317 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-20 00:06:12,317 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-20 00:06:12,332 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 12:06:12" (1/1) ... [2024-11-20 00:06:12,332 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 12:06:12" (1/1) ... [2024-11-20 00:06:12,335 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 12:06:12" (1/1) ... [2024-11-20 00:06:12,354 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-11-20 00:06:12,358 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 12:06:12" (1/1) ... [2024-11-20 00:06:12,358 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 12:06:12" (1/1) ... [2024-11-20 00:06:12,374 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 12:06:12" (1/1) ... [2024-11-20 00:06:12,383 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 12:06:12" (1/1) ... [2024-11-20 00:06:12,385 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 12:06:12" (1/1) ... [2024-11-20 00:06:12,387 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 12:06:12" (1/1) ... [2024-11-20 00:06:12,390 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-20 00:06:12,391 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-20 00:06:12,391 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-20 00:06:12,391 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-20 00:06:12,392 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 12:06:12" (1/1) ... [2024-11-20 00:06:12,396 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-20 00:06:12,416 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-20 00:06:12,429 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-20 00:06:12,431 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-20 00:06:12,468 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-20 00:06:12,468 INFO L130 BoogieDeclarations]: Found specification of procedure immediate_notify [2024-11-20 00:06:12,468 INFO L138 BoogieDeclarations]: Found implementation of procedure immediate_notify [2024-11-20 00:06:12,468 INFO L130 BoogieDeclarations]: Found specification of procedure immediate_notify_threads [2024-11-20 00:06:12,468 INFO L138 BoogieDeclarations]: Found implementation of procedure immediate_notify_threads [2024-11-20 00:06:12,468 INFO L130 BoogieDeclarations]: Found specification of procedure exists_runnable_thread1 [2024-11-20 00:06:12,468 INFO L138 BoogieDeclarations]: Found implementation of procedure exists_runnable_thread1 [2024-11-20 00:06:12,468 INFO L130 BoogieDeclarations]: Found specification of procedure exists_runnable_thread2 [2024-11-20 00:06:12,468 INFO L138 BoogieDeclarations]: Found implementation of procedure exists_runnable_thread2 [2024-11-20 00:06:12,468 INFO L130 BoogieDeclarations]: Found specification of procedure reset_delta_events2 [2024-11-20 00:06:12,468 INFO L138 BoogieDeclarations]: Found implementation of procedure reset_delta_events2 [2024-11-20 00:06:12,469 INFO L130 BoogieDeclarations]: Found specification of procedure activate_threads2 [2024-11-20 00:06:12,469 INFO L138 BoogieDeclarations]: Found implementation of procedure activate_threads2 [2024-11-20 00:06:12,469 INFO L130 BoogieDeclarations]: Found specification of procedure update_channels2 [2024-11-20 00:06:12,469 INFO L138 BoogieDeclarations]: Found implementation of procedure update_channels2 [2024-11-20 00:06:12,469 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-20 00:06:12,469 INFO L130 BoogieDeclarations]: Found specification of procedure fire_delta_events2 [2024-11-20 00:06:12,469 INFO L138 BoogieDeclarations]: Found implementation of procedure fire_delta_events2 [2024-11-20 00:06:12,469 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-20 00:06:12,469 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-20 00:06:12,469 INFO L130 BoogieDeclarations]: Found specification of procedure error1 [2024-11-20 00:06:12,469 INFO L138 BoogieDeclarations]: Found implementation of procedure error1 [2024-11-20 00:06:12,469 INFO L130 BoogieDeclarations]: Found specification of procedure error2 [2024-11-20 00:06:12,470 INFO L138 BoogieDeclarations]: Found implementation of procedure error2 [2024-11-20 00:06:12,551 INFO L238 CfgBuilder]: Building ICFG [2024-11-20 00:06:12,552 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-20 00:06:13,209 INFO L? ?]: Removed 107 outVars from TransFormulas that were not future-live. [2024-11-20 00:06:13,209 INFO L287 CfgBuilder]: Performing block encoding [2024-11-20 00:06:13,241 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-20 00:06:13,241 INFO L316 CfgBuilder]: Removed 15 assume(true) statements. [2024-11-20 00:06:13,242 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 12:06:13 BoogieIcfgContainer [2024-11-20 00:06:13,242 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-20 00:06:13,245 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-20 00:06:13,246 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-20 00:06:13,248 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-20 00:06:13,248 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.11 12:06:11" (1/3) ... [2024-11-20 00:06:13,249 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@53b84fe7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.11 12:06:13, skipping insertion in model container [2024-11-20 00:06:13,249 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 12:06:12" (2/3) ... [2024-11-20 00:06:13,249 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@53b84fe7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.11 12:06:13, skipping insertion in model container [2024-11-20 00:06:13,249 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 12:06:13" (3/3) ... [2024-11-20 00:06:13,250 INFO L112 eAbstractionObserver]: Analyzing ICFG pc_sfifo_1.cil-2+token_ring.08.cil-2.c [2024-11-20 00:06:13,262 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-20 00:06:13,263 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2024-11-20 00:06:13,331 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-20 00:06:13,336 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;@68da7c61, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-20 00:06:13,336 INFO L334 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2024-11-20 00:06:13,341 INFO L276 IsEmpty]: Start isEmpty. Operand has 371 states, 328 states have (on average 1.6189024390243902) internal successors, (531), 335 states have internal predecessors, (531), 30 states have call successors, (30), 10 states have call predecessors, (30), 10 states have return successors, (30), 28 states have call predecessors, (30), 30 states have call successors, (30) [2024-11-20 00:06:13,350 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2024-11-20 00:06:13,350 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 00:06:13,351 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] [2024-11-20 00:06:13,351 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-20 00:06:13,355 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 00:06:13,355 INFO L85 PathProgramCache]: Analyzing trace with hash 136019268, now seen corresponding path program 1 times [2024-11-20 00:06:13,362 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 00:06:13,362 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [176425075] [2024-11-20 00:06:13,363 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 00:06:13,363 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 00:06:13,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:06:13,594 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-20 00:06:13,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:06:13,621 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-11-20 00:06:13,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:06:13,640 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-20 00:06:13,640 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 00:06:13,641 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [176425075] [2024-11-20 00:06:13,641 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [176425075] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 00:06:13,641 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 00:06:13,641 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-20 00:06:13,642 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [629626560] [2024-11-20 00:06:13,643 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 00:06:13,651 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-20 00:06:13,651 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 00:06:13,669 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-20 00:06:13,670 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-20 00:06:13,673 INFO L87 Difference]: Start difference. First operand has 371 states, 328 states have (on average 1.6189024390243902) internal successors, (531), 335 states have internal predecessors, (531), 30 states have call successors, (30), 10 states have call predecessors, (30), 10 states have return successors, (30), 28 states have call predecessors, (30), 30 states have call successors, (30) Second operand has 4 states, 4 states have (on average 9.75) internal successors, (39), 3 states have internal predecessors, (39), 1 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-20 00:06:14,167 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 00:06:14,168 INFO L93 Difference]: Finished difference Result 728 states and 1157 transitions. [2024-11-20 00:06:14,169 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-20 00:06:14,170 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 9.75) internal successors, (39), 3 states have internal predecessors, (39), 1 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 44 [2024-11-20 00:06:14,170 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 00:06:14,183 INFO L225 Difference]: With dead ends: 728 [2024-11-20 00:06:14,183 INFO L226 Difference]: Without dead ends: 369 [2024-11-20 00:06:14,190 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-20 00:06:14,195 INFO L432 NwaCegarLoop]: 365 mSDtfsCounter, 308 mSDsluCounter, 523 mSDsCounter, 0 mSdLazyCounter, 453 mSolverCounterSat, 29 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 311 SdHoareTripleChecker+Valid, 888 SdHoareTripleChecker+Invalid, 482 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 29 IncrementalHoareTripleChecker+Valid, 453 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-20 00:06:14,196 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [311 Valid, 888 Invalid, 482 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [29 Valid, 453 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-20 00:06:14,212 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 369 states. [2024-11-20 00:06:14,246 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 369 to 360. [2024-11-20 00:06:14,247 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 360 states, 320 states have (on average 1.525) internal successors, (488), 324 states have internal predecessors, (488), 30 states have call successors, (30), 10 states have call predecessors, (30), 8 states have return successors, (26), 26 states have call predecessors, (26), 26 states have call successors, (26) [2024-11-20 00:06:14,249 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 360 states to 360 states and 544 transitions. [2024-11-20 00:06:14,251 INFO L78 Accepts]: Start accepts. Automaton has 360 states and 544 transitions. Word has length 44 [2024-11-20 00:06:14,251 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 00:06:14,251 INFO L471 AbstractCegarLoop]: Abstraction has 360 states and 544 transitions. [2024-11-20 00:06:14,251 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 9.75) internal successors, (39), 3 states have internal predecessors, (39), 1 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-20 00:06:14,251 INFO L276 IsEmpty]: Start isEmpty. Operand 360 states and 544 transitions. [2024-11-20 00:06:14,253 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2024-11-20 00:06:14,253 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 00:06:14,253 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] [2024-11-20 00:06:14,253 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-20 00:06:14,254 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-20 00:06:14,254 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 00:06:14,254 INFO L85 PathProgramCache]: Analyzing trace with hash 1981386434, now seen corresponding path program 1 times [2024-11-20 00:06:14,254 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 00:06:14,254 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [839419779] [2024-11-20 00:06:14,255 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 00:06:14,255 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 00:06:14,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:06:14,313 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-20 00:06:14,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:06:14,333 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-11-20 00:06:14,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:06:14,342 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-20 00:06:14,342 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 00:06:14,343 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [839419779] [2024-11-20 00:06:14,343 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [839419779] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 00:06:14,343 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 00:06:14,343 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-20 00:06:14,343 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1604644797] [2024-11-20 00:06:14,343 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 00:06:14,344 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-20 00:06:14,344 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 00:06:14,345 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-20 00:06:14,345 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-20 00:06:14,345 INFO L87 Difference]: Start difference. First operand 360 states and 544 transitions. Second operand has 4 states, 4 states have (on average 9.75) internal successors, (39), 3 states have internal predecessors, (39), 2 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-20 00:06:14,690 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 00:06:14,691 INFO L93 Difference]: Finished difference Result 492 states and 729 transitions. [2024-11-20 00:06:14,691 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-20 00:06:14,691 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 9.75) internal successors, (39), 3 states have internal predecessors, (39), 2 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 44 [2024-11-20 00:06:14,691 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 00:06:14,694 INFO L225 Difference]: With dead ends: 492 [2024-11-20 00:06:14,697 INFO L226 Difference]: Without dead ends: 430 [2024-11-20 00:06:14,698 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-20 00:06:14,699 INFO L432 NwaCegarLoop]: 359 mSDtfsCounter, 716 mSDsluCounter, 343 mSDsCounter, 0 mSdLazyCounter, 286 mSolverCounterSat, 46 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 738 SdHoareTripleChecker+Valid, 702 SdHoareTripleChecker+Invalid, 332 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 46 IncrementalHoareTripleChecker+Valid, 286 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-20 00:06:14,699 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [738 Valid, 702 Invalid, 332 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [46 Valid, 286 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-20 00:06:14,701 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 430 states. [2024-11-20 00:06:14,728 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 430 to 424. [2024-11-20 00:06:14,729 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 424 states, 377 states have (on average 1.4960212201591512) internal successors, (564), 382 states have internal predecessors, (564), 34 states have call successors, (34), 12 states have call predecessors, (34), 11 states have return successors, (36), 30 states have call predecessors, (36), 30 states have call successors, (36) [2024-11-20 00:06:14,732 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 424 states to 424 states and 634 transitions. [2024-11-20 00:06:14,733 INFO L78 Accepts]: Start accepts. Automaton has 424 states and 634 transitions. Word has length 44 [2024-11-20 00:06:14,733 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 00:06:14,734 INFO L471 AbstractCegarLoop]: Abstraction has 424 states and 634 transitions. [2024-11-20 00:06:14,734 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 9.75) internal successors, (39), 3 states have internal predecessors, (39), 2 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-20 00:06:14,734 INFO L276 IsEmpty]: Start isEmpty. Operand 424 states and 634 transitions. [2024-11-20 00:06:14,736 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2024-11-20 00:06:14,736 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 00:06:14,736 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] [2024-11-20 00:06:14,736 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-20 00:06:14,737 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-20 00:06:14,737 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 00:06:14,738 INFO L85 PathProgramCache]: Analyzing trace with hash 714415151, now seen corresponding path program 1 times [2024-11-20 00:06:14,739 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 00:06:14,739 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [746084686] [2024-11-20 00:06:14,739 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 00:06:14,740 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 00:06:14,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:06:14,804 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-20 00:06:14,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:06:14,814 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-11-20 00:06:14,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:06:14,823 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-20 00:06:14,823 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 00:06:14,823 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [746084686] [2024-11-20 00:06:14,823 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [746084686] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 00:06:14,823 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 00:06:14,823 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-20 00:06:14,823 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2083819042] [2024-11-20 00:06:14,824 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 00:06:14,824 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-20 00:06:14,824 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 00:06:14,824 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-20 00:06:14,824 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-20 00:06:14,825 INFO L87 Difference]: Start difference. First operand 424 states and 634 transitions. Second operand has 4 states, 4 states have (on average 10.0) internal successors, (40), 3 states have internal predecessors, (40), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-20 00:06:15,188 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 00:06:15,188 INFO L93 Difference]: Finished difference Result 672 states and 974 transitions. [2024-11-20 00:06:15,189 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-20 00:06:15,189 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 10.0) internal successors, (40), 3 states have internal predecessors, (40), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 45 [2024-11-20 00:06:15,190 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 00:06:15,192 INFO L225 Difference]: With dead ends: 672 [2024-11-20 00:06:15,192 INFO L226 Difference]: Without dead ends: 548 [2024-11-20 00:06:15,193 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-20 00:06:15,196 INFO L432 NwaCegarLoop]: 395 mSDtfsCounter, 289 mSDsluCounter, 596 mSDsCounter, 0 mSdLazyCounter, 472 mSolverCounterSat, 35 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 291 SdHoareTripleChecker+Valid, 991 SdHoareTripleChecker+Invalid, 507 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 35 IncrementalHoareTripleChecker+Valid, 472 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-20 00:06:15,197 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [291 Valid, 991 Invalid, 507 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [35 Valid, 472 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-20 00:06:15,199 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 548 states. [2024-11-20 00:06:15,223 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 548 to 491. [2024-11-20 00:06:15,223 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 491 states, 438 states have (on average 1.4794520547945205) internal successors, (648), 443 states have internal predecessors, (648), 37 states have call successors, (37), 15 states have call predecessors, (37), 14 states have return successors, (39), 33 states have call predecessors, (39), 33 states have call successors, (39) [2024-11-20 00:06:15,226 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 491 states to 491 states and 724 transitions. [2024-11-20 00:06:15,226 INFO L78 Accepts]: Start accepts. Automaton has 491 states and 724 transitions. Word has length 45 [2024-11-20 00:06:15,227 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 00:06:15,227 INFO L471 AbstractCegarLoop]: Abstraction has 491 states and 724 transitions. [2024-11-20 00:06:15,227 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 10.0) internal successors, (40), 3 states have internal predecessors, (40), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-20 00:06:15,227 INFO L276 IsEmpty]: Start isEmpty. Operand 491 states and 724 transitions. [2024-11-20 00:06:15,228 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2024-11-20 00:06:15,229 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 00:06:15,229 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] [2024-11-20 00:06:15,229 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-20 00:06:15,229 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-20 00:06:15,229 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 00:06:15,230 INFO L85 PathProgramCache]: Analyzing trace with hash -569942310, now seen corresponding path program 1 times [2024-11-20 00:06:15,230 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 00:06:15,230 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [476866303] [2024-11-20 00:06:15,230 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 00:06:15,230 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 00:06:15,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:06:15,283 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-20 00:06:15,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:06:15,295 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-11-20 00:06:15,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:06:15,301 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-20 00:06:15,302 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 00:06:15,302 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [476866303] [2024-11-20 00:06:15,302 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [476866303] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 00:06:15,302 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 00:06:15,302 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-20 00:06:15,302 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [216115299] [2024-11-20 00:06:15,302 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 00:06:15,303 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-20 00:06:15,303 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 00:06:15,303 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-20 00:06:15,304 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-20 00:06:15,304 INFO L87 Difference]: Start difference. First operand 491 states and 724 transitions. Second operand has 4 states, 4 states have (on average 10.0) internal successors, (40), 3 states have internal predecessors, (40), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-20 00:06:15,645 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 00:06:15,645 INFO L93 Difference]: Finished difference Result 899 states and 1283 transitions. [2024-11-20 00:06:15,646 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-20 00:06:15,646 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 10.0) internal successors, (40), 3 states have internal predecessors, (40), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 45 [2024-11-20 00:06:15,646 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 00:06:15,651 INFO L225 Difference]: With dead ends: 899 [2024-11-20 00:06:15,651 INFO L226 Difference]: Without dead ends: 708 [2024-11-20 00:06:15,652 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-20 00:06:15,652 INFO L432 NwaCegarLoop]: 366 mSDtfsCounter, 734 mSDsluCounter, 354 mSDsCounter, 0 mSdLazyCounter, 264 mSolverCounterSat, 39 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 756 SdHoareTripleChecker+Valid, 720 SdHoareTripleChecker+Invalid, 303 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 39 IncrementalHoareTripleChecker+Valid, 264 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-20 00:06:15,653 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [756 Valid, 720 Invalid, 303 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [39 Valid, 264 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-20 00:06:15,654 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 708 states. [2024-11-20 00:06:15,690 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 708 to 656. [2024-11-20 00:06:15,691 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 656 states, 584 states have (on average 1.4349315068493151) internal successors, (838), 592 states have internal predecessors, (838), 48 states have call successors, (48), 22 states have call predecessors, (48), 22 states have return successors, (56), 42 states have call predecessors, (56), 44 states have call successors, (56) [2024-11-20 00:06:15,694 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 656 states to 656 states and 942 transitions. [2024-11-20 00:06:15,695 INFO L78 Accepts]: Start accepts. Automaton has 656 states and 942 transitions. Word has length 45 [2024-11-20 00:06:15,695 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 00:06:15,695 INFO L471 AbstractCegarLoop]: Abstraction has 656 states and 942 transitions. [2024-11-20 00:06:15,696 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 10.0) internal successors, (40), 3 states have internal predecessors, (40), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-20 00:06:15,696 INFO L276 IsEmpty]: Start isEmpty. Operand 656 states and 942 transitions. [2024-11-20 00:06:15,699 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2024-11-20 00:06:15,699 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 00:06:15,699 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] [2024-11-20 00:06:15,700 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-20 00:06:15,700 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-20 00:06:15,700 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 00:06:15,701 INFO L85 PathProgramCache]: Analyzing trace with hash 800650834, now seen corresponding path program 1 times [2024-11-20 00:06:15,701 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 00:06:15,701 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2066879919] [2024-11-20 00:06:15,701 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 00:06:15,701 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 00:06:15,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:06:15,775 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-20 00:06:15,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:06:15,778 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-20 00:06:15,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:06:15,787 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-20 00:06:15,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:06:15,795 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2024-11-20 00:06:15,795 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 00:06:15,796 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2066879919] [2024-11-20 00:06:15,796 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2066879919] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 00:06:15,796 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 00:06:15,796 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-20 00:06:15,796 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [39437356] [2024-11-20 00:06:15,796 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 00:06:15,796 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-20 00:06:15,796 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 00:06:15,797 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-20 00:06:15,797 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-20 00:06:15,797 INFO L87 Difference]: Start difference. First operand 656 states and 942 transitions. Second operand has 4 states, 4 states have (on average 12.75) internal successors, (51), 3 states have internal predecessors, (51), 3 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-20 00:06:16,161 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 00:06:16,161 INFO L93 Difference]: Finished difference Result 1000 states and 1403 transitions. [2024-11-20 00:06:16,161 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-20 00:06:16,162 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 12.75) internal successors, (51), 3 states have internal predecessors, (51), 3 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Word has length 62 [2024-11-20 00:06:16,163 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 00:06:16,168 INFO L225 Difference]: With dead ends: 1000 [2024-11-20 00:06:16,168 INFO L226 Difference]: Without dead ends: 763 [2024-11-20 00:06:16,170 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-20 00:06:16,171 INFO L432 NwaCegarLoop]: 416 mSDtfsCounter, 273 mSDsluCounter, 626 mSDsCounter, 0 mSdLazyCounter, 494 mSolverCounterSat, 30 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 275 SdHoareTripleChecker+Valid, 1042 SdHoareTripleChecker+Invalid, 524 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 30 IncrementalHoareTripleChecker+Valid, 494 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-20 00:06:16,171 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [275 Valid, 1042 Invalid, 524 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [30 Valid, 494 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-20 00:06:16,172 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 763 states. [2024-11-20 00:06:16,199 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 763 to 725. [2024-11-20 00:06:16,200 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 725 states, 644 states have (on average 1.4099378881987579) internal successors, (908), 653 states have internal predecessors, (908), 53 states have call successors, (53), 25 states have call predecessors, (53), 26 states have return successors, (65), 47 states have call predecessors, (65), 49 states have call successors, (65) [2024-11-20 00:06:16,204 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 725 states to 725 states and 1026 transitions. [2024-11-20 00:06:16,206 INFO L78 Accepts]: Start accepts. Automaton has 725 states and 1026 transitions. Word has length 62 [2024-11-20 00:06:16,206 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 00:06:16,206 INFO L471 AbstractCegarLoop]: Abstraction has 725 states and 1026 transitions. [2024-11-20 00:06:16,207 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 12.75) internal successors, (51), 3 states have internal predecessors, (51), 3 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-20 00:06:16,207 INFO L276 IsEmpty]: Start isEmpty. Operand 725 states and 1026 transitions. [2024-11-20 00:06:16,208 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2024-11-20 00:06:16,208 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 00:06:16,208 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] [2024-11-20 00:06:16,208 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-20 00:06:16,208 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-20 00:06:16,208 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 00:06:16,208 INFO L85 PathProgramCache]: Analyzing trace with hash -448284980, now seen corresponding path program 1 times [2024-11-20 00:06:16,208 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 00:06:16,209 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [556892899] [2024-11-20 00:06:16,209 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 00:06:16,209 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 00:06:16,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:06:16,249 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-20 00:06:16,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:06:16,258 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-20 00:06:16,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:06:16,264 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-11-20 00:06:16,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:06:16,271 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2024-11-20 00:06:16,271 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 00:06:16,271 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [556892899] [2024-11-20 00:06:16,271 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [556892899] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 00:06:16,271 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 00:06:16,271 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-20 00:06:16,271 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [421616154] [2024-11-20 00:06:16,271 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 00:06:16,272 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-20 00:06:16,272 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 00:06:16,272 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-20 00:06:16,272 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-20 00:06:16,272 INFO L87 Difference]: Start difference. First operand 725 states and 1026 transitions. Second operand has 4 states, 4 states have (on average 11.75) internal successors, (47), 3 states have internal predecessors, (47), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2024-11-20 00:06:16,610 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 00:06:16,610 INFO L93 Difference]: Finished difference Result 1276 states and 1748 transitions. [2024-11-20 00:06:16,610 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-20 00:06:16,611 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 11.75) internal successors, (47), 3 states have internal predecessors, (47), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 67 [2024-11-20 00:06:16,611 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 00:06:16,615 INFO L225 Difference]: With dead ends: 1276 [2024-11-20 00:06:16,615 INFO L226 Difference]: Without dead ends: 898 [2024-11-20 00:06:16,616 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-20 00:06:16,618 INFO L432 NwaCegarLoop]: 363 mSDtfsCounter, 721 mSDsluCounter, 356 mSDsCounter, 0 mSdLazyCounter, 259 mSolverCounterSat, 39 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 743 SdHoareTripleChecker+Valid, 719 SdHoareTripleChecker+Invalid, 298 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 39 IncrementalHoareTripleChecker+Valid, 259 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-20 00:06:16,619 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [743 Valid, 719 Invalid, 298 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [39 Valid, 259 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-20 00:06:16,621 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 898 states. [2024-11-20 00:06:16,651 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 898 to 843. [2024-11-20 00:06:16,652 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 843 states, 749 states have (on average 1.3805073431241655) internal successors, (1034), 759 states have internal predecessors, (1034), 60 states have call successors, (60), 30 states have call predecessors, (60), 32 states have return successors, (76), 54 states have call predecessors, (76), 56 states have call successors, (76) [2024-11-20 00:06:16,655 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 843 states to 843 states and 1170 transitions. [2024-11-20 00:06:16,656 INFO L78 Accepts]: Start accepts. Automaton has 843 states and 1170 transitions. Word has length 67 [2024-11-20 00:06:16,656 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 00:06:16,656 INFO L471 AbstractCegarLoop]: Abstraction has 843 states and 1170 transitions. [2024-11-20 00:06:16,657 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 11.75) internal successors, (47), 3 states have internal predecessors, (47), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2024-11-20 00:06:16,657 INFO L276 IsEmpty]: Start isEmpty. Operand 843 states and 1170 transitions. [2024-11-20 00:06:16,658 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2024-11-20 00:06:16,658 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 00:06:16,658 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] [2024-11-20 00:06:16,659 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-20 00:06:16,659 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-20 00:06:16,659 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 00:06:16,659 INFO L85 PathProgramCache]: Analyzing trace with hash 536634109, now seen corresponding path program 1 times [2024-11-20 00:06:16,660 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 00:06:16,660 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [948386330] [2024-11-20 00:06:16,660 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 00:06:16,660 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 00:06:16,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:06:16,720 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-20 00:06:16,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:06:16,728 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-11-20 00:06:16,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:06:16,757 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-20 00:06:16,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:06:16,762 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 2 proven. 11 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-11-20 00:06:16,762 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 00:06:16,763 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [948386330] [2024-11-20 00:06:16,763 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [948386330] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-20 00:06:16,763 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1921589240] [2024-11-20 00:06:16,763 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 00:06:16,763 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-20 00:06:16,763 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-20 00:06:16,768 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-11-20 00:06:16,770 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-11-20 00:06:16,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:06:16,860 INFO L255 TraceCheckSpWp]: Trace formula consists of 335 conjuncts, 7 conjuncts are in the unsatisfiable core [2024-11-20 00:06:16,865 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-20 00:06:16,954 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 2 proven. 13 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-20 00:06:16,954 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-20 00:06:16,991 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2024-11-20 00:06:16,991 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1921589240] provided 1 perfect and 1 imperfect interpolant sequences [2024-11-20 00:06:16,991 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2024-11-20 00:06:16,991 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [6, 4] total 8 [2024-11-20 00:06:16,991 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1686865628] [2024-11-20 00:06:16,992 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 00:06:16,992 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-20 00:06:16,992 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 00:06:16,992 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-20 00:06:16,992 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2024-11-20 00:06:16,992 INFO L87 Difference]: Start difference. First operand 843 states and 1170 transitions. Second operand has 4 states, 4 states have (on average 12.5) internal successors, (50), 4 states have internal predecessors, (50), 4 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-20 00:06:17,116 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 00:06:17,117 INFO L93 Difference]: Finished difference Result 898 states and 1237 transitions. [2024-11-20 00:06:17,117 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-20 00:06:17,118 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 12.5) internal successors, (50), 4 states have internal predecessors, (50), 4 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Word has length 68 [2024-11-20 00:06:17,119 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 00:06:17,122 INFO L225 Difference]: With dead ends: 898 [2024-11-20 00:06:17,122 INFO L226 Difference]: Without dead ends: 895 [2024-11-20 00:06:17,122 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 148 GetRequests, 141 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2024-11-20 00:06:17,123 INFO L432 NwaCegarLoop]: 568 mSDtfsCounter, 983 mSDsluCounter, 67 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 106 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 983 SdHoareTripleChecker+Valid, 635 SdHoareTripleChecker+Invalid, 115 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 106 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-20 00:06:17,123 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [983 Valid, 635 Invalid, 115 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [106 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-20 00:06:17,124 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 895 states. [2024-11-20 00:06:17,149 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 895 to 842. [2024-11-20 00:06:17,150 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 842 states, 749 states have (on average 1.3778371161548733) internal successors, (1032), 758 states have internal predecessors, (1032), 59 states have call successors, (59), 30 states have call predecessors, (59), 32 states have return successors, (76), 54 states have call predecessors, (76), 56 states have call successors, (76) [2024-11-20 00:06:17,153 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 842 states to 842 states and 1167 transitions. [2024-11-20 00:06:17,153 INFO L78 Accepts]: Start accepts. Automaton has 842 states and 1167 transitions. Word has length 68 [2024-11-20 00:06:17,154 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 00:06:17,154 INFO L471 AbstractCegarLoop]: Abstraction has 842 states and 1167 transitions. [2024-11-20 00:06:17,154 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 12.5) internal successors, (50), 4 states have internal predecessors, (50), 4 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-20 00:06:17,154 INFO L276 IsEmpty]: Start isEmpty. Operand 842 states and 1167 transitions. [2024-11-20 00:06:17,167 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2024-11-20 00:06:17,167 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 00:06:17,168 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] [2024-11-20 00:06:17,177 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-11-20 00:06:17,368 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-20 00:06:17,369 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-20 00:06:17,369 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 00:06:17,369 INFO L85 PathProgramCache]: Analyzing trace with hash -545347857, now seen corresponding path program 1 times [2024-11-20 00:06:17,369 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 00:06:17,369 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1210510615] [2024-11-20 00:06:17,370 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 00:06:17,370 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 00:06:17,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:06:17,431 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-20 00:06:17,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:06:17,435 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-11-20 00:06:17,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:06:17,474 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-20 00:06:17,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:06:17,481 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 2 proven. 11 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-11-20 00:06:17,481 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 00:06:17,481 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1210510615] [2024-11-20 00:06:17,481 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1210510615] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-20 00:06:17,481 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2129731274] [2024-11-20 00:06:17,481 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 00:06:17,481 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-20 00:06:17,482 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-20 00:06:17,483 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-11-20 00:06:17,484 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-11-20 00:06:17,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:06:17,568 INFO L255 TraceCheckSpWp]: Trace formula consists of 337 conjuncts, 9 conjuncts are in the unsatisfiable core [2024-11-20 00:06:17,570 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-20 00:06:17,775 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-20 00:06:17,775 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-20 00:06:17,833 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2024-11-20 00:06:17,833 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2129731274] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-20 00:06:17,833 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-20 00:06:17,834 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5, 4] total 11 [2024-11-20 00:06:17,834 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1737793954] [2024-11-20 00:06:17,834 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-20 00:06:17,834 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-11-20 00:06:17,834 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 00:06:17,835 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-11-20 00:06:17,835 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=88, Unknown=0, NotChecked=0, Total=110 [2024-11-20 00:06:17,835 INFO L87 Difference]: Start difference. First operand 842 states and 1167 transitions. Second operand has 11 states, 11 states have (on average 13.727272727272727) internal successors, (151), 10 states have internal predecessors, (151), 7 states have call successors, (10), 6 states have call predecessors, (10), 5 states have return successors, (9), 7 states have call predecessors, (9), 7 states have call successors, (9) [2024-11-20 00:06:18,905 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 00:06:18,905 INFO L93 Difference]: Finished difference Result 2186 states and 2943 transitions. [2024-11-20 00:06:18,905 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2024-11-20 00:06:18,906 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 13.727272727272727) internal successors, (151), 10 states have internal predecessors, (151), 7 states have call successors, (10), 6 states have call predecessors, (10), 5 states have return successors, (9), 7 states have call predecessors, (9), 7 states have call successors, (9) Word has length 69 [2024-11-20 00:06:18,906 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 00:06:18,911 INFO L225 Difference]: With dead ends: 2186 [2024-11-20 00:06:18,912 INFO L226 Difference]: Without dead ends: 1742 [2024-11-20 00:06:18,913 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 173 GetRequests, 144 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 176 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=162, Invalid=768, Unknown=0, NotChecked=0, Total=930 [2024-11-20 00:06:18,913 INFO L432 NwaCegarLoop]: 435 mSDtfsCounter, 1363 mSDsluCounter, 2709 mSDsCounter, 0 mSdLazyCounter, 1912 mSolverCounterSat, 90 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1392 SdHoareTripleChecker+Valid, 3144 SdHoareTripleChecker+Invalid, 2002 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 90 IncrementalHoareTripleChecker+Valid, 1912 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2024-11-20 00:06:18,914 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1392 Valid, 3144 Invalid, 2002 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [90 Valid, 1912 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2024-11-20 00:06:18,915 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1742 states. [2024-11-20 00:06:18,953 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1742 to 1190. [2024-11-20 00:06:18,955 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1190 states, 1061 states have (on average 1.3393025447690858) internal successors, (1421), 1076 states have internal predecessors, (1421), 78 states have call successors, (78), 43 states have call predecessors, (78), 49 states have return successors, (107), 71 states have call predecessors, (107), 75 states have call successors, (107) [2024-11-20 00:06:18,958 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1190 states to 1190 states and 1606 transitions. [2024-11-20 00:06:18,959 INFO L78 Accepts]: Start accepts. Automaton has 1190 states and 1606 transitions. Word has length 69 [2024-11-20 00:06:18,959 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 00:06:18,959 INFO L471 AbstractCegarLoop]: Abstraction has 1190 states and 1606 transitions. [2024-11-20 00:06:18,960 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 13.727272727272727) internal successors, (151), 10 states have internal predecessors, (151), 7 states have call successors, (10), 6 states have call predecessors, (10), 5 states have return successors, (9), 7 states have call predecessors, (9), 7 states have call successors, (9) [2024-11-20 00:06:18,960 INFO L276 IsEmpty]: Start isEmpty. Operand 1190 states and 1606 transitions. [2024-11-20 00:06:18,961 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2024-11-20 00:06:18,961 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 00:06:18,961 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-20 00:06:18,969 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2024-11-20 00:06:19,162 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable7 [2024-11-20 00:06:19,162 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-20 00:06:19,162 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 00:06:19,163 INFO L85 PathProgramCache]: Analyzing trace with hash -1021236460, now seen corresponding path program 1 times [2024-11-20 00:06:19,163 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 00:06:19,163 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1721716702] [2024-11-20 00:06:19,163 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 00:06:19,163 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 00:06:19,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:06:19,211 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-20 00:06:19,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:06:19,216 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-11-20 00:06:19,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:06:19,252 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-20 00:06:19,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:06:19,255 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-11-20 00:06:19,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:06:19,258 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 6 proven. 10 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2024-11-20 00:06:19,258 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 00:06:19,258 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1721716702] [2024-11-20 00:06:19,258 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1721716702] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-20 00:06:19,258 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1957750009] [2024-11-20 00:06:19,258 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 00:06:19,258 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-20 00:06:19,258 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-20 00:06:19,260 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-11-20 00:06:19,261 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-11-20 00:06:19,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:06:19,344 INFO L255 TraceCheckSpWp]: Trace formula consists of 386 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-20 00:06:19,346 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-20 00:06:19,371 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 36 proven. 0 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2024-11-20 00:06:19,371 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-20 00:06:19,372 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1957750009] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 00:06:19,372 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-20 00:06:19,372 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [6] total 7 [2024-11-20 00:06:19,372 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [635239746] [2024-11-20 00:06:19,372 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 00:06:19,372 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-20 00:06:19,372 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 00:06:19,373 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-20 00:06:19,373 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-20 00:06:19,373 INFO L87 Difference]: Start difference. First operand 1190 states and 1606 transitions. Second operand has 3 states, 3 states have (on average 23.0) internal successors, (69), 3 states have internal predecessors, (69), 3 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2024-11-20 00:06:19,412 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 00:06:19,412 INFO L93 Difference]: Finished difference Result 1808 states and 2410 transitions. [2024-11-20 00:06:19,414 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-20 00:06:19,414 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 23.0) internal successors, (69), 3 states have internal predecessors, (69), 3 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) Word has length 88 [2024-11-20 00:06:19,414 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 00:06:19,418 INFO L225 Difference]: With dead ends: 1808 [2024-11-20 00:06:19,418 INFO L226 Difference]: Without dead ends: 1086 [2024-11-20 00:06:19,419 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 101 GetRequests, 96 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-20 00:06:19,420 INFO L432 NwaCegarLoop]: 574 mSDtfsCounter, 505 mSDsluCounter, 74 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 505 SdHoareTripleChecker+Valid, 648 SdHoareTripleChecker+Invalid, 8 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-20 00:06:19,420 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [505 Valid, 648 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-20 00:06:19,421 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1086 states. [2024-11-20 00:06:19,452 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1086 to 1074. [2024-11-20 00:06:19,453 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1074 states, 958 states have (on average 1.3402922755741127) internal successors, (1284), 973 states have internal predecessors, (1284), 71 states have call successors, (71), 38 states have call predecessors, (71), 43 states have return successors, (96), 63 states have call predecessors, (96), 68 states have call successors, (96) [2024-11-20 00:06:19,456 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1074 states to 1074 states and 1451 transitions. [2024-11-20 00:06:19,457 INFO L78 Accepts]: Start accepts. Automaton has 1074 states and 1451 transitions. Word has length 88 [2024-11-20 00:06:19,457 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 00:06:19,457 INFO L471 AbstractCegarLoop]: Abstraction has 1074 states and 1451 transitions. [2024-11-20 00:06:19,457 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 23.0) internal successors, (69), 3 states have internal predecessors, (69), 3 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2024-11-20 00:06:19,457 INFO L276 IsEmpty]: Start isEmpty. Operand 1074 states and 1451 transitions. [2024-11-20 00:06:19,459 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2024-11-20 00:06:19,459 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 00:06:19,459 INFO L215 NwaCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-20 00:06:19,469 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2024-11-20 00:06:19,659 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-20 00:06:19,660 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-20 00:06:19,661 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 00:06:19,661 INFO L85 PathProgramCache]: Analyzing trace with hash -1050501625, now seen corresponding path program 1 times [2024-11-20 00:06:19,661 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 00:06:19,661 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1164629816] [2024-11-20 00:06:19,661 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 00:06:19,661 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 00:06:19,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:06:19,710 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-20 00:06:19,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:06:19,715 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-11-20 00:06:19,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:06:19,743 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-11-20 00:06:19,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:06:19,746 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2024-11-20 00:06:19,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:06:19,750 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-20 00:06:19,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:06:19,753 INFO L134 CoverageAnalysis]: Checked inductivity of 63 backedges. 13 proven. 10 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2024-11-20 00:06:19,753 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 00:06:19,753 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1164629816] [2024-11-20 00:06:19,753 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1164629816] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-20 00:06:19,753 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1387103230] [2024-11-20 00:06:19,753 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 00:06:19,753 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-20 00:06:19,753 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-20 00:06:19,755 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-20 00:06:19,756 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2024-11-20 00:06:19,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:06:19,841 INFO L255 TraceCheckSpWp]: Trace formula consists of 426 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-20 00:06:19,843 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-20 00:06:19,859 INFO L134 CoverageAnalysis]: Checked inductivity of 63 backedges. 47 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2024-11-20 00:06:19,860 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-20 00:06:19,861 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1387103230] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 00:06:19,861 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-20 00:06:19,861 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [6] total 7 [2024-11-20 00:06:19,861 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [976508725] [2024-11-20 00:06:19,862 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 00:06:19,862 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-20 00:06:19,862 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 00:06:19,862 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-20 00:06:19,862 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-20 00:06:19,862 INFO L87 Difference]: Start difference. First operand 1074 states and 1451 transitions. Second operand has 3 states, 3 states have (on average 26.0) internal successors, (78), 3 states have internal predecessors, (78), 3 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 3 states have call successors, (5) [2024-11-20 00:06:19,921 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 00:06:19,922 INFO L93 Difference]: Finished difference Result 1386 states and 1839 transitions. [2024-11-20 00:06:19,922 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-20 00:06:19,922 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 26.0) internal successors, (78), 3 states have internal predecessors, (78), 3 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 3 states have call successors, (5) Word has length 103 [2024-11-20 00:06:19,922 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 00:06:19,924 INFO L225 Difference]: With dead ends: 1386 [2024-11-20 00:06:19,924 INFO L226 Difference]: Without dead ends: 294 [2024-11-20 00:06:19,926 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 118 GetRequests, 113 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-20 00:06:19,927 INFO L432 NwaCegarLoop]: 588 mSDtfsCounter, 61 mSDsluCounter, 519 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 61 SdHoareTripleChecker+Valid, 1107 SdHoareTripleChecker+Invalid, 10 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-20 00:06:19,927 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [61 Valid, 1107 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-20 00:06:19,928 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 294 states. [2024-11-20 00:06:19,939 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 294 to 294. [2024-11-20 00:06:19,939 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 294 states, 263 states have (on average 1.5475285171102662) internal successors, (407), 265 states have internal predecessors, (407), 24 states have call successors, (24), 7 states have call predecessors, (24), 6 states have return successors, (22), 22 states have call predecessors, (22), 22 states have call successors, (22) [2024-11-20 00:06:19,940 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 294 states to 294 states and 453 transitions. [2024-11-20 00:06:19,941 INFO L78 Accepts]: Start accepts. Automaton has 294 states and 453 transitions. Word has length 103 [2024-11-20 00:06:19,941 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 00:06:19,941 INFO L471 AbstractCegarLoop]: Abstraction has 294 states and 453 transitions. [2024-11-20 00:06:19,941 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 26.0) internal successors, (78), 3 states have internal predecessors, (78), 3 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 3 states have call successors, (5) [2024-11-20 00:06:19,941 INFO L276 IsEmpty]: Start isEmpty. Operand 294 states and 453 transitions. [2024-11-20 00:06:19,942 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 136 [2024-11-20 00:06:19,942 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 00:06:19,942 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] [2024-11-20 00:06:19,950 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2024-11-20 00:06:20,146 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-20 00:06:20,147 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-20 00:06:20,147 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 00:06:20,147 INFO L85 PathProgramCache]: Analyzing trace with hash 2071338203, now seen corresponding path program 1 times [2024-11-20 00:06:20,148 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 00:06:20,148 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [391183111] [2024-11-20 00:06:20,148 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 00:06:20,148 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 00:06:20,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:06:20,185 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-20 00:06:20,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:06:20,224 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-11-20 00:06:20,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:06:20,245 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-20 00:06:20,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:06:20,255 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2024-11-20 00:06:20,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:06:20,259 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 120 [2024-11-20 00:06:20,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:06:20,261 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-20 00:06:20,261 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 00:06:20,261 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [391183111] [2024-11-20 00:06:20,261 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [391183111] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 00:06:20,261 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 00:06:20,261 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-20 00:06:20,261 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1717292850] [2024-11-20 00:06:20,261 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 00:06:20,261 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-20 00:06:20,262 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 00:06:20,262 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-20 00:06:20,262 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-20 00:06:20,262 INFO L87 Difference]: Start difference. First operand 294 states and 453 transitions. Second operand has 5 states, 5 states have (on average 24.8) internal successors, (124), 3 states have internal predecessors, (124), 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-11-20 00:06:21,099 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 00:06:21,099 INFO L93 Difference]: Finished difference Result 677 states and 1062 transitions. [2024-11-20 00:06:21,100 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-20 00:06:21,100 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 24.8) internal successors, (124), 3 states have internal predecessors, (124), 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 135 [2024-11-20 00:06:21,100 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 00:06:21,102 INFO L225 Difference]: With dead ends: 677 [2024-11-20 00:06:21,102 INFO L226 Difference]: Without dead ends: 392 [2024-11-20 00:06:21,102 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2024-11-20 00:06:21,103 INFO L432 NwaCegarLoop]: 276 mSDtfsCounter, 755 mSDsluCounter, 324 mSDsCounter, 0 mSdLazyCounter, 729 mSolverCounterSat, 52 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 775 SdHoareTripleChecker+Valid, 600 SdHoareTripleChecker+Invalid, 781 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 52 IncrementalHoareTripleChecker+Valid, 729 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-11-20 00:06:21,103 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [775 Valid, 600 Invalid, 781 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [52 Valid, 729 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-11-20 00:06:21,103 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 392 states. [2024-11-20 00:06:21,114 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 392 to 294. [2024-11-20 00:06:21,114 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 294 states, 263 states have (on average 1.543726235741445) internal successors, (406), 265 states have internal predecessors, (406), 24 states have call successors, (24), 7 states have call predecessors, (24), 6 states have return successors, (22), 22 states have call predecessors, (22), 22 states have call successors, (22) [2024-11-20 00:06:21,115 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 294 states to 294 states and 452 transitions. [2024-11-20 00:06:21,116 INFO L78 Accepts]: Start accepts. Automaton has 294 states and 452 transitions. Word has length 135 [2024-11-20 00:06:21,116 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 00:06:21,116 INFO L471 AbstractCegarLoop]: Abstraction has 294 states and 452 transitions. [2024-11-20 00:06:21,116 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 24.8) internal successors, (124), 3 states have internal predecessors, (124), 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-11-20 00:06:21,116 INFO L276 IsEmpty]: Start isEmpty. Operand 294 states and 452 transitions. [2024-11-20 00:06:21,118 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 136 [2024-11-20 00:06:21,119 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 00:06:21,119 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] [2024-11-20 00:06:21,119 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-11-20 00:06:21,119 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-20 00:06:21,119 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 00:06:21,120 INFO L85 PathProgramCache]: Analyzing trace with hash -1517032487, now seen corresponding path program 1 times [2024-11-20 00:06:21,120 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 00:06:21,120 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [309662074] [2024-11-20 00:06:21,120 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 00:06:21,120 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 00:06:21,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:06:21,177 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-20 00:06:21,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:06:21,214 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-11-20 00:06:21,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:06:21,249 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-20 00:06:21,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:06:21,258 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2024-11-20 00:06:21,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:06:21,262 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 120 [2024-11-20 00:06:21,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:06:21,264 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-20 00:06:21,264 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 00:06:21,264 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [309662074] [2024-11-20 00:06:21,265 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [309662074] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 00:06:21,265 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 00:06:21,265 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-20 00:06:21,265 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1110849280] [2024-11-20 00:06:21,265 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 00:06:21,265 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-20 00:06:21,265 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 00:06:21,266 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-20 00:06:21,266 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-20 00:06:21,266 INFO L87 Difference]: Start difference. First operand 294 states and 452 transitions. Second operand has 6 states, 6 states have (on average 20.666666666666668) internal successors, (124), 4 states have internal predecessors, (124), 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-11-20 00:06:22,759 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 00:06:22,759 INFO L93 Difference]: Finished difference Result 1054 states and 1661 transitions. [2024-11-20 00:06:22,760 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-20 00:06:22,760 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 20.666666666666668) internal successors, (124), 4 states have internal predecessors, (124), 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 135 [2024-11-20 00:06:22,760 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 00:06:22,763 INFO L225 Difference]: With dead ends: 1054 [2024-11-20 00:06:22,763 INFO L226 Difference]: Without dead ends: 777 [2024-11-20 00:06:22,764 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=33, Invalid=77, Unknown=0, NotChecked=0, Total=110 [2024-11-20 00:06:22,764 INFO L432 NwaCegarLoop]: 254 mSDtfsCounter, 1126 mSDsluCounter, 769 mSDsCounter, 0 mSdLazyCounter, 1598 mSolverCounterSat, 100 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1141 SdHoareTripleChecker+Valid, 1023 SdHoareTripleChecker+Invalid, 1698 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 100 IncrementalHoareTripleChecker+Valid, 1598 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2024-11-20 00:06:22,764 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1141 Valid, 1023 Invalid, 1698 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [100 Valid, 1598 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2024-11-20 00:06:22,765 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 777 states. [2024-11-20 00:06:22,787 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 777 to 580. [2024-11-20 00:06:22,788 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 580 states, 525 states have (on average 1.5561904761904761) internal successors, (817), 528 states have internal predecessors, (817), 41 states have call successors, (41), 13 states have call predecessors, (41), 13 states have return successors, (42), 39 states have call predecessors, (42), 39 states have call successors, (42) [2024-11-20 00:06:22,790 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 580 states to 580 states and 900 transitions. [2024-11-20 00:06:22,790 INFO L78 Accepts]: Start accepts. Automaton has 580 states and 900 transitions. Word has length 135 [2024-11-20 00:06:22,791 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 00:06:22,791 INFO L471 AbstractCegarLoop]: Abstraction has 580 states and 900 transitions. [2024-11-20 00:06:22,791 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 20.666666666666668) internal successors, (124), 4 states have internal predecessors, (124), 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-11-20 00:06:22,791 INFO L276 IsEmpty]: Start isEmpty. Operand 580 states and 900 transitions. [2024-11-20 00:06:22,792 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 136 [2024-11-20 00:06:22,792 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 00:06:22,792 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] [2024-11-20 00:06:22,792 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-11-20 00:06:22,793 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-20 00:06:22,793 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 00:06:22,793 INFO L85 PathProgramCache]: Analyzing trace with hash 1415932373, now seen corresponding path program 1 times [2024-11-20 00:06:22,793 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 00:06:22,793 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [441462934] [2024-11-20 00:06:22,793 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 00:06:22,793 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 00:06:22,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:06:22,862 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-20 00:06:22,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:06:22,900 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-11-20 00:06:22,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:06:22,949 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-20 00:06:22,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:06:22,957 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2024-11-20 00:06:22,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:06:22,962 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 120 [2024-11-20 00:06:22,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:06:22,964 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-20 00:06:22,964 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 00:06:22,965 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [441462934] [2024-11-20 00:06:22,965 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [441462934] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 00:06:22,965 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 00:06:22,965 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-20 00:06:22,965 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [995430998] [2024-11-20 00:06:22,965 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 00:06:22,965 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-20 00:06:22,966 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 00:06:22,966 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-20 00:06:22,966 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-20 00:06:22,967 INFO L87 Difference]: Start difference. First operand 580 states and 900 transitions. Second operand has 7 states, 7 states have (on average 17.714285714285715) internal successors, (124), 5 states have internal predecessors, (124), 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-11-20 00:06:24,748 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 00:06:24,748 INFO L93 Difference]: Finished difference Result 1735 states and 2737 transitions. [2024-11-20 00:06:24,749 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-11-20 00:06:24,749 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 17.714285714285715) internal successors, (124), 5 states have internal predecessors, (124), 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 135 [2024-11-20 00:06:24,749 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 00:06:24,753 INFO L225 Difference]: With dead ends: 1735 [2024-11-20 00:06:24,753 INFO L226 Difference]: Without dead ends: 1172 [2024-11-20 00:06:24,754 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=66, Invalid=174, Unknown=0, NotChecked=0, Total=240 [2024-11-20 00:06:24,755 INFO L432 NwaCegarLoop]: 448 mSDtfsCounter, 1143 mSDsluCounter, 1528 mSDsCounter, 0 mSdLazyCounter, 2546 mSolverCounterSat, 57 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1158 SdHoareTripleChecker+Valid, 1976 SdHoareTripleChecker+Invalid, 2603 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 57 IncrementalHoareTripleChecker+Valid, 2546 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2024-11-20 00:06:24,755 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1158 Valid, 1976 Invalid, 2603 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [57 Valid, 2546 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2024-11-20 00:06:24,756 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1172 states. [2024-11-20 00:06:24,809 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1172 to 847. [2024-11-20 00:06:24,811 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 847 states, 768 states have (on average 1.5494791666666667) internal successors, (1190), 772 states have internal predecessors, (1190), 58 states have call successors, (58), 19 states have call predecessors, (58), 20 states have return successors, (61), 57 states have call predecessors, (61), 56 states have call successors, (61) [2024-11-20 00:06:24,813 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 847 states to 847 states and 1309 transitions. [2024-11-20 00:06:24,814 INFO L78 Accepts]: Start accepts. Automaton has 847 states and 1309 transitions. Word has length 135 [2024-11-20 00:06:24,814 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 00:06:24,814 INFO L471 AbstractCegarLoop]: Abstraction has 847 states and 1309 transitions. [2024-11-20 00:06:24,814 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 17.714285714285715) internal successors, (124), 5 states have internal predecessors, (124), 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-11-20 00:06:24,815 INFO L276 IsEmpty]: Start isEmpty. Operand 847 states and 1309 transitions. [2024-11-20 00:06:24,816 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 136 [2024-11-20 00:06:24,816 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 00:06:24,817 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] [2024-11-20 00:06:24,817 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-11-20 00:06:24,817 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-20 00:06:24,817 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 00:06:24,817 INFO L85 PathProgramCache]: Analyzing trace with hash -950102697, now seen corresponding path program 1 times [2024-11-20 00:06:24,818 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 00:06:24,818 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1293707391] [2024-11-20 00:06:24,818 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 00:06:24,818 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 00:06:24,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:06:24,896 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-20 00:06:24,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:06:24,936 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-11-20 00:06:24,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:06:24,983 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-20 00:06:24,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:06:24,991 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2024-11-20 00:06:24,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:06:24,996 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 120 [2024-11-20 00:06:24,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:06:24,997 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-20 00:06:24,998 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 00:06:24,998 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1293707391] [2024-11-20 00:06:24,998 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1293707391] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 00:06:24,998 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 00:06:24,998 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-20 00:06:24,998 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [889320819] [2024-11-20 00:06:24,998 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 00:06:24,999 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-20 00:06:24,999 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 00:06:24,999 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-20 00:06:24,999 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-20 00:06:24,999 INFO L87 Difference]: Start difference. First operand 847 states and 1309 transitions. Second operand has 7 states, 7 states have (on average 17.714285714285715) internal successors, (124), 5 states have internal predecessors, (124), 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-11-20 00:06:26,678 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 00:06:26,679 INFO L93 Difference]: Finished difference Result 2739 states and 4312 transitions. [2024-11-20 00:06:26,680 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-11-20 00:06:26,680 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 17.714285714285715) internal successors, (124), 5 states have internal predecessors, (124), 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 135 [2024-11-20 00:06:26,680 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 00:06:26,686 INFO L225 Difference]: With dead ends: 2739 [2024-11-20 00:06:26,686 INFO L226 Difference]: Without dead ends: 1909 [2024-11-20 00:06:26,687 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=66, Invalid=174, Unknown=0, NotChecked=0, Total=240 [2024-11-20 00:06:26,688 INFO L432 NwaCegarLoop]: 264 mSDtfsCounter, 1225 mSDsluCounter, 1002 mSDsCounter, 0 mSdLazyCounter, 2159 mSolverCounterSat, 91 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1240 SdHoareTripleChecker+Valid, 1266 SdHoareTripleChecker+Invalid, 2250 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 91 IncrementalHoareTripleChecker+Valid, 2159 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2024-11-20 00:06:26,688 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1240 Valid, 1266 Invalid, 2250 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [91 Valid, 2159 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2024-11-20 00:06:26,689 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1909 states. [2024-11-20 00:06:26,743 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1909 to 1382. [2024-11-20 00:06:26,745 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1382 states, 1255 states have (on average 1.5434262948207171) internal successors, (1937), 1261 states have internal predecessors, (1937), 92 states have call successors, (92), 31 states have call predecessors, (92), 34 states have return successors, (103), 93 states have call predecessors, (103), 90 states have call successors, (103) [2024-11-20 00:06:26,748 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1382 states to 1382 states and 2132 transitions. [2024-11-20 00:06:26,749 INFO L78 Accepts]: Start accepts. Automaton has 1382 states and 2132 transitions. Word has length 135 [2024-11-20 00:06:26,749 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 00:06:26,749 INFO L471 AbstractCegarLoop]: Abstraction has 1382 states and 2132 transitions. [2024-11-20 00:06:26,749 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 17.714285714285715) internal successors, (124), 5 states have internal predecessors, (124), 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-11-20 00:06:26,749 INFO L276 IsEmpty]: Start isEmpty. Operand 1382 states and 2132 transitions. [2024-11-20 00:06:26,750 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 136 [2024-11-20 00:06:26,750 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 00:06:26,750 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] [2024-11-20 00:06:26,751 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-11-20 00:06:26,751 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-20 00:06:26,751 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 00:06:26,751 INFO L85 PathProgramCache]: Analyzing trace with hash 1051783573, now seen corresponding path program 1 times [2024-11-20 00:06:26,751 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 00:06:26,751 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1354745253] [2024-11-20 00:06:26,751 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 00:06:26,752 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 00:06:26,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:06:26,821 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-20 00:06:26,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:06:26,855 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-11-20 00:06:26,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:06:26,896 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-20 00:06:26,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:06:26,904 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2024-11-20 00:06:26,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:06:26,909 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 120 [2024-11-20 00:06:26,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:06:26,910 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-20 00:06:26,910 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 00:06:26,911 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1354745253] [2024-11-20 00:06:26,911 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1354745253] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 00:06:26,911 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 00:06:26,911 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-20 00:06:26,911 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1016452094] [2024-11-20 00:06:26,911 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 00:06:26,911 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-20 00:06:26,912 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 00:06:26,912 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-20 00:06:26,912 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-20 00:06:26,913 INFO L87 Difference]: Start difference. First operand 1382 states and 2132 transitions. Second operand has 7 states, 7 states have (on average 17.714285714285715) internal successors, (124), 5 states have internal predecessors, (124), 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-11-20 00:06:28,795 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 00:06:28,796 INFO L93 Difference]: Finished difference Result 4674 states and 7331 transitions. [2024-11-20 00:06:28,796 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-11-20 00:06:28,796 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 17.714285714285715) internal successors, (124), 5 states have internal predecessors, (124), 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 135 [2024-11-20 00:06:28,797 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 00:06:28,808 INFO L225 Difference]: With dead ends: 4674 [2024-11-20 00:06:28,808 INFO L226 Difference]: Without dead ends: 3309 [2024-11-20 00:06:28,813 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=66, Invalid=174, Unknown=0, NotChecked=0, Total=240 [2024-11-20 00:06:28,813 INFO L432 NwaCegarLoop]: 446 mSDtfsCounter, 1135 mSDsluCounter, 1528 mSDsCounter, 0 mSdLazyCounter, 2540 mSolverCounterSat, 59 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1150 SdHoareTripleChecker+Valid, 1974 SdHoareTripleChecker+Invalid, 2599 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 59 IncrementalHoareTripleChecker+Valid, 2540 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2024-11-20 00:06:28,813 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1150 Valid, 1974 Invalid, 2599 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [59 Valid, 2540 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2024-11-20 00:06:28,816 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3309 states. [2024-11-20 00:06:28,948 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3309 to 2453. [2024-11-20 00:06:28,951 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2453 states, 2230 states have (on average 1.5385650224215246) internal successors, (3431), 2240 states have internal predecessors, (3431), 160 states have call successors, (160), 55 states have call predecessors, (160), 62 states have return successors, (193), 165 states have call predecessors, (193), 158 states have call successors, (193) [2024-11-20 00:06:28,959 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2453 states to 2453 states and 3784 transitions. [2024-11-20 00:06:28,960 INFO L78 Accepts]: Start accepts. Automaton has 2453 states and 3784 transitions. Word has length 135 [2024-11-20 00:06:28,960 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 00:06:28,960 INFO L471 AbstractCegarLoop]: Abstraction has 2453 states and 3784 transitions. [2024-11-20 00:06:28,961 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 17.714285714285715) internal successors, (124), 5 states have internal predecessors, (124), 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-11-20 00:06:28,961 INFO L276 IsEmpty]: Start isEmpty. Operand 2453 states and 3784 transitions. [2024-11-20 00:06:28,962 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 136 [2024-11-20 00:06:28,962 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 00:06:28,962 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] [2024-11-20 00:06:28,962 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-11-20 00:06:28,963 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-20 00:06:28,963 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 00:06:28,963 INFO L85 PathProgramCache]: Analyzing trace with hash -1516038761, now seen corresponding path program 1 times [2024-11-20 00:06:28,963 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 00:06:28,963 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1369208091] [2024-11-20 00:06:28,963 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 00:06:28,963 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 00:06:28,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:06:29,028 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-20 00:06:29,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:06:29,074 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-11-20 00:06:29,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:06:29,116 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-20 00:06:29,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:06:29,125 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2024-11-20 00:06:29,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:06:29,129 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 120 [2024-11-20 00:06:29,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:06:29,131 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-20 00:06:29,131 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 00:06:29,131 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1369208091] [2024-11-20 00:06:29,131 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1369208091] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 00:06:29,131 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 00:06:29,131 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-20 00:06:29,131 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1737367966] [2024-11-20 00:06:29,131 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 00:06:29,132 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-20 00:06:29,132 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 00:06:29,132 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-20 00:06:29,132 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-20 00:06:29,133 INFO L87 Difference]: Start difference. First operand 2453 states and 3784 transitions. Second operand has 7 states, 7 states have (on average 17.714285714285715) internal successors, (124), 5 states have internal predecessors, (124), 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-11-20 00:06:31,069 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 00:06:31,069 INFO L93 Difference]: Finished difference Result 8543 states and 13385 transitions. [2024-11-20 00:06:31,069 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-11-20 00:06:31,070 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 17.714285714285715) internal successors, (124), 5 states have internal predecessors, (124), 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 135 [2024-11-20 00:06:31,070 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 00:06:31,087 INFO L225 Difference]: With dead ends: 8543 [2024-11-20 00:06:31,087 INFO L226 Difference]: Without dead ends: 6107 [2024-11-20 00:06:31,091 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=66, Invalid=174, Unknown=0, NotChecked=0, Total=240 [2024-11-20 00:06:31,092 INFO L432 NwaCegarLoop]: 446 mSDtfsCounter, 1131 mSDsluCounter, 1528 mSDsCounter, 0 mSdLazyCounter, 2531 mSolverCounterSat, 59 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1146 SdHoareTripleChecker+Valid, 1974 SdHoareTripleChecker+Invalid, 2590 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 59 IncrementalHoareTripleChecker+Valid, 2531 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2024-11-20 00:06:31,092 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1146 Valid, 1974 Invalid, 2590 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [59 Valid, 2531 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2024-11-20 00:06:31,095 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6107 states. [2024-11-20 00:06:31,337 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6107 to 4600. [2024-11-20 00:06:31,343 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4600 states, 4185 states have (on average 1.5352449223416966) internal successors, (6425), 4203 states have internal predecessors, (6425), 296 states have call successors, (296), 103 states have call predecessors, (296), 118 states have return successors, (391), 309 states have call predecessors, (391), 294 states have call successors, (391) [2024-11-20 00:06:31,354 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4600 states to 4600 states and 7112 transitions. [2024-11-20 00:06:31,356 INFO L78 Accepts]: Start accepts. Automaton has 4600 states and 7112 transitions. Word has length 135 [2024-11-20 00:06:31,356 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 00:06:31,356 INFO L471 AbstractCegarLoop]: Abstraction has 4600 states and 7112 transitions. [2024-11-20 00:06:31,357 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 17.714285714285715) internal successors, (124), 5 states have internal predecessors, (124), 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-11-20 00:06:31,357 INFO L276 IsEmpty]: Start isEmpty. Operand 4600 states and 7112 transitions. [2024-11-20 00:06:31,360 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 136 [2024-11-20 00:06:31,360 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 00:06:31,360 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] [2024-11-20 00:06:31,360 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-11-20 00:06:31,360 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-20 00:06:31,361 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 00:06:31,361 INFO L85 PathProgramCache]: Analyzing trace with hash -1044682411, now seen corresponding path program 1 times [2024-11-20 00:06:31,361 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 00:06:31,361 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1373789945] [2024-11-20 00:06:31,361 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 00:06:31,361 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 00:06:31,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:06:31,423 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-20 00:06:31,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:06:31,463 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-11-20 00:06:31,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:06:31,497 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-20 00:06:31,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:06:31,505 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2024-11-20 00:06:31,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:06:31,509 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 120 [2024-11-20 00:06:31,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:06:31,511 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-20 00:06:31,511 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 00:06:31,511 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1373789945] [2024-11-20 00:06:31,511 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1373789945] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 00:06:31,511 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 00:06:31,511 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-20 00:06:31,512 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1311382741] [2024-11-20 00:06:31,512 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 00:06:31,512 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-20 00:06:31,513 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 00:06:31,513 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-20 00:06:31,513 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-11-20 00:06:31,514 INFO L87 Difference]: Start difference. First operand 4600 states and 7112 transitions. Second operand has 7 states, 7 states have (on average 17.714285714285715) internal successors, (124), 5 states have internal predecessors, (124), 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-11-20 00:06:32,545 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 00:06:32,545 INFO L93 Difference]: Finished difference Result 10754 states and 16910 transitions. [2024-11-20 00:06:32,545 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-20 00:06:32,545 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 17.714285714285715) internal successors, (124), 5 states have internal predecessors, (124), 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 135 [2024-11-20 00:06:32,545 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 00:06:32,571 INFO L225 Difference]: With dead ends: 10754 [2024-11-20 00:06:32,571 INFO L226 Difference]: Without dead ends: 6171 [2024-11-20 00:06:32,581 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=36, Invalid=74, Unknown=0, NotChecked=0, Total=110 [2024-11-20 00:06:32,581 INFO L432 NwaCegarLoop]: 239 mSDtfsCounter, 951 mSDsluCounter, 590 mSDsCounter, 0 mSdLazyCounter, 1165 mSolverCounterSat, 85 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 967 SdHoareTripleChecker+Valid, 829 SdHoareTripleChecker+Invalid, 1250 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 85 IncrementalHoareTripleChecker+Valid, 1165 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-11-20 00:06:32,582 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [967 Valid, 829 Invalid, 1250 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [85 Valid, 1165 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-11-20 00:06:32,586 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6171 states. [2024-11-20 00:06:32,798 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6171 to 4600. [2024-11-20 00:06:32,803 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4600 states, 4185 states have (on average 1.5311827956989248) internal successors, (6408), 4203 states have internal predecessors, (6408), 296 states have call successors, (296), 103 states have call predecessors, (296), 118 states have return successors, (391), 309 states have call predecessors, (391), 294 states have call successors, (391) [2024-11-20 00:06:32,811 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4600 states to 4600 states and 7095 transitions. [2024-11-20 00:06:32,813 INFO L78 Accepts]: Start accepts. Automaton has 4600 states and 7095 transitions. Word has length 135 [2024-11-20 00:06:32,813 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 00:06:32,813 INFO L471 AbstractCegarLoop]: Abstraction has 4600 states and 7095 transitions. [2024-11-20 00:06:32,814 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 17.714285714285715) internal successors, (124), 5 states have internal predecessors, (124), 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-11-20 00:06:32,814 INFO L276 IsEmpty]: Start isEmpty. Operand 4600 states and 7095 transitions. [2024-11-20 00:06:32,816 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 136 [2024-11-20 00:06:32,816 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 00:06:32,816 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] [2024-11-20 00:06:32,816 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2024-11-20 00:06:32,817 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-20 00:06:32,817 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 00:06:32,817 INFO L85 PathProgramCache]: Analyzing trace with hash 1602921943, now seen corresponding path program 1 times [2024-11-20 00:06:32,817 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 00:06:32,817 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [950001418] [2024-11-20 00:06:32,817 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 00:06:32,817 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 00:06:32,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:06:32,862 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-20 00:06:32,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:06:32,910 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-11-20 00:06:32,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:06:32,942 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-20 00:06:32,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:06:32,950 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2024-11-20 00:06:32,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:06:32,954 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 120 [2024-11-20 00:06:32,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:06:32,956 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-20 00:06:32,956 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 00:06:32,956 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [950001418] [2024-11-20 00:06:32,956 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [950001418] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 00:06:32,956 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 00:06:32,956 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-20 00:06:32,956 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [382817840] [2024-11-20 00:06:32,956 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 00:06:32,957 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-20 00:06:32,957 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 00:06:32,957 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-20 00:06:32,957 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-11-20 00:06:32,957 INFO L87 Difference]: Start difference. First operand 4600 states and 7095 transitions. Second operand has 7 states, 7 states have (on average 17.714285714285715) internal successors, (124), 5 states have internal predecessors, (124), 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-11-20 00:06:34,107 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 00:06:34,107 INFO L93 Difference]: Finished difference Result 10736 states and 16824 transitions. [2024-11-20 00:06:34,107 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-20 00:06:34,107 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 17.714285714285715) internal successors, (124), 5 states have internal predecessors, (124), 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 135 [2024-11-20 00:06:34,108 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 00:06:34,125 INFO L225 Difference]: With dead ends: 10736 [2024-11-20 00:06:34,125 INFO L226 Difference]: Without dead ends: 6153 [2024-11-20 00:06:34,134 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=36, Invalid=74, Unknown=0, NotChecked=0, Total=110 [2024-11-20 00:06:34,134 INFO L432 NwaCegarLoop]: 239 mSDtfsCounter, 835 mSDsluCounter, 751 mSDsCounter, 0 mSdLazyCounter, 1264 mSolverCounterSat, 61 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 851 SdHoareTripleChecker+Valid, 990 SdHoareTripleChecker+Invalid, 1325 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 61 IncrementalHoareTripleChecker+Valid, 1264 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-11-20 00:06:34,134 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [851 Valid, 990 Invalid, 1325 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [61 Valid, 1264 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-11-20 00:06:34,138 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6153 states. [2024-11-20 00:06:34,368 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6153 to 4600. [2024-11-20 00:06:34,377 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4600 states, 4185 states have (on average 1.527120669056153) internal successors, (6391), 4203 states have internal predecessors, (6391), 296 states have call successors, (296), 103 states have call predecessors, (296), 118 states have return successors, (391), 309 states have call predecessors, (391), 294 states have call successors, (391) [2024-11-20 00:06:34,386 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4600 states to 4600 states and 7078 transitions. [2024-11-20 00:06:34,389 INFO L78 Accepts]: Start accepts. Automaton has 4600 states and 7078 transitions. Word has length 135 [2024-11-20 00:06:34,389 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 00:06:34,389 INFO L471 AbstractCegarLoop]: Abstraction has 4600 states and 7078 transitions. [2024-11-20 00:06:34,393 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 17.714285714285715) internal successors, (124), 5 states have internal predecessors, (124), 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-11-20 00:06:34,393 INFO L276 IsEmpty]: Start isEmpty. Operand 4600 states and 7078 transitions. [2024-11-20 00:06:34,395 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 136 [2024-11-20 00:06:34,395 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 00:06:34,395 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] [2024-11-20 00:06:34,396 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2024-11-20 00:06:34,396 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-20 00:06:34,396 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 00:06:34,396 INFO L85 PathProgramCache]: Analyzing trace with hash -528428779, now seen corresponding path program 1 times [2024-11-20 00:06:34,396 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 00:06:34,396 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [328196495] [2024-11-20 00:06:34,396 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 00:06:34,397 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 00:06:34,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:06:34,444 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-20 00:06:34,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:06:34,479 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-11-20 00:06:34,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:06:34,520 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-20 00:06:34,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:06:34,527 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2024-11-20 00:06:34,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:06:34,530 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 120 [2024-11-20 00:06:34,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:06:34,532 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-20 00:06:34,532 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 00:06:34,532 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [328196495] [2024-11-20 00:06:34,532 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [328196495] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 00:06:34,532 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 00:06:34,532 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-20 00:06:34,532 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [51761377] [2024-11-20 00:06:34,532 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 00:06:34,534 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-20 00:06:34,534 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 00:06:34,534 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-20 00:06:34,534 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-20 00:06:34,535 INFO L87 Difference]: Start difference. First operand 4600 states and 7078 transitions. Second operand has 7 states, 7 states have (on average 17.714285714285715) internal successors, (124), 5 states have internal predecessors, (124), 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-11-20 00:06:36,750 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 00:06:36,750 INFO L93 Difference]: Finished difference Result 16225 states and 25279 transitions. [2024-11-20 00:06:36,751 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-11-20 00:06:36,751 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 17.714285714285715) internal successors, (124), 5 states have internal predecessors, (124), 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 135 [2024-11-20 00:06:36,751 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 00:06:36,785 INFO L225 Difference]: With dead ends: 16225 [2024-11-20 00:06:36,785 INFO L226 Difference]: Without dead ends: 11642 [2024-11-20 00:06:36,796 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=66, Invalid=174, Unknown=0, NotChecked=0, Total=240 [2024-11-20 00:06:36,797 INFO L432 NwaCegarLoop]: 446 mSDtfsCounter, 1117 mSDsluCounter, 1528 mSDsCounter, 0 mSdLazyCounter, 2450 mSolverCounterSat, 59 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1132 SdHoareTripleChecker+Valid, 1974 SdHoareTripleChecker+Invalid, 2509 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 59 IncrementalHoareTripleChecker+Valid, 2450 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2024-11-20 00:06:36,797 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1132 Valid, 1974 Invalid, 2509 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [59 Valid, 2450 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2024-11-20 00:06:36,803 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11642 states. [2024-11-20 00:06:37,277 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11642 to 8956. [2024-11-20 00:06:37,285 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8956 states, 8157 states have (on average 1.524212332965551) internal successors, (12433), 8191 states have internal predecessors, (12433), 568 states have call successors, (568), 199 states have call predecessors, (568), 230 states have return successors, (841), 597 states have call predecessors, (841), 566 states have call successors, (841) [2024-11-20 00:06:37,300 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8956 states to 8956 states and 13842 transitions. [2024-11-20 00:06:37,304 INFO L78 Accepts]: Start accepts. Automaton has 8956 states and 13842 transitions. Word has length 135 [2024-11-20 00:06:37,304 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 00:06:37,304 INFO L471 AbstractCegarLoop]: Abstraction has 8956 states and 13842 transitions. [2024-11-20 00:06:37,304 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 17.714285714285715) internal successors, (124), 5 states have internal predecessors, (124), 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-11-20 00:06:37,304 INFO L276 IsEmpty]: Start isEmpty. Operand 8956 states and 13842 transitions. [2024-11-20 00:06:37,308 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 136 [2024-11-20 00:06:37,308 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 00:06:37,309 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] [2024-11-20 00:06:37,309 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2024-11-20 00:06:37,309 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-20 00:06:37,309 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 00:06:37,309 INFO L85 PathProgramCache]: Analyzing trace with hash 1793373139, now seen corresponding path program 1 times [2024-11-20 00:06:37,309 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 00:06:37,309 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1487274645] [2024-11-20 00:06:37,309 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 00:06:37,309 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 00:06:37,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:06:37,355 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-20 00:06:37,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:06:37,388 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-11-20 00:06:37,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:06:37,424 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-20 00:06:37,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:06:37,431 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2024-11-20 00:06:37,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:06:37,434 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 120 [2024-11-20 00:06:37,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:06:37,436 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-20 00:06:37,436 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 00:06:37,436 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1487274645] [2024-11-20 00:06:37,436 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1487274645] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 00:06:37,436 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 00:06:37,436 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-20 00:06:37,436 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1192676774] [2024-11-20 00:06:37,436 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 00:06:37,437 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-20 00:06:37,437 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 00:06:37,437 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-20 00:06:37,437 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-20 00:06:37,437 INFO L87 Difference]: Start difference. First operand 8956 states and 13842 transitions. Second operand has 7 states, 7 states have (on average 17.714285714285715) internal successors, (124), 5 states have internal predecessors, (124), 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-11-20 00:06:40,453 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 00:06:40,453 INFO L93 Difference]: Finished difference Result 35571 states and 55507 transitions. [2024-11-20 00:06:40,454 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-11-20 00:06:40,454 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 17.714285714285715) internal successors, (124), 5 states have internal predecessors, (124), 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 135 [2024-11-20 00:06:40,454 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 00:06:40,518 INFO L225 Difference]: With dead ends: 35571 [2024-11-20 00:06:40,518 INFO L226 Difference]: Without dead ends: 26632 [2024-11-20 00:06:40,536 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 46 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=73, Invalid=199, Unknown=0, NotChecked=0, Total=272 [2024-11-20 00:06:40,536 INFO L432 NwaCegarLoop]: 444 mSDtfsCounter, 1446 mSDsluCounter, 1520 mSDsCounter, 0 mSdLazyCounter, 2430 mSolverCounterSat, 62 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1470 SdHoareTripleChecker+Valid, 1964 SdHoareTripleChecker+Invalid, 2492 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 62 IncrementalHoareTripleChecker+Valid, 2430 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2024-11-20 00:06:40,536 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1470 Valid, 1964 Invalid, 2492 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [62 Valid, 2430 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2024-11-20 00:06:40,555 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26632 states. [2024-11-20 00:06:41,509 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26632 to 17597. [2024-11-20 00:06:41,521 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17597 states, 16062 states have (on average 1.5245299464574773) internal successors, (24487), 16128 states have internal predecessors, (24487), 1080 states have call successors, (1080), 391 states have call predecessors, (1080), 454 states have return successors, (1871), 1141 states have call predecessors, (1871), 1078 states have call successors, (1871) [2024-11-20 00:06:41,553 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17597 states to 17597 states and 27438 transitions. [2024-11-20 00:06:41,558 INFO L78 Accepts]: Start accepts. Automaton has 17597 states and 27438 transitions. Word has length 135 [2024-11-20 00:06:41,558 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 00:06:41,558 INFO L471 AbstractCegarLoop]: Abstraction has 17597 states and 27438 transitions. [2024-11-20 00:06:41,559 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 17.714285714285715) internal successors, (124), 5 states have internal predecessors, (124), 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-11-20 00:06:41,559 INFO L276 IsEmpty]: Start isEmpty. Operand 17597 states and 27438 transitions. [2024-11-20 00:06:41,567 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 136 [2024-11-20 00:06:41,567 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 00:06:41,567 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] [2024-11-20 00:06:41,567 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2024-11-20 00:06:41,567 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-20 00:06:41,568 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 00:06:41,568 INFO L85 PathProgramCache]: Analyzing trace with hash -348487339, now seen corresponding path program 1 times [2024-11-20 00:06:41,568 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 00:06:41,568 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1206408245] [2024-11-20 00:06:41,568 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 00:06:41,568 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 00:06:41,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:06:41,612 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-20 00:06:41,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:06:41,654 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-11-20 00:06:41,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:06:41,693 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-20 00:06:41,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:06:41,702 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2024-11-20 00:06:41,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:06:41,705 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 120 [2024-11-20 00:06:41,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:06:41,706 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-20 00:06:41,706 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 00:06:41,706 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1206408245] [2024-11-20 00:06:41,706 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1206408245] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 00:06:41,706 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 00:06:41,706 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-20 00:06:41,707 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1743109645] [2024-11-20 00:06:41,707 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 00:06:41,707 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-20 00:06:41,707 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 00:06:41,708 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-20 00:06:41,708 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-20 00:06:41,708 INFO L87 Difference]: Start difference. First operand 17597 states and 27438 transitions. Second operand has 7 states, 7 states have (on average 17.714285714285715) internal successors, (124), 5 states have internal predecessors, (124), 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-11-20 00:06:46,343 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 00:06:46,343 INFO L93 Difference]: Finished difference Result 69330 states and 109061 transitions. [2024-11-20 00:06:46,344 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-11-20 00:06:46,344 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 17.714285714285715) internal successors, (124), 5 states have internal predecessors, (124), 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 135 [2024-11-20 00:06:46,344 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 00:06:46,487 INFO L225 Difference]: With dead ends: 69330 [2024-11-20 00:06:46,487 INFO L226 Difference]: Without dead ends: 51750 [2024-11-20 00:06:46,525 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=73, Invalid=199, Unknown=0, NotChecked=0, Total=272 [2024-11-20 00:06:46,526 INFO L432 NwaCegarLoop]: 290 mSDtfsCounter, 1262 mSDsluCounter, 1022 mSDsCounter, 0 mSdLazyCounter, 2658 mSolverCounterSat, 87 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1276 SdHoareTripleChecker+Valid, 1312 SdHoareTripleChecker+Invalid, 2745 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 87 IncrementalHoareTripleChecker+Valid, 2658 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2024-11-20 00:06:46,526 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1276 Valid, 1312 Invalid, 2745 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [87 Valid, 2658 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2024-11-20 00:06:46,554 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51750 states. [2024-11-20 00:06:48,950 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51750 to 34206. [2024-11-20 00:06:48,981 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 34206 states, 31231 states have (on average 1.5200601965995326) internal successors, (47473), 31361 states have internal predecessors, (47473), 2072 states have call successors, (2072), 775 states have call predecessors, (2072), 902 states have return successors, (4385), 2197 states have call predecessors, (4385), 2070 states have call successors, (4385) [2024-11-20 00:06:49,083 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34206 states to 34206 states and 53930 transitions. [2024-11-20 00:06:49,094 INFO L78 Accepts]: Start accepts. Automaton has 34206 states and 53930 transitions. Word has length 135 [2024-11-20 00:06:49,095 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 00:06:49,095 INFO L471 AbstractCegarLoop]: Abstraction has 34206 states and 53930 transitions. [2024-11-20 00:06:49,095 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 17.714285714285715) internal successors, (124), 5 states have internal predecessors, (124), 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-11-20 00:06:49,095 INFO L276 IsEmpty]: Start isEmpty. Operand 34206 states and 53930 transitions. [2024-11-20 00:06:49,113 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 136 [2024-11-20 00:06:49,113 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 00:06:49,113 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] [2024-11-20 00:06:49,114 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2024-11-20 00:06:49,114 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-20 00:06:49,114 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 00:06:49,114 INFO L85 PathProgramCache]: Analyzing trace with hash -971768941, now seen corresponding path program 1 times [2024-11-20 00:06:49,114 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 00:06:49,114 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1600296189] [2024-11-20 00:06:49,115 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 00:06:49,116 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 00:06:49,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:06:49,176 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-20 00:06:49,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:06:49,215 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-11-20 00:06:49,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:06:49,257 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-20 00:06:49,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:06:49,267 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2024-11-20 00:06:49,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:06:49,273 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 120 [2024-11-20 00:06:49,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:06:49,275 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-20 00:06:49,275 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 00:06:49,275 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1600296189] [2024-11-20 00:06:49,276 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1600296189] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 00:06:49,276 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 00:06:49,276 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-20 00:06:49,276 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1314821615] [2024-11-20 00:06:49,276 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 00:06:49,277 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-20 00:06:49,277 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 00:06:49,277 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-20 00:06:49,277 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-20 00:06:49,278 INFO L87 Difference]: Start difference. First operand 34206 states and 53930 transitions. Second operand has 7 states, 7 states have (on average 17.714285714285715) internal successors, (124), 5 states have internal predecessors, (124), 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-11-20 00:06:56,575 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 00:06:56,576 INFO L93 Difference]: Finished difference Result 133745 states and 212707 transitions. [2024-11-20 00:06:56,576 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-11-20 00:06:56,576 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 17.714285714285715) internal successors, (124), 5 states have internal predecessors, (124), 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 135 [2024-11-20 00:06:56,576 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 00:06:56,864 INFO L225 Difference]: With dead ends: 133745 [2024-11-20 00:06:56,864 INFO L226 Difference]: Without dead ends: 99556 [2024-11-20 00:06:56,953 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=73, Invalid=199, Unknown=0, NotChecked=0, Total=272 [2024-11-20 00:06:56,954 INFO L432 NwaCegarLoop]: 444 mSDtfsCounter, 1366 mSDsluCounter, 1520 mSDsCounter, 0 mSdLazyCounter, 2404 mSolverCounterSat, 62 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1390 SdHoareTripleChecker+Valid, 1964 SdHoareTripleChecker+Invalid, 2466 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 62 IncrementalHoareTripleChecker+Valid, 2404 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2024-11-20 00:06:56,954 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1390 Valid, 1964 Invalid, 2466 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [62 Valid, 2404 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2024-11-20 00:06:57,003 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99556 states. [2024-11-20 00:07:01,461 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99556 to 67999. [2024-11-20 00:07:01,516 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 67999 states, 62208 states have (on average 1.5216531635802468) internal successors, (94659), 62466 states have internal predecessors, (94659), 3992 states have call successors, (3992), 1543 states have call predecessors, (3992), 1798 states have return successors, (10807), 4245 states have call predecessors, (10807), 3990 states have call successors, (10807) [2024-11-20 00:07:01,695 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67999 states to 67999 states and 109458 transitions. [2024-11-20 00:07:01,718 INFO L78 Accepts]: Start accepts. Automaton has 67999 states and 109458 transitions. Word has length 135 [2024-11-20 00:07:01,718 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 00:07:01,719 INFO L471 AbstractCegarLoop]: Abstraction has 67999 states and 109458 transitions. [2024-11-20 00:07:01,719 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 17.714285714285715) internal successors, (124), 5 states have internal predecessors, (124), 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-11-20 00:07:01,719 INFO L276 IsEmpty]: Start isEmpty. Operand 67999 states and 109458 transitions. [2024-11-20 00:07:01,751 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 136 [2024-11-20 00:07:01,751 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 00:07:01,751 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] [2024-11-20 00:07:01,751 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2024-11-20 00:07:01,752 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-20 00:07:01,752 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 00:07:01,752 INFO L85 PathProgramCache]: Analyzing trace with hash -853327467, now seen corresponding path program 1 times [2024-11-20 00:07:01,752 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 00:07:01,752 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1098879066] [2024-11-20 00:07:01,752 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 00:07:01,752 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 00:07:01,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:07:01,798 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-20 00:07:01,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:07:01,831 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-11-20 00:07:01,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:07:01,870 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-20 00:07:01,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:07:01,878 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2024-11-20 00:07:01,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:07:01,881 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 120 [2024-11-20 00:07:01,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:07:01,882 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-20 00:07:01,882 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 00:07:01,882 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1098879066] [2024-11-20 00:07:01,882 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1098879066] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 00:07:01,882 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 00:07:01,882 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-20 00:07:01,883 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [376803540] [2024-11-20 00:07:01,883 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 00:07:01,883 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-20 00:07:01,883 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 00:07:01,883 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-20 00:07:01,884 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-20 00:07:01,884 INFO L87 Difference]: Start difference. First operand 67999 states and 109458 transitions. Second operand has 7 states, 7 states have (on average 17.714285714285715) internal successors, (124), 5 states have internal predecessors, (124), 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-11-20 00:07:14,144 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 00:07:14,145 INFO L93 Difference]: Finished difference Result 262000 states and 425385 transitions. [2024-11-20 00:07:14,145 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-11-20 00:07:14,145 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 17.714285714285715) internal successors, (124), 5 states have internal predecessors, (124), 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 135 [2024-11-20 00:07:14,145 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 00:07:14,799 INFO L225 Difference]: With dead ends: 262000 [2024-11-20 00:07:14,799 INFO L226 Difference]: Without dead ends: 194018 [2024-11-20 00:07:14,953 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=73, Invalid=199, Unknown=0, NotChecked=0, Total=272 [2024-11-20 00:07:14,954 INFO L432 NwaCegarLoop]: 444 mSDtfsCounter, 1166 mSDsluCounter, 1520 mSDsCounter, 0 mSdLazyCounter, 2782 mSolverCounterSat, 61 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1180 SdHoareTripleChecker+Valid, 1964 SdHoareTripleChecker+Invalid, 2843 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 61 IncrementalHoareTripleChecker+Valid, 2782 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.7s IncrementalHoareTripleChecker+Time [2024-11-20 00:07:14,954 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1180 Valid, 1964 Invalid, 2843 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [61 Valid, 2782 Invalid, 0 Unknown, 0 Unchecked, 1.7s Time] [2024-11-20 00:07:15,169 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 194018 states.