/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf -tc ../../../trunk/examples/toolchains/AutomizerC.xml -i ../sv-benchmarks/c/systemc/transmitter.03.cil.c -------------------------------------------------------------------------------- This is Ultimate 0.2.3-dev-f954360 [2023-03-31 01:26:12,275 INFO L177 SettingsManager]: Resetting all preferences to default values... [2023-03-31 01:26:12,277 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2023-03-31 01:26:12,316 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2023-03-31 01:26:12,316 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2023-03-31 01:26:12,319 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2023-03-31 01:26:12,321 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2023-03-31 01:26:12,324 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2023-03-31 01:26:12,325 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2023-03-31 01:26:12,330 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2023-03-31 01:26:12,331 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2023-03-31 01:26:12,332 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2023-03-31 01:26:12,333 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2023-03-31 01:26:12,335 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2023-03-31 01:26:12,336 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2023-03-31 01:26:12,337 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2023-03-31 01:26:12,337 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2023-03-31 01:26:12,338 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2023-03-31 01:26:12,340 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2023-03-31 01:26:12,344 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2023-03-31 01:26:12,345 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2023-03-31 01:26:12,346 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2023-03-31 01:26:12,347 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2023-03-31 01:26:12,349 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2023-03-31 01:26:12,356 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2023-03-31 01:26:12,356 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2023-03-31 01:26:12,356 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2023-03-31 01:26:12,358 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2023-03-31 01:26:12,358 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2023-03-31 01:26:12,358 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2023-03-31 01:26:12,359 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2023-03-31 01:26:12,359 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2023-03-31 01:26:12,360 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2023-03-31 01:26:12,361 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2023-03-31 01:26:12,361 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2023-03-31 01:26:12,362 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2023-03-31 01:26:12,362 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2023-03-31 01:26:12,362 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2023-03-31 01:26:12,362 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2023-03-31 01:26:12,363 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2023-03-31 01:26:12,363 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2023-03-31 01:26:12,365 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2023-03-31 01:26:12,392 INFO L113 SettingsManager]: Loading preferences was successful [2023-03-31 01:26:12,393 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2023-03-31 01:26:12,393 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-03-31 01:26:12,393 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-03-31 01:26:12,394 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-03-31 01:26:12,395 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-03-31 01:26:12,395 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-03-31 01:26:12,395 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2023-03-31 01:26:12,395 INFO L138 SettingsManager]: * Use SBE=true [2023-03-31 01:26:12,395 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-03-31 01:26:12,396 INFO L138 SettingsManager]: * sizeof long=4 [2023-03-31 01:26:12,396 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2023-03-31 01:26:12,396 INFO L138 SettingsManager]: * sizeof POINTER=4 [2023-03-31 01:26:12,397 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2023-03-31 01:26:12,397 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-03-31 01:26:12,397 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-03-31 01:26:12,397 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-03-31 01:26:12,397 INFO L138 SettingsManager]: * sizeof long double=12 [2023-03-31 01:26:12,397 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2023-03-31 01:26:12,397 INFO L138 SettingsManager]: * Use constant arrays=true [2023-03-31 01:26:12,397 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-03-31 01:26:12,398 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-03-31 01:26:12,398 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-03-31 01:26:12,398 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2023-03-31 01:26:12,398 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-03-31 01:26:12,398 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-03-31 01:26:12,398 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-03-31 01:26:12,399 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2023-03-31 01:26:12,399 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2023-03-31 01:26:12,399 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-03-31 01:26:12,399 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-03-31 01:26:12,399 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-03-31 01:26:12,400 INFO L138 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-03-31 01:26:12,400 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-03-31 01:26:12,400 INFO L138 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC [2023-03-31 01:26:12,400 INFO L138 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 [2023-03-31 01:26:12,627 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-03-31 01:26:12,655 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-03-31 01:26:12,657 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-03-31 01:26:12,658 INFO L271 PluginConnector]: Initializing CDTParser... [2023-03-31 01:26:12,659 INFO L275 PluginConnector]: CDTParser initialized [2023-03-31 01:26:12,660 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/systemc/transmitter.03.cil.c [2023-03-31 01:26:13,790 INFO L500 CDTParser]: Created temporary CDT project at NULL [2023-03-31 01:26:13,981 INFO L351 CDTParser]: Found 1 translation units. [2023-03-31 01:26:13,981 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/systemc/transmitter.03.cil.c [2023-03-31 01:26:13,988 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/62b8b70ea/fb4a324a0da44f9083a4f8a878bb959e/FLAGc76978cb3 [2023-03-31 01:26:14,000 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/62b8b70ea/fb4a324a0da44f9083a4f8a878bb959e [2023-03-31 01:26:14,002 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-03-31 01:26:14,004 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2023-03-31 01:26:14,005 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-03-31 01:26:14,005 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-03-31 01:26:14,011 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2023-03-31 01:26:14,012 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 31.03 01:26:14" (1/1) ... [2023-03-31 01:26:14,013 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3b1d74db and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.03 01:26:14, skipping insertion in model container [2023-03-31 01:26:14,013 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 31.03 01:26:14" (1/1) ... [2023-03-31 01:26:14,019 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2023-03-31 01:26:14,053 INFO L178 MainTranslator]: Built tables and reachable declarations [2023-03-31 01:26:14,158 WARN L247 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/systemc/transmitter.03.cil.c[706,719] [2023-03-31 01:26:14,203 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-03-31 01:26:14,218 INFO L203 MainTranslator]: Completed pre-run [2023-03-31 01:26:14,227 WARN L247 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/systemc/transmitter.03.cil.c[706,719] [2023-03-31 01:26:14,258 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-03-31 01:26:14,271 INFO L208 MainTranslator]: Completed translation [2023-03-31 01:26:14,271 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.03 01:26:14 WrapperNode [2023-03-31 01:26:14,271 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-03-31 01:26:14,272 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-03-31 01:26:14,272 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2023-03-31 01:26:14,272 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2023-03-31 01:26:14,282 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.03 01:26:14" (1/1) ... [2023-03-31 01:26:14,282 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.03 01:26:14" (1/1) ... [2023-03-31 01:26:14,297 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.03 01:26:14" (1/1) ... [2023-03-31 01:26:14,298 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.03 01:26:14" (1/1) ... [2023-03-31 01:26:14,306 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.03 01:26:14" (1/1) ... [2023-03-31 01:26:14,329 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.03 01:26:14" (1/1) ... [2023-03-31 01:26:14,331 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.03 01:26:14" (1/1) ... [2023-03-31 01:26:14,333 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.03 01:26:14" (1/1) ... [2023-03-31 01:26:14,335 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-03-31 01:26:14,336 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-03-31 01:26:14,336 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2023-03-31 01:26:14,336 INFO L275 PluginConnector]: RCFGBuilder initialized [2023-03-31 01:26:14,337 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.03 01:26:14" (1/1) ... [2023-03-31 01:26:14,357 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-03-31 01:26:14,367 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-03-31 01:26:14,383 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2023-03-31 01:26:14,405 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2023-03-31 01:26:14,420 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2023-03-31 01:26:14,421 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-03-31 01:26:14,423 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2023-03-31 01:26:14,423 INFO L138 BoogieDeclarations]: Found implementation of procedure error [2023-03-31 01:26:14,423 INFO L138 BoogieDeclarations]: Found implementation of procedure master [2023-03-31 01:26:14,423 INFO L138 BoogieDeclarations]: Found implementation of procedure transmit1 [2023-03-31 01:26:14,423 INFO L138 BoogieDeclarations]: Found implementation of procedure transmit2 [2023-03-31 01:26:14,424 INFO L138 BoogieDeclarations]: Found implementation of procedure transmit3 [2023-03-31 01:26:14,424 INFO L138 BoogieDeclarations]: Found implementation of procedure is_master_triggered [2023-03-31 01:26:14,424 INFO L138 BoogieDeclarations]: Found implementation of procedure is_transmit1_triggered [2023-03-31 01:26:14,424 INFO L138 BoogieDeclarations]: Found implementation of procedure is_transmit2_triggered [2023-03-31 01:26:14,424 INFO L138 BoogieDeclarations]: Found implementation of procedure is_transmit3_triggered [2023-03-31 01:26:14,424 INFO L138 BoogieDeclarations]: Found implementation of procedure update_channels [2023-03-31 01:26:14,424 INFO L138 BoogieDeclarations]: Found implementation of procedure init_threads [2023-03-31 01:26:14,424 INFO L138 BoogieDeclarations]: Found implementation of procedure exists_runnable_thread [2023-03-31 01:26:14,424 INFO L138 BoogieDeclarations]: Found implementation of procedure eval [2023-03-31 01:26:14,424 INFO L138 BoogieDeclarations]: Found implementation of procedure fire_delta_events [2023-03-31 01:26:14,424 INFO L138 BoogieDeclarations]: Found implementation of procedure reset_delta_events [2023-03-31 01:26:14,425 INFO L138 BoogieDeclarations]: Found implementation of procedure activate_threads [2023-03-31 01:26:14,425 INFO L138 BoogieDeclarations]: Found implementation of procedure immediate_notify [2023-03-31 01:26:14,425 INFO L138 BoogieDeclarations]: Found implementation of procedure fire_time_events [2023-03-31 01:26:14,425 INFO L138 BoogieDeclarations]: Found implementation of procedure reset_time_events [2023-03-31 01:26:14,425 INFO L138 BoogieDeclarations]: Found implementation of procedure init_model [2023-03-31 01:26:14,425 INFO L138 BoogieDeclarations]: Found implementation of procedure stop_simulation [2023-03-31 01:26:14,425 INFO L138 BoogieDeclarations]: Found implementation of procedure start_simulation [2023-03-31 01:26:14,425 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2023-03-31 01:26:14,425 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2023-03-31 01:26:14,425 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2023-03-31 01:26:14,425 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2023-03-31 01:26:14,425 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-03-31 01:26:14,426 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2023-03-31 01:26:14,426 INFO L130 BoogieDeclarations]: Found specification of procedure error [2023-03-31 01:26:14,426 INFO L130 BoogieDeclarations]: Found specification of procedure is_master_triggered [2023-03-31 01:26:14,426 INFO L130 BoogieDeclarations]: Found specification of procedure is_transmit1_triggered [2023-03-31 01:26:14,426 INFO L130 BoogieDeclarations]: Found specification of procedure is_transmit2_triggered [2023-03-31 01:26:14,426 INFO L130 BoogieDeclarations]: Found specification of procedure is_transmit3_triggered [2023-03-31 01:26:14,426 INFO L130 BoogieDeclarations]: Found specification of procedure immediate_notify [2023-03-31 01:26:14,426 INFO L130 BoogieDeclarations]: Found specification of procedure master [2023-03-31 01:26:14,426 INFO L130 BoogieDeclarations]: Found specification of procedure transmit1 [2023-03-31 01:26:14,426 INFO L130 BoogieDeclarations]: Found specification of procedure transmit2 [2023-03-31 01:26:14,426 INFO L130 BoogieDeclarations]: Found specification of procedure transmit3 [2023-03-31 01:26:14,427 INFO L130 BoogieDeclarations]: Found specification of procedure update_channels [2023-03-31 01:26:14,427 INFO L130 BoogieDeclarations]: Found specification of procedure init_threads [2023-03-31 01:26:14,427 INFO L130 BoogieDeclarations]: Found specification of procedure exists_runnable_thread [2023-03-31 01:26:14,427 INFO L130 BoogieDeclarations]: Found specification of procedure eval [2023-03-31 01:26:14,427 INFO L130 BoogieDeclarations]: Found specification of procedure fire_delta_events [2023-03-31 01:26:14,427 INFO L130 BoogieDeclarations]: Found specification of procedure reset_delta_events [2023-03-31 01:26:14,427 INFO L130 BoogieDeclarations]: Found specification of procedure activate_threads [2023-03-31 01:26:14,427 INFO L130 BoogieDeclarations]: Found specification of procedure fire_time_events [2023-03-31 01:26:14,427 INFO L130 BoogieDeclarations]: Found specification of procedure reset_time_events [2023-03-31 01:26:14,427 INFO L130 BoogieDeclarations]: Found specification of procedure init_model [2023-03-31 01:26:14,428 INFO L130 BoogieDeclarations]: Found specification of procedure stop_simulation [2023-03-31 01:26:14,428 INFO L130 BoogieDeclarations]: Found specification of procedure start_simulation [2023-03-31 01:26:14,428 INFO L130 BoogieDeclarations]: Found specification of procedure main [2023-03-31 01:26:14,429 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2023-03-31 01:26:14,429 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-03-31 01:26:14,429 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-03-31 01:26:14,430 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-03-31 01:26:14,430 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2023-03-31 01:26:14,430 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-03-31 01:26:14,523 INFO L236 CfgBuilder]: Building ICFG [2023-03-31 01:26:14,525 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2023-03-31 01:26:14,922 INFO L277 CfgBuilder]: Performing block encoding [2023-03-31 01:26:14,930 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-03-31 01:26:14,930 INFO L302 CfgBuilder]: Removed 7 assume(true) statements. [2023-03-31 01:26:14,932 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 31.03 01:26:14 BoogieIcfgContainer [2023-03-31 01:26:14,932 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-03-31 01:26:14,934 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-03-31 01:26:14,934 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2023-03-31 01:26:14,936 INFO L275 PluginConnector]: TraceAbstraction initialized [2023-03-31 01:26:14,936 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 31.03 01:26:14" (1/3) ... [2023-03-31 01:26:14,937 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@46710d44 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 31.03 01:26:14, skipping insertion in model container [2023-03-31 01:26:14,937 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.03 01:26:14" (2/3) ... [2023-03-31 01:26:14,937 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@46710d44 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 31.03 01:26:14, skipping insertion in model container [2023-03-31 01:26:14,937 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 31.03 01:26:14" (3/3) ... [2023-03-31 01:26:14,938 INFO L112 eAbstractionObserver]: Analyzing ICFG transmitter.03.cil.c [2023-03-31 01:26:14,963 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-03-31 01:26:14,963 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-03-31 01:26:15,053 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-03-31 01:26:15,059 INFO L357 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, mHoare=true, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, 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;@4c250ba4, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-03-31 01:26:15,059 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-03-31 01:26:15,064 INFO L276 IsEmpty]: Start isEmpty. Operand has 199 states, 139 states have (on average 1.5467625899280575) internal successors, (215), 147 states have internal predecessors, (215), 34 states have call successors, (34), 24 states have call predecessors, (34), 24 states have return successors, (34), 34 states have call predecessors, (34), 34 states have call successors, (34) [2023-03-31 01:26:15,079 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2023-03-31 01:26:15,080 INFO L187 NwaCegarLoop]: Found error trace [2023-03-31 01:26:15,080 INFO L195 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] [2023-03-31 01:26:15,081 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-03-31 01:26:15,085 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-03-31 01:26:15,085 INFO L85 PathProgramCache]: Analyzing trace with hash 350887552, now seen corresponding path program 1 times [2023-03-31 01:26:15,091 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-03-31 01:26:15,092 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1877462513] [2023-03-31 01:26:15,092 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-03-31 01:26:15,092 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-03-31 01:26:15,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-03-31 01:26:15,495 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2023-03-31 01:26:15,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-03-31 01:26:15,517 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2023-03-31 01:26:15,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-03-31 01:26:15,527 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2023-03-31 01:26:15,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-03-31 01:26:15,541 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2023-03-31 01:26:15,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-03-31 01:26:15,581 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2023-03-31 01:26:15,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-03-31 01:26:15,604 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-03-31 01:26:15,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-03-31 01:26:15,630 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-03-31 01:26:15,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-03-31 01:26:15,635 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-03-31 01:26:15,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-03-31 01:26:15,639 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2023-03-31 01:26:15,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-03-31 01:26:15,642 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2023-03-31 01:26:15,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-03-31 01:26:15,646 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2023-03-31 01:26:15,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-03-31 01:26:15,662 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2023-03-31 01:26:15,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-03-31 01:26:15,666 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-03-31 01:26:15,667 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-03-31 01:26:15,667 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1877462513] [2023-03-31 01:26:15,667 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1877462513] provided 1 perfect and 0 imperfect interpolant sequences [2023-03-31 01:26:15,668 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-03-31 01:26:15,668 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2023-03-31 01:26:15,669 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1183778877] [2023-03-31 01:26:15,670 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-03-31 01:26:15,673 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-03-31 01:26:15,674 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-03-31 01:26:15,696 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-03-31 01:26:15,697 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2023-03-31 01:26:15,702 INFO L87 Difference]: Start difference. First operand has 199 states, 139 states have (on average 1.5467625899280575) internal successors, (215), 147 states have internal predecessors, (215), 34 states have call successors, (34), 24 states have call predecessors, (34), 24 states have return successors, (34), 34 states have call predecessors, (34), 34 states have call successors, (34) Second operand has 8 states, 8 states have (on average 9.5) internal successors, (76), 4 states have internal predecessors, (76), 3 states have call successors, (17), 7 states have call predecessors, (17), 3 states have return successors, (12), 3 states have call predecessors, (12), 3 states have call successors, (12) [2023-03-31 01:26:17,287 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-03-31 01:26:17,288 INFO L93 Difference]: Finished difference Result 493 states and 764 transitions. [2023-03-31 01:26:17,289 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2023-03-31 01:26:17,290 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 9.5) internal successors, (76), 4 states have internal predecessors, (76), 3 states have call successors, (17), 7 states have call predecessors, (17), 3 states have return successors, (12), 3 states have call predecessors, (12), 3 states have call successors, (12) Word has length 105 [2023-03-31 01:26:17,291 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-03-31 01:26:17,310 INFO L225 Difference]: With dead ends: 493 [2023-03-31 01:26:17,310 INFO L226 Difference]: Without dead ends: 298 [2023-03-31 01:26:17,314 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=62, Invalid=148, Unknown=0, NotChecked=0, Total=210 [2023-03-31 01:26:17,317 INFO L413 NwaCegarLoop]: 13 mSDtfsCounter, 660 mSDsluCounter, 31 mSDsCounter, 0 mSdLazyCounter, 1172 mSolverCounterSat, 223 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 660 SdHoareTripleChecker+Valid, 44 SdHoareTripleChecker+Invalid, 1395 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 223 IncrementalHoareTripleChecker+Valid, 1172 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2023-03-31 01:26:17,318 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [660 Valid, 44 Invalid, 1395 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [223 Valid, 1172 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2023-03-31 01:26:17,332 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 298 states. [2023-03-31 01:26:17,401 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 298 to 190. [2023-03-31 01:26:17,402 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 190 states, 134 states have (on average 1.4402985074626866) internal successors, (193), 140 states have internal predecessors, (193), 34 states have call successors, (34), 24 states have call predecessors, (34), 21 states have return successors, (31), 31 states have call predecessors, (31), 31 states have call successors, (31) [2023-03-31 01:26:17,404 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 190 states to 190 states and 258 transitions. [2023-03-31 01:26:17,405 INFO L78 Accepts]: Start accepts. Automaton has 190 states and 258 transitions. Word has length 105 [2023-03-31 01:26:17,405 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-03-31 01:26:17,405 INFO L495 AbstractCegarLoop]: Abstraction has 190 states and 258 transitions. [2023-03-31 01:26:17,406 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 9.5) internal successors, (76), 4 states have internal predecessors, (76), 3 states have call successors, (17), 7 states have call predecessors, (17), 3 states have return successors, (12), 3 states have call predecessors, (12), 3 states have call successors, (12) [2023-03-31 01:26:17,406 INFO L276 IsEmpty]: Start isEmpty. Operand 190 states and 258 transitions. [2023-03-31 01:26:17,409 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2023-03-31 01:26:17,409 INFO L187 NwaCegarLoop]: Found error trace [2023-03-31 01:26:17,410 INFO L195 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] [2023-03-31 01:26:17,410 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-03-31 01:26:17,410 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-03-31 01:26:17,410 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-03-31 01:26:17,411 INFO L85 PathProgramCache]: Analyzing trace with hash 1345581250, now seen corresponding path program 1 times [2023-03-31 01:26:17,411 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-03-31 01:26:17,411 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1720702365] [2023-03-31 01:26:17,411 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-03-31 01:26:17,411 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-03-31 01:26:17,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-03-31 01:26:17,624 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2023-03-31 01:26:17,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-03-31 01:26:17,650 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2023-03-31 01:26:17,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-03-31 01:26:17,659 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2023-03-31 01:26:17,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-03-31 01:26:17,676 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2023-03-31 01:26:17,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-03-31 01:26:17,697 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2023-03-31 01:26:17,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-03-31 01:26:17,722 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-03-31 01:26:17,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-03-31 01:26:17,740 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-03-31 01:26:17,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-03-31 01:26:17,743 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-03-31 01:26:17,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-03-31 01:26:17,747 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2023-03-31 01:26:17,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-03-31 01:26:17,753 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2023-03-31 01:26:17,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-03-31 01:26:17,760 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2023-03-31 01:26:17,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-03-31 01:26:17,764 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2023-03-31 01:26:17,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-03-31 01:26:17,768 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-03-31 01:26:17,769 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-03-31 01:26:17,769 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1720702365] [2023-03-31 01:26:17,769 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1720702365] provided 1 perfect and 0 imperfect interpolant sequences [2023-03-31 01:26:17,770 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-03-31 01:26:17,770 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2023-03-31 01:26:17,770 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [234801849] [2023-03-31 01:26:17,770 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-03-31 01:26:17,772 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-03-31 01:26:17,772 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-03-31 01:26:17,773 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-03-31 01:26:17,773 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2023-03-31 01:26:17,774 INFO L87 Difference]: Start difference. First operand 190 states and 258 transitions. Second operand has 8 states, 8 states have (on average 9.5) internal successors, (76), 4 states have internal predecessors, (76), 3 states have call successors, (17), 7 states have call predecessors, (17), 3 states have return successors, (12), 3 states have call predecessors, (12), 3 states have call successors, (12) [2023-03-31 01:26:19,505 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-03-31 01:26:19,505 INFO L93 Difference]: Finished difference Result 715 states and 1057 transitions. [2023-03-31 01:26:19,505 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2023-03-31 01:26:19,506 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 9.5) internal successors, (76), 4 states have internal predecessors, (76), 3 states have call successors, (17), 7 states have call predecessors, (17), 3 states have return successors, (12), 3 states have call predecessors, (12), 3 states have call successors, (12) Word has length 105 [2023-03-31 01:26:19,506 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-03-31 01:26:19,513 INFO L225 Difference]: With dead ends: 715 [2023-03-31 01:26:19,513 INFO L226 Difference]: Without dead ends: 546 [2023-03-31 01:26:19,519 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=68, Invalid=172, Unknown=0, NotChecked=0, Total=240 [2023-03-31 01:26:19,522 INFO L413 NwaCegarLoop]: 6 mSDtfsCounter, 989 mSDsluCounter, 10 mSDsCounter, 0 mSdLazyCounter, 1512 mSolverCounterSat, 249 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1018 SdHoareTripleChecker+Valid, 16 SdHoareTripleChecker+Invalid, 1761 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 249 IncrementalHoareTripleChecker+Valid, 1512 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2023-03-31 01:26:19,523 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1018 Valid, 16 Invalid, 1761 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [249 Valid, 1512 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2023-03-31 01:26:19,526 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 546 states. [2023-03-31 01:26:19,626 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 546 to 355. [2023-03-31 01:26:19,627 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 355 states, 260 states have (on average 1.45) internal successors, (377), 272 states have internal predecessors, (377), 55 states have call successors, (55), 40 states have call predecessors, (55), 39 states have return successors, (56), 53 states have call predecessors, (56), 52 states have call successors, (56) [2023-03-31 01:26:19,629 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 355 states to 355 states and 488 transitions. [2023-03-31 01:26:19,629 INFO L78 Accepts]: Start accepts. Automaton has 355 states and 488 transitions. Word has length 105 [2023-03-31 01:26:19,629 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-03-31 01:26:19,629 INFO L495 AbstractCegarLoop]: Abstraction has 355 states and 488 transitions. [2023-03-31 01:26:19,629 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 9.5) internal successors, (76), 4 states have internal predecessors, (76), 3 states have call successors, (17), 7 states have call predecessors, (17), 3 states have return successors, (12), 3 states have call predecessors, (12), 3 states have call successors, (12) [2023-03-31 01:26:19,630 INFO L276 IsEmpty]: Start isEmpty. Operand 355 states and 488 transitions. [2023-03-31 01:26:19,631 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2023-03-31 01:26:19,632 INFO L187 NwaCegarLoop]: Found error trace [2023-03-31 01:26:19,632 INFO L195 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] [2023-03-31 01:26:19,632 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-03-31 01:26:19,632 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-03-31 01:26:19,632 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-03-31 01:26:19,633 INFO L85 PathProgramCache]: Analyzing trace with hash -244999231, now seen corresponding path program 1 times [2023-03-31 01:26:19,633 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-03-31 01:26:19,633 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [113730688] [2023-03-31 01:26:19,633 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-03-31 01:26:19,633 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-03-31 01:26:19,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-03-31 01:26:19,786 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2023-03-31 01:26:19,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-03-31 01:26:19,813 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2023-03-31 01:26:19,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-03-31 01:26:19,816 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2023-03-31 01:26:19,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-03-31 01:26:19,827 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2023-03-31 01:26:19,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-03-31 01:26:19,850 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2023-03-31 01:26:19,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-03-31 01:26:19,875 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-03-31 01:26:19,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-03-31 01:26:19,883 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-03-31 01:26:19,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-03-31 01:26:19,885 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-03-31 01:26:19,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-03-31 01:26:19,887 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2023-03-31 01:26:19,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-03-31 01:26:19,889 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2023-03-31 01:26:19,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-03-31 01:26:19,890 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2023-03-31 01:26:19,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-03-31 01:26:19,894 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2023-03-31 01:26:19,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-03-31 01:26:19,896 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-03-31 01:26:19,896 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-03-31 01:26:19,896 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [113730688] [2023-03-31 01:26:19,896 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [113730688] provided 1 perfect and 0 imperfect interpolant sequences [2023-03-31 01:26:19,896 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-03-31 01:26:19,897 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2023-03-31 01:26:19,897 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [283028013] [2023-03-31 01:26:19,897 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-03-31 01:26:19,897 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2023-03-31 01:26:19,897 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-03-31 01:26:19,898 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2023-03-31 01:26:19,898 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2023-03-31 01:26:19,898 INFO L87 Difference]: Start difference. First operand 355 states and 488 transitions. Second operand has 10 states, 10 states have (on average 7.6) internal successors, (76), 6 states have internal predecessors, (76), 3 states have call successors, (17), 7 states have call predecessors, (17), 3 states have return successors, (12), 3 states have call predecessors, (12), 3 states have call successors, (12) [2023-03-31 01:26:21,061 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-03-31 01:26:21,062 INFO L93 Difference]: Finished difference Result 865 states and 1249 transitions. [2023-03-31 01:26:21,062 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-03-31 01:26:21,062 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 7.6) internal successors, (76), 6 states have internal predecessors, (76), 3 states have call successors, (17), 7 states have call predecessors, (17), 3 states have return successors, (12), 3 states have call predecessors, (12), 3 states have call successors, (12) Word has length 105 [2023-03-31 01:26:21,064 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-03-31 01:26:21,068 INFO L225 Difference]: With dead ends: 865 [2023-03-31 01:26:21,068 INFO L226 Difference]: Without dead ends: 531 [2023-03-31 01:26:21,071 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 25 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=65, Invalid=145, Unknown=0, NotChecked=0, Total=210 [2023-03-31 01:26:21,075 INFO L413 NwaCegarLoop]: 6 mSDtfsCounter, 970 mSDsluCounter, 11 mSDsCounter, 0 mSdLazyCounter, 922 mSolverCounterSat, 350 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 970 SdHoareTripleChecker+Valid, 17 SdHoareTripleChecker+Invalid, 1272 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 350 IncrementalHoareTripleChecker+Valid, 922 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2023-03-31 01:26:21,076 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [970 Valid, 17 Invalid, 1272 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [350 Valid, 922 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2023-03-31 01:26:21,078 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 531 states. [2023-03-31 01:26:21,143 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 531 to 355. [2023-03-31 01:26:21,144 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 355 states, 260 states have (on average 1.4230769230769231) internal successors, (370), 272 states have internal predecessors, (370), 55 states have call successors, (55), 40 states have call predecessors, (55), 39 states have return successors, (56), 53 states have call predecessors, (56), 52 states have call successors, (56) [2023-03-31 01:26:21,147 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 355 states to 355 states and 481 transitions. [2023-03-31 01:26:21,148 INFO L78 Accepts]: Start accepts. Automaton has 355 states and 481 transitions. Word has length 105 [2023-03-31 01:26:21,148 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-03-31 01:26:21,148 INFO L495 AbstractCegarLoop]: Abstraction has 355 states and 481 transitions. [2023-03-31 01:26:21,148 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 7.6) internal successors, (76), 6 states have internal predecessors, (76), 3 states have call successors, (17), 7 states have call predecessors, (17), 3 states have return successors, (12), 3 states have call predecessors, (12), 3 states have call successors, (12) [2023-03-31 01:26:21,148 INFO L276 IsEmpty]: Start isEmpty. Operand 355 states and 481 transitions. [2023-03-31 01:26:21,155 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2023-03-31 01:26:21,156 INFO L187 NwaCegarLoop]: Found error trace [2023-03-31 01:26:21,156 INFO L195 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] [2023-03-31 01:26:21,156 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-03-31 01:26:21,157 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-03-31 01:26:21,157 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-03-31 01:26:21,157 INFO L85 PathProgramCache]: Analyzing trace with hash -601237435, now seen corresponding path program 1 times [2023-03-31 01:26:21,157 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-03-31 01:26:21,157 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [191264497] [2023-03-31 01:26:21,157 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-03-31 01:26:21,158 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-03-31 01:26:21,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-03-31 01:26:21,298 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2023-03-31 01:26:21,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-03-31 01:26:21,342 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2023-03-31 01:26:21,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-03-31 01:26:21,347 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2023-03-31 01:26:21,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-03-31 01:26:21,360 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2023-03-31 01:26:21,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-03-31 01:26:21,384 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2023-03-31 01:26:21,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-03-31 01:26:21,410 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-03-31 01:26:21,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-03-31 01:26:21,424 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-03-31 01:26:21,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-03-31 01:26:21,430 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-03-31 01:26:21,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-03-31 01:26:21,434 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2023-03-31 01:26:21,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-03-31 01:26:21,438 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2023-03-31 01:26:21,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-03-31 01:26:21,441 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2023-03-31 01:26:21,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-03-31 01:26:21,445 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2023-03-31 01:26:21,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-03-31 01:26:21,461 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-03-31 01:26:21,461 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-03-31 01:26:21,461 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [191264497] [2023-03-31 01:26:21,462 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [191264497] provided 1 perfect and 0 imperfect interpolant sequences [2023-03-31 01:26:21,462 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-03-31 01:26:21,462 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2023-03-31 01:26:21,462 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1643014809] [2023-03-31 01:26:21,462 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-03-31 01:26:21,464 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2023-03-31 01:26:21,464 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-03-31 01:26:21,464 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2023-03-31 01:26:21,464 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2023-03-31 01:26:21,465 INFO L87 Difference]: Start difference. First operand 355 states and 481 transitions. Second operand has 10 states, 10 states have (on average 7.6) internal successors, (76), 6 states have internal predecessors, (76), 3 states have call successors, (17), 7 states have call predecessors, (17), 3 states have return successors, (12), 3 states have call predecessors, (12), 3 states have call successors, (12) [2023-03-31 01:26:22,690 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-03-31 01:26:22,691 INFO L93 Difference]: Finished difference Result 862 states and 1228 transitions. [2023-03-31 01:26:22,691 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-03-31 01:26:22,691 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 7.6) internal successors, (76), 6 states have internal predecessors, (76), 3 states have call successors, (17), 7 states have call predecessors, (17), 3 states have return successors, (12), 3 states have call predecessors, (12), 3 states have call successors, (12) Word has length 105 [2023-03-31 01:26:22,691 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-03-31 01:26:22,694 INFO L225 Difference]: With dead ends: 862 [2023-03-31 01:26:22,694 INFO L226 Difference]: Without dead ends: 528 [2023-03-31 01:26:22,695 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 25 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=65, Invalid=145, Unknown=0, NotChecked=0, Total=210 [2023-03-31 01:26:22,701 INFO L413 NwaCegarLoop]: 6 mSDtfsCounter, 896 mSDsluCounter, 10 mSDsCounter, 0 mSdLazyCounter, 1052 mSolverCounterSat, 325 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 896 SdHoareTripleChecker+Valid, 16 SdHoareTripleChecker+Invalid, 1377 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 325 IncrementalHoareTripleChecker+Valid, 1052 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2023-03-31 01:26:22,702 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [896 Valid, 16 Invalid, 1377 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [325 Valid, 1052 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2023-03-31 01:26:22,704 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 528 states. [2023-03-31 01:26:22,771 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 528 to 355. [2023-03-31 01:26:22,772 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 355 states, 260 states have (on average 1.396153846153846) internal successors, (363), 272 states have internal predecessors, (363), 55 states have call successors, (55), 40 states have call predecessors, (55), 39 states have return successors, (56), 53 states have call predecessors, (56), 52 states have call successors, (56) [2023-03-31 01:26:22,773 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 355 states to 355 states and 474 transitions. [2023-03-31 01:26:22,773 INFO L78 Accepts]: Start accepts. Automaton has 355 states and 474 transitions. Word has length 105 [2023-03-31 01:26:22,773 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-03-31 01:26:22,774 INFO L495 AbstractCegarLoop]: Abstraction has 355 states and 474 transitions. [2023-03-31 01:26:22,774 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 7.6) internal successors, (76), 6 states have internal predecessors, (76), 3 states have call successors, (17), 7 states have call predecessors, (17), 3 states have return successors, (12), 3 states have call predecessors, (12), 3 states have call successors, (12) [2023-03-31 01:26:22,774 INFO L276 IsEmpty]: Start isEmpty. Operand 355 states and 474 transitions. [2023-03-31 01:26:22,775 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2023-03-31 01:26:22,775 INFO L187 NwaCegarLoop]: Found error trace [2023-03-31 01:26:22,775 INFO L195 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] [2023-03-31 01:26:22,775 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-03-31 01:26:22,775 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-03-31 01:26:22,776 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-03-31 01:26:22,776 INFO L85 PathProgramCache]: Analyzing trace with hash -1721107647, now seen corresponding path program 1 times [2023-03-31 01:26:22,776 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-03-31 01:26:22,776 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1088862158] [2023-03-31 01:26:22,776 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-03-31 01:26:22,776 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-03-31 01:26:22,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-03-31 01:26:22,883 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2023-03-31 01:26:22,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-03-31 01:26:22,903 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2023-03-31 01:26:22,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-03-31 01:26:22,906 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2023-03-31 01:26:22,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-03-31 01:26:22,915 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2023-03-31 01:26:22,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-03-31 01:26:22,930 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2023-03-31 01:26:22,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-03-31 01:26:22,952 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-03-31 01:26:22,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-03-31 01:26:22,958 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-03-31 01:26:22,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-03-31 01:26:22,959 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-03-31 01:26:22,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-03-31 01:26:22,960 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2023-03-31 01:26:22,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-03-31 01:26:22,962 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2023-03-31 01:26:22,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-03-31 01:26:22,964 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2023-03-31 01:26:22,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-03-31 01:26:22,966 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2023-03-31 01:26:22,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-03-31 01:26:22,968 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-03-31 01:26:22,968 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-03-31 01:26:22,968 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1088862158] [2023-03-31 01:26:22,968 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1088862158] provided 1 perfect and 0 imperfect interpolant sequences [2023-03-31 01:26:22,968 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-03-31 01:26:22,968 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2023-03-31 01:26:22,969 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [793761440] [2023-03-31 01:26:22,969 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-03-31 01:26:22,969 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2023-03-31 01:26:22,969 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-03-31 01:26:22,970 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2023-03-31 01:26:22,970 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2023-03-31 01:26:22,970 INFO L87 Difference]: Start difference. First operand 355 states and 474 transitions. Second operand has 10 states, 10 states have (on average 7.6) internal successors, (76), 6 states have internal predecessors, (76), 3 states have call successors, (17), 7 states have call predecessors, (17), 3 states have return successors, (12), 3 states have call predecessors, (12), 3 states have call successors, (12) [2023-03-31 01:26:24,531 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-03-31 01:26:24,532 INFO L93 Difference]: Finished difference Result 1049 states and 1544 transitions. [2023-03-31 01:26:24,532 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2023-03-31 01:26:24,532 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 7.6) internal successors, (76), 6 states have internal predecessors, (76), 3 states have call successors, (17), 7 states have call predecessors, (17), 3 states have return successors, (12), 3 states have call predecessors, (12), 3 states have call successors, (12) Word has length 105 [2023-03-31 01:26:24,532 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-03-31 01:26:24,536 INFO L225 Difference]: With dead ends: 1049 [2023-03-31 01:26:24,536 INFO L226 Difference]: Without dead ends: 715 [2023-03-31 01:26:24,538 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 62 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=123, Invalid=297, Unknown=0, NotChecked=0, Total=420 [2023-03-31 01:26:24,538 INFO L413 NwaCegarLoop]: 6 mSDtfsCounter, 847 mSDsluCounter, 12 mSDsCounter, 0 mSdLazyCounter, 1201 mSolverCounterSat, 322 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 847 SdHoareTripleChecker+Valid, 18 SdHoareTripleChecker+Invalid, 1523 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 322 IncrementalHoareTripleChecker+Valid, 1201 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2023-03-31 01:26:24,539 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [847 Valid, 18 Invalid, 1523 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [322 Valid, 1201 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2023-03-31 01:26:24,540 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 715 states. [2023-03-31 01:26:24,607 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 715 to 447. [2023-03-31 01:26:24,608 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 447 states, 330 states have (on average 1.3545454545454545) internal successors, (447), 342 states have internal predecessors, (447), 65 states have call successors, (65), 52 states have call predecessors, (65), 51 states have return successors, (66), 63 states have call predecessors, (66), 62 states have call successors, (66) [2023-03-31 01:26:24,610 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 447 states to 447 states and 578 transitions. [2023-03-31 01:26:24,610 INFO L78 Accepts]: Start accepts. Automaton has 447 states and 578 transitions. Word has length 105 [2023-03-31 01:26:24,610 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-03-31 01:26:24,611 INFO L495 AbstractCegarLoop]: Abstraction has 447 states and 578 transitions. [2023-03-31 01:26:24,611 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 7.6) internal successors, (76), 6 states have internal predecessors, (76), 3 states have call successors, (17), 7 states have call predecessors, (17), 3 states have return successors, (12), 3 states have call predecessors, (12), 3 states have call successors, (12) [2023-03-31 01:26:24,611 INFO L276 IsEmpty]: Start isEmpty. Operand 447 states and 578 transitions. [2023-03-31 01:26:24,612 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2023-03-31 01:26:24,612 INFO L187 NwaCegarLoop]: Found error trace [2023-03-31 01:26:24,612 INFO L195 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] [2023-03-31 01:26:24,612 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-03-31 01:26:24,612 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-03-31 01:26:24,613 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-03-31 01:26:24,613 INFO L85 PathProgramCache]: Analyzing trace with hash -1391547075, now seen corresponding path program 1 times [2023-03-31 01:26:24,613 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-03-31 01:26:24,613 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1851459847] [2023-03-31 01:26:24,613 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-03-31 01:26:24,613 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-03-31 01:26:24,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-03-31 01:26:24,750 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2023-03-31 01:26:24,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-03-31 01:26:24,772 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2023-03-31 01:26:24,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-03-31 01:26:24,774 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2023-03-31 01:26:24,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-03-31 01:26:24,784 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2023-03-31 01:26:24,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-03-31 01:26:24,802 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2023-03-31 01:26:24,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-03-31 01:26:24,826 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-03-31 01:26:24,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-03-31 01:26:24,831 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-03-31 01:26:24,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-03-31 01:26:24,833 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-03-31 01:26:24,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-03-31 01:26:24,834 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2023-03-31 01:26:24,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-03-31 01:26:24,835 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2023-03-31 01:26:24,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-03-31 01:26:24,837 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2023-03-31 01:26:24,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-03-31 01:26:24,839 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2023-03-31 01:26:24,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-03-31 01:26:24,841 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-03-31 01:26:24,841 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-03-31 01:26:24,841 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1851459847] [2023-03-31 01:26:24,841 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1851459847] provided 1 perfect and 0 imperfect interpolant sequences [2023-03-31 01:26:24,841 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-03-31 01:26:24,842 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2023-03-31 01:26:24,842 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [48554899] [2023-03-31 01:26:24,842 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-03-31 01:26:24,842 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2023-03-31 01:26:24,842 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-03-31 01:26:24,843 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-03-31 01:26:24,843 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2023-03-31 01:26:24,843 INFO L87 Difference]: Start difference. First operand 447 states and 578 transitions. Second operand has 9 states, 9 states have (on average 8.444444444444445) internal successors, (76), 5 states have internal predecessors, (76), 3 states have call successors, (17), 7 states have call predecessors, (17), 3 states have return successors, (12), 3 states have call predecessors, (12), 3 states have call successors, (12) [2023-03-31 01:26:27,695 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-03-31 01:26:27,696 INFO L93 Difference]: Finished difference Result 1866 states and 2593 transitions. [2023-03-31 01:26:27,696 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2023-03-31 01:26:27,696 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 8.444444444444445) internal successors, (76), 5 states have internal predecessors, (76), 3 states have call successors, (17), 7 states have call predecessors, (17), 3 states have return successors, (12), 3 states have call predecessors, (12), 3 states have call successors, (12) Word has length 105 [2023-03-31 01:26:27,696 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-03-31 01:26:27,703 INFO L225 Difference]: With dead ends: 1866 [2023-03-31 01:26:27,703 INFO L226 Difference]: Without dead ends: 1440 [2023-03-31 01:26:27,705 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 128 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=153, Invalid=447, Unknown=0, NotChecked=0, Total=600 [2023-03-31 01:26:27,706 INFO L413 NwaCegarLoop]: 6 mSDtfsCounter, 1440 mSDsluCounter, 10 mSDsCounter, 0 mSdLazyCounter, 2860 mSolverCounterSat, 420 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1471 SdHoareTripleChecker+Valid, 16 SdHoareTripleChecker+Invalid, 3280 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 420 IncrementalHoareTripleChecker+Valid, 2860 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.2s IncrementalHoareTripleChecker+Time [2023-03-31 01:26:27,706 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1471 Valid, 16 Invalid, 3280 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [420 Valid, 2860 Invalid, 0 Unknown, 0 Unchecked, 2.2s Time] [2023-03-31 01:26:27,707 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1440 states. [2023-03-31 01:26:27,889 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1440 to 1102. [2023-03-31 01:26:27,891 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1102 states, 819 states have (on average 1.3650793650793651) internal successors, (1118), 876 states have internal predecessors, (1118), 154 states have call successors, (154), 112 states have call predecessors, (154), 128 states have return successors, (221), 154 states have call predecessors, (221), 151 states have call successors, (221) [2023-03-31 01:26:27,897 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1102 states to 1102 states and 1493 transitions. [2023-03-31 01:26:27,898 INFO L78 Accepts]: Start accepts. Automaton has 1102 states and 1493 transitions. Word has length 105 [2023-03-31 01:26:27,898 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-03-31 01:26:27,898 INFO L495 AbstractCegarLoop]: Abstraction has 1102 states and 1493 transitions. [2023-03-31 01:26:27,898 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 8.444444444444445) internal successors, (76), 5 states have internal predecessors, (76), 3 states have call successors, (17), 7 states have call predecessors, (17), 3 states have return successors, (12), 3 states have call predecessors, (12), 3 states have call successors, (12) [2023-03-31 01:26:27,899 INFO L276 IsEmpty]: Start isEmpty. Operand 1102 states and 1493 transitions. [2023-03-31 01:26:27,901 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2023-03-31 01:26:27,901 INFO L187 NwaCegarLoop]: Found error trace [2023-03-31 01:26:27,901 INFO L195 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] [2023-03-31 01:26:27,901 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-03-31 01:26:27,901 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-03-31 01:26:27,902 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-03-31 01:26:27,902 INFO L85 PathProgramCache]: Analyzing trace with hash -1364481473, now seen corresponding path program 1 times [2023-03-31 01:26:27,902 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-03-31 01:26:27,902 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1758287023] [2023-03-31 01:26:27,902 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-03-31 01:26:27,902 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-03-31 01:26:27,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-03-31 01:26:28,008 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2023-03-31 01:26:28,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-03-31 01:26:28,031 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2023-03-31 01:26:28,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-03-31 01:26:28,034 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2023-03-31 01:26:28,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-03-31 01:26:28,043 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2023-03-31 01:26:28,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-03-31 01:26:28,058 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2023-03-31 01:26:28,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-03-31 01:26:28,080 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-03-31 01:26:28,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-03-31 01:26:28,087 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-03-31 01:26:28,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-03-31 01:26:28,093 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-03-31 01:26:28,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-03-31 01:26:28,097 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2023-03-31 01:26:28,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-03-31 01:26:28,099 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2023-03-31 01:26:28,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-03-31 01:26:28,100 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2023-03-31 01:26:28,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-03-31 01:26:28,103 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2023-03-31 01:26:28,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-03-31 01:26:28,105 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-03-31 01:26:28,105 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-03-31 01:26:28,105 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1758287023] [2023-03-31 01:26:28,105 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1758287023] provided 1 perfect and 0 imperfect interpolant sequences [2023-03-31 01:26:28,105 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-03-31 01:26:28,105 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2023-03-31 01:26:28,105 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2011847206] [2023-03-31 01:26:28,105 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-03-31 01:26:28,106 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2023-03-31 01:26:28,106 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-03-31 01:26:28,106 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2023-03-31 01:26:28,106 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2023-03-31 01:26:28,106 INFO L87 Difference]: Start difference. First operand 1102 states and 1493 transitions. Second operand has 10 states, 10 states have (on average 7.6) internal successors, (76), 6 states have internal predecessors, (76), 3 states have call successors, (17), 7 states have call predecessors, (17), 3 states have return successors, (12), 3 states have call predecessors, (12), 3 states have call successors, (12) [2023-03-31 01:26:29,713 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-03-31 01:26:29,714 INFO L93 Difference]: Finished difference Result 2851 states and 4122 transitions. [2023-03-31 01:26:29,714 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2023-03-31 01:26:29,714 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 7.6) internal successors, (76), 6 states have internal predecessors, (76), 3 states have call successors, (17), 7 states have call predecessors, (17), 3 states have return successors, (12), 3 states have call predecessors, (12), 3 states have call successors, (12) Word has length 105 [2023-03-31 01:26:29,714 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-03-31 01:26:29,723 INFO L225 Difference]: With dead ends: 2851 [2023-03-31 01:26:29,724 INFO L226 Difference]: Without dead ends: 1771 [2023-03-31 01:26:29,727 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 62 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=123, Invalid=297, Unknown=0, NotChecked=0, Total=420 [2023-03-31 01:26:29,727 INFO L413 NwaCegarLoop]: 6 mSDtfsCounter, 1617 mSDsluCounter, 10 mSDsCounter, 0 mSdLazyCounter, 973 mSolverCounterSat, 687 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1617 SdHoareTripleChecker+Valid, 16 SdHoareTripleChecker+Invalid, 1660 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 687 IncrementalHoareTripleChecker+Valid, 973 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2023-03-31 01:26:29,728 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1617 Valid, 16 Invalid, 1660 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [687 Valid, 973 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2023-03-31 01:26:29,730 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1771 states. [2023-03-31 01:26:29,949 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1771 to 1280. [2023-03-31 01:26:29,951 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1280 states, 957 states have (on average 1.3322884012539185) internal successors, (1275), 1014 states have internal predecessors, (1275), 172 states have call successors, (172), 134 states have call predecessors, (172), 150 states have return successors, (237), 172 states have call predecessors, (237), 169 states have call successors, (237) [2023-03-31 01:26:29,957 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1280 states to 1280 states and 1684 transitions. [2023-03-31 01:26:29,957 INFO L78 Accepts]: Start accepts. Automaton has 1280 states and 1684 transitions. Word has length 105 [2023-03-31 01:26:29,958 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-03-31 01:26:29,958 INFO L495 AbstractCegarLoop]: Abstraction has 1280 states and 1684 transitions. [2023-03-31 01:26:29,958 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 7.6) internal successors, (76), 6 states have internal predecessors, (76), 3 states have call successors, (17), 7 states have call predecessors, (17), 3 states have return successors, (12), 3 states have call predecessors, (12), 3 states have call successors, (12) [2023-03-31 01:26:29,958 INFO L276 IsEmpty]: Start isEmpty. Operand 1280 states and 1684 transitions. [2023-03-31 01:26:29,960 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2023-03-31 01:26:29,960 INFO L187 NwaCegarLoop]: Found error trace [2023-03-31 01:26:29,960 INFO L195 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] [2023-03-31 01:26:29,960 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-03-31 01:26:29,960 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-03-31 01:26:29,960 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-03-31 01:26:29,961 INFO L85 PathProgramCache]: Analyzing trace with hash 620275607, now seen corresponding path program 1 times [2023-03-31 01:26:29,961 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-03-31 01:26:29,961 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1058419622] [2023-03-31 01:26:29,961 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-03-31 01:26:29,961 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-03-31 01:26:29,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-03-31 01:26:30,085 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2023-03-31 01:26:30,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-03-31 01:26:30,103 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2023-03-31 01:26:30,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-03-31 01:26:30,106 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2023-03-31 01:26:30,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-03-31 01:26:30,116 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2023-03-31 01:26:30,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-03-31 01:26:30,134 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2023-03-31 01:26:30,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-03-31 01:26:30,163 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-03-31 01:26:30,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-03-31 01:26:30,170 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-03-31 01:26:30,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-03-31 01:26:30,172 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-03-31 01:26:30,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-03-31 01:26:30,173 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2023-03-31 01:26:30,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-03-31 01:26:30,175 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2023-03-31 01:26:30,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-03-31 01:26:30,177 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2023-03-31 01:26:30,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-03-31 01:26:30,179 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2023-03-31 01:26:30,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-03-31 01:26:30,180 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-03-31 01:26:30,181 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-03-31 01:26:30,181 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1058419622] [2023-03-31 01:26:30,181 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1058419622] provided 1 perfect and 0 imperfect interpolant sequences [2023-03-31 01:26:30,181 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-03-31 01:26:30,181 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2023-03-31 01:26:30,181 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [835458742] [2023-03-31 01:26:30,181 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-03-31 01:26:30,182 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2023-03-31 01:26:30,182 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-03-31 01:26:30,182 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-03-31 01:26:30,182 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2023-03-31 01:26:30,182 INFO L87 Difference]: Start difference. First operand 1280 states and 1684 transitions. Second operand has 9 states, 9 states have (on average 8.444444444444445) internal successors, (76), 5 states have internal predecessors, (76), 3 states have call successors, (17), 7 states have call predecessors, (17), 3 states have return successors, (12), 3 states have call predecessors, (12), 3 states have call successors, (12) [2023-03-31 01:26:33,315 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-03-31 01:26:33,315 INFO L93 Difference]: Finished difference Result 4445 states and 5920 transitions. [2023-03-31 01:26:33,316 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2023-03-31 01:26:33,317 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 8.444444444444445) internal successors, (76), 5 states have internal predecessors, (76), 3 states have call successors, (17), 7 states have call predecessors, (17), 3 states have return successors, (12), 3 states have call predecessors, (12), 3 states have call successors, (12) Word has length 105 [2023-03-31 01:26:33,317 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-03-31 01:26:33,332 INFO L225 Difference]: With dead ends: 4445 [2023-03-31 01:26:33,332 INFO L226 Difference]: Without dead ends: 3271 [2023-03-31 01:26:33,336 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 125 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=153, Invalid=447, Unknown=0, NotChecked=0, Total=600 [2023-03-31 01:26:33,337 INFO L413 NwaCegarLoop]: 6 mSDtfsCounter, 1469 mSDsluCounter, 10 mSDsCounter, 0 mSdLazyCounter, 2788 mSolverCounterSat, 433 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1499 SdHoareTripleChecker+Valid, 16 SdHoareTripleChecker+Invalid, 3221 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 433 IncrementalHoareTripleChecker+Valid, 2788 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.2s IncrementalHoareTripleChecker+Time [2023-03-31 01:26:33,337 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1499 Valid, 16 Invalid, 3221 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [433 Valid, 2788 Invalid, 0 Unknown, 0 Unchecked, 2.2s Time] [2023-03-31 01:26:33,340 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3271 states. [2023-03-31 01:26:33,699 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3271 to 2530. [2023-03-31 01:26:33,703 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2530 states, 1909 states have (on average 1.3310633839706654) internal successors, (2541), 2013 states have internal predecessors, (2541), 320 states have call successors, (320), 269 states have call predecessors, (320), 300 states have return successors, (432), 321 states have call predecessors, (432), 317 states have call successors, (432) [2023-03-31 01:26:33,710 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2530 states to 2530 states and 3293 transitions. [2023-03-31 01:26:33,711 INFO L78 Accepts]: Start accepts. Automaton has 2530 states and 3293 transitions. Word has length 105 [2023-03-31 01:26:33,711 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-03-31 01:26:33,711 INFO L495 AbstractCegarLoop]: Abstraction has 2530 states and 3293 transitions. [2023-03-31 01:26:33,712 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 8.444444444444445) internal successors, (76), 5 states have internal predecessors, (76), 3 states have call successors, (17), 7 states have call predecessors, (17), 3 states have return successors, (12), 3 states have call predecessors, (12), 3 states have call successors, (12) [2023-03-31 01:26:33,712 INFO L276 IsEmpty]: Start isEmpty. Operand 2530 states and 3293 transitions. [2023-03-31 01:26:33,713 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2023-03-31 01:26:33,713 INFO L187 NwaCegarLoop]: Found error trace [2023-03-31 01:26:33,713 INFO L195 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] [2023-03-31 01:26:33,713 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2023-03-31 01:26:33,714 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-03-31 01:26:33,714 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-03-31 01:26:33,714 INFO L85 PathProgramCache]: Analyzing trace with hash -1240325862, now seen corresponding path program 1 times [2023-03-31 01:26:33,714 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-03-31 01:26:33,714 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1210092283] [2023-03-31 01:26:33,714 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-03-31 01:26:33,715 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-03-31 01:26:33,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-03-31 01:26:33,789 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2023-03-31 01:26:33,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-03-31 01:26:33,803 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2023-03-31 01:26:33,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-03-31 01:26:33,805 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2023-03-31 01:26:33,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-03-31 01:26:33,813 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2023-03-31 01:26:33,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-03-31 01:26:33,826 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2023-03-31 01:26:33,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-03-31 01:26:33,828 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-03-31 01:26:33,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-03-31 01:26:33,886 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-03-31 01:26:33,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-03-31 01:26:33,918 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-03-31 01:26:33,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-03-31 01:26:33,920 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2023-03-31 01:26:33,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-03-31 01:26:33,922 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2023-03-31 01:26:33,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-03-31 01:26:33,924 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2023-03-31 01:26:33,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-03-31 01:26:33,927 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2023-03-31 01:26:33,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-03-31 01:26:33,930 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-03-31 01:26:33,930 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-03-31 01:26:33,931 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1210092283] [2023-03-31 01:26:33,931 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1210092283] provided 1 perfect and 0 imperfect interpolant sequences [2023-03-31 01:26:33,931 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-03-31 01:26:33,931 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2023-03-31 01:26:33,931 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [209597998] [2023-03-31 01:26:33,931 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-03-31 01:26:33,932 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2023-03-31 01:26:33,932 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-03-31 01:26:33,932 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2023-03-31 01:26:33,932 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2023-03-31 01:26:33,933 INFO L87 Difference]: Start difference. First operand 2530 states and 3293 transitions. Second operand has 10 states, 10 states have (on average 7.6) internal successors, (76), 5 states have internal predecessors, (76), 2 states have call successors, (17), 6 states have call predecessors, (17), 3 states have return successors, (12), 3 states have call predecessors, (12), 2 states have call successors, (12) [2023-03-31 01:26:35,949 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-03-31 01:26:35,950 INFO L93 Difference]: Finished difference Result 5597 states and 7498 transitions. [2023-03-31 01:26:35,950 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2023-03-31 01:26:35,950 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 7.6) internal successors, (76), 5 states have internal predecessors, (76), 2 states have call successors, (17), 6 states have call predecessors, (17), 3 states have return successors, (12), 3 states have call predecessors, (12), 2 states have call successors, (12) Word has length 105 [2023-03-31 01:26:35,951 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-03-31 01:26:35,963 INFO L225 Difference]: With dead ends: 5597 [2023-03-31 01:26:35,963 INFO L226 Difference]: Without dead ends: 3089 [2023-03-31 01:26:35,968 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 25 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 34 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=84, Invalid=222, Unknown=0, NotChecked=0, Total=306 [2023-03-31 01:26:35,969 INFO L413 NwaCegarLoop]: 6 mSDtfsCounter, 538 mSDsluCounter, 30 mSDsCounter, 0 mSdLazyCounter, 1874 mSolverCounterSat, 139 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 566 SdHoareTripleChecker+Valid, 36 SdHoareTripleChecker+Invalid, 2013 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 139 IncrementalHoareTripleChecker+Valid, 1874 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2023-03-31 01:26:35,969 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [566 Valid, 36 Invalid, 2013 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [139 Valid, 1874 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2023-03-31 01:26:35,972 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3089 states. [2023-03-31 01:26:36,403 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3089 to 2545. [2023-03-31 01:26:36,408 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2545 states, 1921 states have (on average 1.3149401353461738) internal successors, (2526), 2025 states have internal predecessors, (2526), 320 states have call successors, (320), 269 states have call predecessors, (320), 303 states have return successors, (435), 324 states have call predecessors, (435), 317 states have call successors, (435) [2023-03-31 01:26:36,413 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2545 states to 2545 states and 3281 transitions. [2023-03-31 01:26:36,414 INFO L78 Accepts]: Start accepts. Automaton has 2545 states and 3281 transitions. Word has length 105 [2023-03-31 01:26:36,415 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-03-31 01:26:36,415 INFO L495 AbstractCegarLoop]: Abstraction has 2545 states and 3281 transitions. [2023-03-31 01:26:36,415 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 7.6) internal successors, (76), 5 states have internal predecessors, (76), 2 states have call successors, (17), 6 states have call predecessors, (17), 3 states have return successors, (12), 3 states have call predecessors, (12), 2 states have call successors, (12) [2023-03-31 01:26:36,415 INFO L276 IsEmpty]: Start isEmpty. Operand 2545 states and 3281 transitions. [2023-03-31 01:26:36,417 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2023-03-31 01:26:36,417 INFO L187 NwaCegarLoop]: Found error trace [2023-03-31 01:26:36,417 INFO L195 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] [2023-03-31 01:26:36,417 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2023-03-31 01:26:36,417 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-03-31 01:26:36,417 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-03-31 01:26:36,418 INFO L85 PathProgramCache]: Analyzing trace with hash -1657722468, now seen corresponding path program 1 times [2023-03-31 01:26:36,418 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-03-31 01:26:36,418 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [8433290] [2023-03-31 01:26:36,418 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-03-31 01:26:36,418 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-03-31 01:26:36,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-03-31 01:26:36,490 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2023-03-31 01:26:36,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-03-31 01:26:36,501 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2023-03-31 01:26:36,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-03-31 01:26:36,503 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2023-03-31 01:26:36,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-03-31 01:26:36,511 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2023-03-31 01:26:36,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-03-31 01:26:36,524 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2023-03-31 01:26:36,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-03-31 01:26:36,527 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-03-31 01:26:36,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-03-31 01:26:36,558 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-03-31 01:26:36,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-03-31 01:26:36,560 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-03-31 01:26:36,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-03-31 01:26:36,561 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2023-03-31 01:26:36,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-03-31 01:26:36,584 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2023-03-31 01:26:36,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-03-31 01:26:36,586 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2023-03-31 01:26:36,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-03-31 01:26:36,588 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2023-03-31 01:26:36,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-03-31 01:26:36,590 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-03-31 01:26:36,590 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-03-31 01:26:36,590 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [8433290] [2023-03-31 01:26:36,590 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [8433290] provided 1 perfect and 0 imperfect interpolant sequences [2023-03-31 01:26:36,590 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-03-31 01:26:36,590 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2023-03-31 01:26:36,591 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [553286454] [2023-03-31 01:26:36,591 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-03-31 01:26:36,591 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2023-03-31 01:26:36,591 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-03-31 01:26:36,592 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2023-03-31 01:26:36,592 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2023-03-31 01:26:36,592 INFO L87 Difference]: Start difference. First operand 2545 states and 3281 transitions. Second operand has 10 states, 10 states have (on average 7.6) internal successors, (76), 5 states have internal predecessors, (76), 2 states have call successors, (17), 6 states have call predecessors, (17), 3 states have return successors, (12), 3 states have call predecessors, (12), 2 states have call successors, (12) [2023-03-31 01:26:38,345 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-03-31 01:26:38,345 INFO L93 Difference]: Finished difference Result 5900 states and 7875 transitions. [2023-03-31 01:26:38,345 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2023-03-31 01:26:38,345 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 7.6) internal successors, (76), 5 states have internal predecessors, (76), 2 states have call successors, (17), 6 states have call predecessors, (17), 3 states have return successors, (12), 3 states have call predecessors, (12), 2 states have call successors, (12) Word has length 105 [2023-03-31 01:26:38,346 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-03-31 01:26:38,364 INFO L225 Difference]: With dead ends: 5900 [2023-03-31 01:26:38,364 INFO L226 Difference]: Without dead ends: 3377 [2023-03-31 01:26:38,369 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 25 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 39 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=91, Invalid=251, Unknown=0, NotChecked=0, Total=342 [2023-03-31 01:26:38,370 INFO L413 NwaCegarLoop]: 6 mSDtfsCounter, 506 mSDsluCounter, 30 mSDsCounter, 0 mSdLazyCounter, 1877 mSolverCounterSat, 140 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 535 SdHoareTripleChecker+Valid, 36 SdHoareTripleChecker+Invalid, 2017 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 140 IncrementalHoareTripleChecker+Valid, 1877 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2023-03-31 01:26:38,371 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [535 Valid, 36 Invalid, 2017 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [140 Valid, 1877 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2023-03-31 01:26:38,374 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3377 states. [2023-03-31 01:26:38,852 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3377 to 2675. [2023-03-31 01:26:38,857 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2675 states, 2025 states have (on average 1.2967901234567902) internal successors, (2626), 2129 states have internal predecessors, (2626), 320 states have call successors, (320), 269 states have call predecessors, (320), 329 states have return successors, (461), 350 states have call predecessors, (461), 317 states have call successors, (461) [2023-03-31 01:26:38,863 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2675 states to 2675 states and 3407 transitions. [2023-03-31 01:26:38,864 INFO L78 Accepts]: Start accepts. Automaton has 2675 states and 3407 transitions. Word has length 105 [2023-03-31 01:26:38,865 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-03-31 01:26:38,865 INFO L495 AbstractCegarLoop]: Abstraction has 2675 states and 3407 transitions. [2023-03-31 01:26:38,866 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 7.6) internal successors, (76), 5 states have internal predecessors, (76), 2 states have call successors, (17), 6 states have call predecessors, (17), 3 states have return successors, (12), 3 states have call predecessors, (12), 2 states have call successors, (12) [2023-03-31 01:26:38,866 INFO L276 IsEmpty]: Start isEmpty. Operand 2675 states and 3407 transitions. [2023-03-31 01:26:38,867 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2023-03-31 01:26:38,867 INFO L187 NwaCegarLoop]: Found error trace [2023-03-31 01:26:38,867 INFO L195 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] [2023-03-31 01:26:38,868 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2023-03-31 01:26:38,868 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-03-31 01:26:38,868 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-03-31 01:26:38,868 INFO L85 PathProgramCache]: Analyzing trace with hash -764236130, now seen corresponding path program 1 times [2023-03-31 01:26:38,868 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-03-31 01:26:38,868 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [884325344] [2023-03-31 01:26:38,869 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-03-31 01:26:38,869 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-03-31 01:26:38,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-03-31 01:26:39,030 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2023-03-31 01:26:39,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-03-31 01:26:39,046 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2023-03-31 01:26:39,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-03-31 01:26:39,049 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2023-03-31 01:26:39,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-03-31 01:26:39,059 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2023-03-31 01:26:39,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-03-31 01:26:39,075 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2023-03-31 01:26:39,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-03-31 01:26:39,094 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-03-31 01:26:39,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-03-31 01:26:39,101 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-03-31 01:26:39,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-03-31 01:26:39,102 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-03-31 01:26:39,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-03-31 01:26:39,103 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2023-03-31 01:26:39,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-03-31 01:26:39,104 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2023-03-31 01:26:39,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-03-31 01:26:39,105 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2023-03-31 01:26:39,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-03-31 01:26:39,128 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2023-03-31 01:26:39,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-03-31 01:26:39,130 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-03-31 01:26:39,130 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-03-31 01:26:39,130 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [884325344] [2023-03-31 01:26:39,131 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [884325344] provided 1 perfect and 0 imperfect interpolant sequences [2023-03-31 01:26:39,131 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-03-31 01:26:39,131 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2023-03-31 01:26:39,131 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1449189545] [2023-03-31 01:26:39,131 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-03-31 01:26:39,131 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2023-03-31 01:26:39,131 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-03-31 01:26:39,132 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2023-03-31 01:26:39,132 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2023-03-31 01:26:39,132 INFO L87 Difference]: Start difference. First operand 2675 states and 3407 transitions. Second operand has 10 states, 10 states have (on average 7.6) internal successors, (76), 6 states have internal predecessors, (76), 3 states have call successors, (17), 7 states have call predecessors, (17), 4 states have return successors, (12), 3 states have call predecessors, (12), 3 states have call successors, (12) [2023-03-31 01:26:41,820 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-03-31 01:26:41,821 INFO L93 Difference]: Finished difference Result 5293 states and 6918 transitions. [2023-03-31 01:26:41,821 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2023-03-31 01:26:41,821 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 7.6) internal successors, (76), 6 states have internal predecessors, (76), 3 states have call successors, (17), 7 states have call predecessors, (17), 4 states have return successors, (12), 3 states have call predecessors, (12), 3 states have call successors, (12) Word has length 105 [2023-03-31 01:26:41,821 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-03-31 01:26:41,835 INFO L225 Difference]: With dead ends: 5293 [2023-03-31 01:26:41,835 INFO L226 Difference]: Without dead ends: 3846 [2023-03-31 01:26:41,839 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 166 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=201, Invalid=555, Unknown=0, NotChecked=0, Total=756 [2023-03-31 01:26:41,839 INFO L413 NwaCegarLoop]: 6 mSDtfsCounter, 2030 mSDsluCounter, 11 mSDsCounter, 0 mSdLazyCounter, 1924 mSolverCounterSat, 687 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2052 SdHoareTripleChecker+Valid, 17 SdHoareTripleChecker+Invalid, 2611 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 687 IncrementalHoareTripleChecker+Valid, 1924 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.7s IncrementalHoareTripleChecker+Time [2023-03-31 01:26:41,840 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2052 Valid, 17 Invalid, 2611 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [687 Valid, 1924 Invalid, 0 Unknown, 0 Unchecked, 1.7s Time] [2023-03-31 01:26:41,842 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3846 states. [2023-03-31 01:26:42,377 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3846 to 3086. [2023-03-31 01:26:42,382 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3086 states, 2344 states have (on average 1.2875426621160408) internal successors, (3018), 2448 states have internal predecessors, (3018), 354 states have call successors, (354), 318 states have call predecessors, (354), 387 states have return successors, (531), 391 states have call predecessors, (531), 351 states have call successors, (531) [2023-03-31 01:26:42,389 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3086 states to 3086 states and 3903 transitions. [2023-03-31 01:26:42,390 INFO L78 Accepts]: Start accepts. Automaton has 3086 states and 3903 transitions. Word has length 105 [2023-03-31 01:26:42,390 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-03-31 01:26:42,390 INFO L495 AbstractCegarLoop]: Abstraction has 3086 states and 3903 transitions. [2023-03-31 01:26:42,390 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 7.6) internal successors, (76), 6 states have internal predecessors, (76), 3 states have call successors, (17), 7 states have call predecessors, (17), 4 states have return successors, (12), 3 states have call predecessors, (12), 3 states have call successors, (12) [2023-03-31 01:26:42,391 INFO L276 IsEmpty]: Start isEmpty. Operand 3086 states and 3903 transitions. [2023-03-31 01:26:42,392 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2023-03-31 01:26:42,392 INFO L187 NwaCegarLoop]: Found error trace [2023-03-31 01:26:42,393 INFO L195 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] [2023-03-31 01:26:42,393 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2023-03-31 01:26:42,393 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-03-31 01:26:42,393 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-03-31 01:26:42,393 INFO L85 PathProgramCache]: Analyzing trace with hash 621967264, now seen corresponding path program 1 times [2023-03-31 01:26:42,394 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-03-31 01:26:42,394 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1493838492] [2023-03-31 01:26:42,394 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-03-31 01:26:42,394 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-03-31 01:26:42,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-03-31 01:26:42,535 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2023-03-31 01:26:42,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-03-31 01:26:42,551 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2023-03-31 01:26:42,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-03-31 01:26:42,553 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2023-03-31 01:26:42,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-03-31 01:26:42,562 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2023-03-31 01:26:42,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-03-31 01:26:42,575 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2023-03-31 01:26:42,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-03-31 01:26:42,593 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-03-31 01:26:42,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-03-31 01:26:42,600 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-03-31 01:26:42,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-03-31 01:26:42,601 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-03-31 01:26:42,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-03-31 01:26:42,602 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2023-03-31 01:26:42,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-03-31 01:26:42,603 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2023-03-31 01:26:42,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-03-31 01:26:42,604 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2023-03-31 01:26:42,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-03-31 01:26:42,625 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2023-03-31 01:26:42,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-03-31 01:26:42,626 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-03-31 01:26:42,626 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-03-31 01:26:42,627 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1493838492] [2023-03-31 01:26:42,627 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1493838492] provided 1 perfect and 0 imperfect interpolant sequences [2023-03-31 01:26:42,627 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-03-31 01:26:42,627 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2023-03-31 01:26:42,627 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2058524801] [2023-03-31 01:26:42,627 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-03-31 01:26:42,627 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2023-03-31 01:26:42,627 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-03-31 01:26:42,628 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2023-03-31 01:26:42,628 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2023-03-31 01:26:42,628 INFO L87 Difference]: Start difference. First operand 3086 states and 3903 transitions. Second operand has 10 states, 10 states have (on average 7.6) internal successors, (76), 6 states have internal predecessors, (76), 3 states have call successors, (17), 7 states have call predecessors, (17), 4 states have return successors, (12), 3 states have call predecessors, (12), 3 states have call successors, (12) [2023-03-31 01:26:46,080 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-03-31 01:26:46,084 INFO L93 Difference]: Finished difference Result 9103 states and 11998 transitions. [2023-03-31 01:26:46,084 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2023-03-31 01:26:46,084 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 7.6) internal successors, (76), 6 states have internal predecessors, (76), 3 states have call successors, (17), 7 states have call predecessors, (17), 4 states have return successors, (12), 3 states have call predecessors, (12), 3 states have call successors, (12) Word has length 105 [2023-03-31 01:26:46,084 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-03-31 01:26:46,108 INFO L225 Difference]: With dead ends: 9103 [2023-03-31 01:26:46,108 INFO L226 Difference]: Without dead ends: 6097 [2023-03-31 01:26:46,118 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 267 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=271, Invalid=785, Unknown=0, NotChecked=0, Total=1056 [2023-03-31 01:26:46,118 INFO L413 NwaCegarLoop]: 6 mSDtfsCounter, 2052 mSDsluCounter, 11 mSDsCounter, 0 mSdLazyCounter, 2722 mSolverCounterSat, 617 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2083 SdHoareTripleChecker+Valid, 17 SdHoareTripleChecker+Invalid, 3339 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 617 IncrementalHoareTripleChecker+Valid, 2722 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.1s IncrementalHoareTripleChecker+Time [2023-03-31 01:26:46,119 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2083 Valid, 17 Invalid, 3339 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [617 Valid, 2722 Invalid, 0 Unknown, 0 Unchecked, 2.1s Time] [2023-03-31 01:26:46,124 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6097 states. [2023-03-31 01:26:46,910 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6097 to 4497. [2023-03-31 01:26:46,930 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4497 states, 3423 states have (on average 1.2956470931931054) internal successors, (4435), 3583 states have internal predecessors, (4435), 518 states have call successors, (518), 463 states have call predecessors, (518), 555 states have return successors, (864), 565 states have call predecessors, (864), 515 states have call successors, (864) [2023-03-31 01:26:46,942 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4497 states to 4497 states and 5817 transitions. [2023-03-31 01:26:46,944 INFO L78 Accepts]: Start accepts. Automaton has 4497 states and 5817 transitions. Word has length 105 [2023-03-31 01:26:46,944 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-03-31 01:26:46,944 INFO L495 AbstractCegarLoop]: Abstraction has 4497 states and 5817 transitions. [2023-03-31 01:26:46,945 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 7.6) internal successors, (76), 6 states have internal predecessors, (76), 3 states have call successors, (17), 7 states have call predecessors, (17), 4 states have return successors, (12), 3 states have call predecessors, (12), 3 states have call successors, (12) [2023-03-31 01:26:46,945 INFO L276 IsEmpty]: Start isEmpty. Operand 4497 states and 5817 transitions. [2023-03-31 01:26:46,946 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2023-03-31 01:26:46,946 INFO L187 NwaCegarLoop]: Found error trace [2023-03-31 01:26:46,946 INFO L195 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] [2023-03-31 01:26:46,947 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2023-03-31 01:26:46,947 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-03-31 01:26:46,947 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-03-31 01:26:46,947 INFO L85 PathProgramCache]: Analyzing trace with hash -1749771998, now seen corresponding path program 1 times [2023-03-31 01:26:46,947 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-03-31 01:26:46,947 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [729402476] [2023-03-31 01:26:46,947 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-03-31 01:26:46,948 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-03-31 01:26:46,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-03-31 01:26:47,066 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2023-03-31 01:26:47,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-03-31 01:26:47,077 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2023-03-31 01:26:47,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-03-31 01:26:47,079 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2023-03-31 01:26:47,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-03-31 01:26:47,089 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2023-03-31 01:26:47,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-03-31 01:26:47,105 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2023-03-31 01:26:47,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-03-31 01:26:47,108 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-03-31 01:26:47,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-03-31 01:26:47,124 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-03-31 01:26:47,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-03-31 01:26:47,127 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-03-31 01:26:47,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-03-31 01:26:47,128 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2023-03-31 01:26:47,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-03-31 01:26:47,129 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2023-03-31 01:26:47,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-03-31 01:26:47,131 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2023-03-31 01:26:47,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-03-31 01:26:47,133 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2023-03-31 01:26:47,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-03-31 01:26:47,136 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-03-31 01:26:47,136 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-03-31 01:26:47,136 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [729402476] [2023-03-31 01:26:47,137 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [729402476] provided 1 perfect and 0 imperfect interpolant sequences [2023-03-31 01:26:47,137 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-03-31 01:26:47,137 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2023-03-31 01:26:47,137 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [929186210] [2023-03-31 01:26:47,137 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-03-31 01:26:47,137 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-03-31 01:26:47,137 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-03-31 01:26:47,138 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-03-31 01:26:47,138 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2023-03-31 01:26:47,138 INFO L87 Difference]: Start difference. First operand 4497 states and 5817 transitions. Second operand has 8 states, 8 states have (on average 9.5) internal successors, (76), 4 states have internal predecessors, (76), 4 states have call successors, (17), 7 states have call predecessors, (17), 3 states have return successors, (12), 3 states have call predecessors, (12), 3 states have call successors, (12) [2023-03-31 01:26:50,101 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-03-31 01:26:50,101 INFO L93 Difference]: Finished difference Result 14782 states and 20555 transitions. [2023-03-31 01:26:50,101 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2023-03-31 01:26:50,102 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 9.5) internal successors, (76), 4 states have internal predecessors, (76), 4 states have call successors, (17), 7 states have call predecessors, (17), 3 states have return successors, (12), 3 states have call predecessors, (12), 3 states have call successors, (12) Word has length 105 [2023-03-31 01:26:50,102 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-03-31 01:26:50,140 INFO L225 Difference]: With dead ends: 14782 [2023-03-31 01:26:50,140 INFO L226 Difference]: Without dead ends: 10366 [2023-03-31 01:26:50,157 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 55 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=107, Invalid=235, Unknown=0, NotChecked=0, Total=342 [2023-03-31 01:26:50,158 INFO L413 NwaCegarLoop]: 6 mSDtfsCounter, 1327 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 1129 mSolverCounterSat, 523 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1359 SdHoareTripleChecker+Valid, 13 SdHoareTripleChecker+Invalid, 1652 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 523 IncrementalHoareTripleChecker+Valid, 1129 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2023-03-31 01:26:50,158 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1359 Valid, 13 Invalid, 1652 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [523 Valid, 1129 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2023-03-31 01:26:50,167 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10366 states. [2023-03-31 01:26:51,457 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10366 to 8005. [2023-03-31 01:26:51,465 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8005 states, 6065 states have (on average 1.3111294311624073) internal successors, (7952), 6436 states have internal predecessors, (7952), 993 states have call successors, (993), 772 states have call predecessors, (993), 946 states have return successors, (1788), 1082 states have call predecessors, (1788), 990 states have call successors, (1788) [2023-03-31 01:26:51,487 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8005 states to 8005 states and 10733 transitions. [2023-03-31 01:26:51,490 INFO L78 Accepts]: Start accepts. Automaton has 8005 states and 10733 transitions. Word has length 105 [2023-03-31 01:26:51,490 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-03-31 01:26:51,490 INFO L495 AbstractCegarLoop]: Abstraction has 8005 states and 10733 transitions. [2023-03-31 01:26:51,490 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 9.5) internal successors, (76), 4 states have internal predecessors, (76), 4 states have call successors, (17), 7 states have call predecessors, (17), 3 states have return successors, (12), 3 states have call predecessors, (12), 3 states have call successors, (12) [2023-03-31 01:26:51,491 INFO L276 IsEmpty]: Start isEmpty. Operand 8005 states and 10733 transitions. [2023-03-31 01:26:51,493 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2023-03-31 01:26:51,493 INFO L187 NwaCegarLoop]: Found error trace [2023-03-31 01:26:51,493 INFO L195 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] [2023-03-31 01:26:51,493 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2023-03-31 01:26:51,493 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-03-31 01:26:51,494 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-03-31 01:26:51,494 INFO L85 PathProgramCache]: Analyzing trace with hash -1825504858, now seen corresponding path program 1 times [2023-03-31 01:26:51,494 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-03-31 01:26:51,494 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1469129790] [2023-03-31 01:26:51,494 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-03-31 01:26:51,494 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-03-31 01:26:51,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-03-31 01:26:51,577 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2023-03-31 01:26:51,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-03-31 01:26:51,587 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2023-03-31 01:26:51,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-03-31 01:26:51,589 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2023-03-31 01:26:51,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-03-31 01:26:51,597 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2023-03-31 01:26:51,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-03-31 01:26:51,613 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2023-03-31 01:26:51,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-03-31 01:26:51,616 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-03-31 01:26:51,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-03-31 01:26:51,633 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-03-31 01:26:51,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-03-31 01:26:51,635 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-03-31 01:26:51,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-03-31 01:26:51,637 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2023-03-31 01:26:51,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-03-31 01:26:51,638 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2023-03-31 01:26:51,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-03-31 01:26:51,640 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2023-03-31 01:26:51,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-03-31 01:26:51,642 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2023-03-31 01:26:51,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-03-31 01:26:51,645 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-03-31 01:26:51,645 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-03-31 01:26:51,645 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1469129790] [2023-03-31 01:26:51,645 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1469129790] provided 1 perfect and 0 imperfect interpolant sequences [2023-03-31 01:26:51,645 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-03-31 01:26:51,645 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2023-03-31 01:26:51,645 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [267830578] [2023-03-31 01:26:51,645 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-03-31 01:26:51,646 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-03-31 01:26:51,646 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-03-31 01:26:51,646 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-03-31 01:26:51,646 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2023-03-31 01:26:51,646 INFO L87 Difference]: Start difference. First operand 8005 states and 10733 transitions. Second operand has 8 states, 8 states have (on average 9.625) internal successors, (77), 4 states have internal predecessors, (77), 4 states have call successors, (17), 7 states have call predecessors, (17), 3 states have return successors, (12), 3 states have call predecessors, (12), 3 states have call successors, (12) [2023-03-31 01:26:56,363 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-03-31 01:26:56,363 INFO L93 Difference]: Finished difference Result 28533 states and 41255 transitions. [2023-03-31 01:26:56,364 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2023-03-31 01:26:56,364 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 9.625) internal successors, (77), 4 states have internal predecessors, (77), 4 states have call successors, (17), 7 states have call predecessors, (17), 3 states have return successors, (12), 3 states have call predecessors, (12), 3 states have call successors, (12) Word has length 106 [2023-03-31 01:26:56,364 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-03-31 01:26:56,455 INFO L225 Difference]: With dead ends: 28533 [2023-03-31 01:26:56,455 INFO L226 Difference]: Without dead ends: 20673 [2023-03-31 01:26:56,491 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 57 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=107, Invalid=235, Unknown=0, NotChecked=0, Total=342 [2023-03-31 01:26:56,492 INFO L413 NwaCegarLoop]: 6 mSDtfsCounter, 1024 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 1440 mSolverCounterSat, 332 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1057 SdHoareTripleChecker+Valid, 13 SdHoareTripleChecker+Invalid, 1772 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 332 IncrementalHoareTripleChecker+Valid, 1440 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2023-03-31 01:26:56,492 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1057 Valid, 13 Invalid, 1772 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [332 Valid, 1440 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2023-03-31 01:26:56,511 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20673 states. [2023-03-31 01:26:59,290 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20673 to 16617. [2023-03-31 01:26:59,305 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16617 states, 12521 states have (on average 1.3103585975561058) internal successors, (16407), 13329 states have internal predecessors, (16407), 2153 states have call successors, (2153), 1417 states have call predecessors, (2153), 1942 states have return successors, (4782), 2489 states have call predecessors, (4782), 2150 states have call successors, (4782) [2023-03-31 01:26:59,365 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16617 states to 16617 states and 23342 transitions. [2023-03-31 01:26:59,370 INFO L78 Accepts]: Start accepts. Automaton has 16617 states and 23342 transitions. Word has length 106 [2023-03-31 01:26:59,370 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-03-31 01:26:59,371 INFO L495 AbstractCegarLoop]: Abstraction has 16617 states and 23342 transitions. [2023-03-31 01:26:59,371 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 9.625) internal successors, (77), 4 states have internal predecessors, (77), 4 states have call successors, (17), 7 states have call predecessors, (17), 3 states have return successors, (12), 3 states have call predecessors, (12), 3 states have call successors, (12) [2023-03-31 01:26:59,371 INFO L276 IsEmpty]: Start isEmpty. Operand 16617 states and 23342 transitions. [2023-03-31 01:26:59,372 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2023-03-31 01:26:59,372 INFO L187 NwaCegarLoop]: Found error trace [2023-03-31 01:26:59,373 INFO L195 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] [2023-03-31 01:26:59,373 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2023-03-31 01:26:59,373 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-03-31 01:26:59,373 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-03-31 01:26:59,373 INFO L85 PathProgramCache]: Analyzing trace with hash 880852289, now seen corresponding path program 1 times [2023-03-31 01:26:59,373 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-03-31 01:26:59,373 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1989588240] [2023-03-31 01:26:59,373 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-03-31 01:26:59,373 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-03-31 01:26:59,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-03-31 01:26:59,454 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2023-03-31 01:26:59,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-03-31 01:26:59,465 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2023-03-31 01:26:59,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-03-31 01:26:59,467 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2023-03-31 01:26:59,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-03-31 01:26:59,476 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2023-03-31 01:26:59,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-03-31 01:26:59,493 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2023-03-31 01:26:59,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-03-31 01:26:59,496 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-03-31 01:26:59,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-03-31 01:26:59,513 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-03-31 01:26:59,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-03-31 01:26:59,519 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-03-31 01:26:59,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-03-31 01:26:59,521 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2023-03-31 01:26:59,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-03-31 01:26:59,523 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2023-03-31 01:26:59,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-03-31 01:26:59,525 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2023-03-31 01:26:59,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-03-31 01:26:59,639 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2023-03-31 01:26:59,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-03-31 01:26:59,641 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-03-31 01:26:59,641 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-03-31 01:26:59,641 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1989588240] [2023-03-31 01:26:59,641 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1989588240] provided 1 perfect and 0 imperfect interpolant sequences [2023-03-31 01:26:59,641 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-03-31 01:26:59,641 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2023-03-31 01:26:59,642 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [797476022] [2023-03-31 01:26:59,642 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-03-31 01:26:59,642 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-03-31 01:26:59,642 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-03-31 01:26:59,642 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-03-31 01:26:59,643 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2023-03-31 01:26:59,643 INFO L87 Difference]: Start difference. First operand 16617 states and 23342 transitions. Second operand has 8 states, 8 states have (on average 9.75) internal successors, (78), 4 states have internal predecessors, (78), 4 states have call successors, (17), 7 states have call predecessors, (17), 3 states have return successors, (12), 3 states have call predecessors, (12), 3 states have call successors, (12)