./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/combinations/pc_sfifo_2.cil-1+token_ring.02.cil-2.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 791161d1 Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/combinations/pc_sfifo_2.cil-1+token_ring.02.cil-2.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 4ea93d7c6d06d46004840cc5fcb436c7c307334e6ee754b8ee507b78f644445d --- Real Ultimate output --- This is Ultimate 0.2.2-?-791161d [2022-07-22 20:46:38,337 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-07-22 20:46:38,339 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-07-22 20:46:38,397 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-07-22 20:46:38,397 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-07-22 20:46:38,398 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-07-22 20:46:38,399 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-07-22 20:46:38,403 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-07-22 20:46:38,404 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-07-22 20:46:38,404 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-07-22 20:46:38,405 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-07-22 20:46:38,406 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-07-22 20:46:38,406 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-07-22 20:46:38,407 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-07-22 20:46:38,407 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-07-22 20:46:38,408 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-07-22 20:46:38,409 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-07-22 20:46:38,409 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-07-22 20:46:38,410 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-07-22 20:46:38,412 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-07-22 20:46:38,413 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-07-22 20:46:38,414 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-07-22 20:46:38,414 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-07-22 20:46:38,415 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-07-22 20:46:38,416 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-07-22 20:46:38,420 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-07-22 20:46:38,423 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-07-22 20:46:38,424 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-07-22 20:46:38,424 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-07-22 20:46:38,425 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-07-22 20:46:38,425 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-07-22 20:46:38,426 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-07-22 20:46:38,427 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-07-22 20:46:38,427 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-07-22 20:46:38,428 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-07-22 20:46:38,429 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-07-22 20:46:38,429 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-07-22 20:46:38,430 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-07-22 20:46:38,430 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-07-22 20:46:38,430 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-07-22 20:46:38,431 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-07-22 20:46:38,433 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-07-22 20:46:38,434 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2022-07-22 20:46:38,452 INFO L113 SettingsManager]: Loading preferences was successful [2022-07-22 20:46:38,452 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-07-22 20:46:38,453 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-07-22 20:46:38,453 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-07-22 20:46:38,453 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-07-22 20:46:38,453 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-07-22 20:46:38,454 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-07-22 20:46:38,454 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-07-22 20:46:38,454 INFO L138 SettingsManager]: * Use SBE=true [2022-07-22 20:46:38,454 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-07-22 20:46:38,454 INFO L138 SettingsManager]: * sizeof long=4 [2022-07-22 20:46:38,455 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-07-22 20:46:38,455 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-07-22 20:46:38,455 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-07-22 20:46:38,455 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-07-22 20:46:38,455 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-07-22 20:46:38,455 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-07-22 20:46:38,455 INFO L138 SettingsManager]: * sizeof long double=12 [2022-07-22 20:46:38,456 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-07-22 20:46:38,456 INFO L138 SettingsManager]: * Use constant arrays=true [2022-07-22 20:46:38,456 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-07-22 20:46:38,456 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-07-22 20:46:38,456 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-07-22 20:46:38,456 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-07-22 20:46:38,457 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-22 20:46:38,457 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-07-22 20:46:38,457 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-07-22 20:46:38,457 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-07-22 20:46:38,457 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-07-22 20:46:38,457 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-07-22 20:46:38,457 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-07-22 20:46:38,458 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-07-22 20:46:38,458 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-07-22 20:46:38,458 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 4ea93d7c6d06d46004840cc5fcb436c7c307334e6ee754b8ee507b78f644445d [2022-07-22 20:46:38,624 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-07-22 20:46:38,641 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-07-22 20:46:38,644 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-07-22 20:46:38,645 INFO L271 PluginConnector]: Initializing CDTParser... [2022-07-22 20:46:38,645 INFO L275 PluginConnector]: CDTParser initialized [2022-07-22 20:46:38,646 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/combinations/pc_sfifo_2.cil-1+token_ring.02.cil-2.c [2022-07-22 20:46:38,700 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3875a06c3/f1e4b52a21274892a2246240966f5f70/FLAG77e24fdc9 [2022-07-22 20:46:39,073 INFO L306 CDTParser]: Found 1 translation units. [2022-07-22 20:46:39,074 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/combinations/pc_sfifo_2.cil-1+token_ring.02.cil-2.c [2022-07-22 20:46:39,083 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3875a06c3/f1e4b52a21274892a2246240966f5f70/FLAG77e24fdc9 [2022-07-22 20:46:39,094 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3875a06c3/f1e4b52a21274892a2246240966f5f70 [2022-07-22 20:46:39,096 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-07-22 20:46:39,096 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-07-22 20:46:39,097 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-07-22 20:46:39,097 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-07-22 20:46:39,099 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-07-22 20:46:39,100 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.07 08:46:39" (1/1) ... [2022-07-22 20:46:39,101 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@104af75e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 08:46:39, skipping insertion in model container [2022-07-22 20:46:39,101 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.07 08:46:39" (1/1) ... [2022-07-22 20:46:39,105 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-07-22 20:46:39,128 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-07-22 20:46:39,250 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/combinations/pc_sfifo_2.cil-1+token_ring.02.cil-2.c[914,927] [2022-07-22 20:46:39,279 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/combinations/pc_sfifo_2.cil-1+token_ring.02.cil-2.c[7115,7128] [2022-07-22 20:46:39,301 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-22 20:46:39,307 INFO L203 MainTranslator]: Completed pre-run [2022-07-22 20:46:39,317 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/combinations/pc_sfifo_2.cil-1+token_ring.02.cil-2.c[914,927] [2022-07-22 20:46:39,345 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/combinations/pc_sfifo_2.cil-1+token_ring.02.cil-2.c[7115,7128] [2022-07-22 20:46:39,375 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-22 20:46:39,387 INFO L208 MainTranslator]: Completed translation [2022-07-22 20:46:39,388 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 08:46:39 WrapperNode [2022-07-22 20:46:39,388 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-07-22 20:46:39,389 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-07-22 20:46:39,389 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-07-22 20:46:39,389 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-07-22 20:46:39,404 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 08:46:39" (1/1) ... [2022-07-22 20:46:39,412 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 08:46:39" (1/1) ... [2022-07-22 20:46:39,447 INFO L137 Inliner]: procedures = 57, calls = 64, calls flagged for inlining = 25, calls inlined = 25, statements flattened = 465 [2022-07-22 20:46:39,448 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-07-22 20:46:39,448 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-07-22 20:46:39,449 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-07-22 20:46:39,449 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-07-22 20:46:39,454 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 08:46:39" (1/1) ... [2022-07-22 20:46:39,454 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 08:46:39" (1/1) ... [2022-07-22 20:46:39,460 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 08:46:39" (1/1) ... [2022-07-22 20:46:39,461 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 08:46:39" (1/1) ... [2022-07-22 20:46:39,467 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 08:46:39" (1/1) ... [2022-07-22 20:46:39,484 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 08:46:39" (1/1) ... [2022-07-22 20:46:39,489 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 08:46:39" (1/1) ... [2022-07-22 20:46:39,491 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-07-22 20:46:39,493 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-07-22 20:46:39,495 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-07-22 20:46:39,495 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-07-22 20:46:39,496 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 08:46:39" (1/1) ... [2022-07-22 20:46:39,502 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-22 20:46:39,509 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 20:46:39,517 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) [2022-07-22 20:46:39,519 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 [2022-07-22 20:46:39,544 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-07-22 20:46:39,544 INFO L130 BoogieDeclarations]: Found specification of procedure immediate_notify [2022-07-22 20:46:39,545 INFO L138 BoogieDeclarations]: Found implementation of procedure immediate_notify [2022-07-22 20:46:39,545 INFO L130 BoogieDeclarations]: Found specification of procedure is_do_write_p_triggered [2022-07-22 20:46:39,545 INFO L138 BoogieDeclarations]: Found implementation of procedure is_do_write_p_triggered [2022-07-22 20:46:39,545 INFO L130 BoogieDeclarations]: Found specification of procedure exists_runnable_thread1 [2022-07-22 20:46:39,545 INFO L138 BoogieDeclarations]: Found implementation of procedure exists_runnable_thread1 [2022-07-22 20:46:39,545 INFO L130 BoogieDeclarations]: Found specification of procedure exists_runnable_thread2 [2022-07-22 20:46:39,545 INFO L138 BoogieDeclarations]: Found implementation of procedure exists_runnable_thread2 [2022-07-22 20:46:39,545 INFO L130 BoogieDeclarations]: Found specification of procedure reset_delta_events1 [2022-07-22 20:46:39,546 INFO L138 BoogieDeclarations]: Found implementation of procedure reset_delta_events1 [2022-07-22 20:46:39,546 INFO L130 BoogieDeclarations]: Found specification of procedure reset_delta_events2 [2022-07-22 20:46:39,546 INFO L138 BoogieDeclarations]: Found implementation of procedure reset_delta_events2 [2022-07-22 20:46:39,546 INFO L130 BoogieDeclarations]: Found specification of procedure activate_threads2 [2022-07-22 20:46:39,546 INFO L138 BoogieDeclarations]: Found implementation of procedure activate_threads2 [2022-07-22 20:46:39,546 INFO L130 BoogieDeclarations]: Found specification of procedure activate_threads1 [2022-07-22 20:46:39,546 INFO L138 BoogieDeclarations]: Found implementation of procedure activate_threads1 [2022-07-22 20:46:39,546 INFO L130 BoogieDeclarations]: Found specification of procedure is_do_read_c_triggered [2022-07-22 20:46:39,547 INFO L138 BoogieDeclarations]: Found implementation of procedure is_do_read_c_triggered [2022-07-22 20:46:39,547 INFO L130 BoogieDeclarations]: Found specification of procedure update_channels1 [2022-07-22 20:46:39,547 INFO L138 BoogieDeclarations]: Found implementation of procedure update_channels1 [2022-07-22 20:46:39,547 INFO L130 BoogieDeclarations]: Found specification of procedure update_channels2 [2022-07-22 20:46:39,547 INFO L138 BoogieDeclarations]: Found implementation of procedure update_channels2 [2022-07-22 20:46:39,547 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-07-22 20:46:39,547 INFO L130 BoogieDeclarations]: Found specification of procedure fire_delta_events2 [2022-07-22 20:46:39,547 INFO L138 BoogieDeclarations]: Found implementation of procedure fire_delta_events2 [2022-07-22 20:46:39,547 INFO L130 BoogieDeclarations]: Found specification of procedure fire_delta_events1 [2022-07-22 20:46:39,548 INFO L138 BoogieDeclarations]: Found implementation of procedure fire_delta_events1 [2022-07-22 20:46:39,548 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-07-22 20:46:39,548 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-07-22 20:46:39,548 INFO L130 BoogieDeclarations]: Found specification of procedure error1 [2022-07-22 20:46:39,548 INFO L138 BoogieDeclarations]: Found implementation of procedure error1 [2022-07-22 20:46:39,548 INFO L130 BoogieDeclarations]: Found specification of procedure error2 [2022-07-22 20:46:39,548 INFO L138 BoogieDeclarations]: Found implementation of procedure error2 [2022-07-22 20:46:39,638 INFO L234 CfgBuilder]: Building ICFG [2022-07-22 20:46:39,640 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-07-22 20:46:40,086 INFO L275 CfgBuilder]: Performing block encoding [2022-07-22 20:46:40,092 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-07-22 20:46:40,093 INFO L299 CfgBuilder]: Removed 9 assume(true) statements. [2022-07-22 20:46:40,094 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.07 08:46:40 BoogieIcfgContainer [2022-07-22 20:46:40,094 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-07-22 20:46:40,096 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-07-22 20:46:40,096 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-07-22 20:46:40,098 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-07-22 20:46:40,098 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 22.07 08:46:39" (1/3) ... [2022-07-22 20:46:40,099 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6829cdc0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.07 08:46:40, skipping insertion in model container [2022-07-22 20:46:40,099 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 08:46:39" (2/3) ... [2022-07-22 20:46:40,099 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6829cdc0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.07 08:46:40, skipping insertion in model container [2022-07-22 20:46:40,100 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.07 08:46:40" (3/3) ... [2022-07-22 20:46:40,102 INFO L111 eAbstractionObserver]: Analyzing ICFG pc_sfifo_2.cil-1+token_ring.02.cil-2.c [2022-07-22 20:46:40,111 INFO L201 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-07-22 20:46:40,111 INFO L160 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2022-07-22 20:46:40,145 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-07-22 20:46:40,150 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=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@1d10c108, mLbeIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@6d2036ae [2022-07-22 20:46:40,150 INFO L358 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2022-07-22 20:46:40,153 INFO L276 IsEmpty]: Start isEmpty. Operand has 241 states, 191 states have (on average 1.5654450261780104) internal successors, (299), 199 states have internal predecessors, (299), 32 states have call successors, (32), 15 states have call predecessors, (32), 15 states have return successors, (32), 30 states have call predecessors, (32), 32 states have call successors, (32) [2022-07-22 20:46:40,162 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2022-07-22 20:46:40,162 INFO L187 NwaCegarLoop]: Found error trace [2022-07-22 20:46:40,162 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] [2022-07-22 20:46:40,163 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-22 20:46:40,166 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 20:46:40,166 INFO L85 PathProgramCache]: Analyzing trace with hash -448089429, now seen corresponding path program 1 times [2022-07-22 20:46:40,172 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 20:46:40,172 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [605079672] [2022-07-22 20:46:40,173 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 20:46:40,173 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 20:46:40,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 20:46:40,325 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-07-22 20:46:40,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 20:46:40,350 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-07-22 20:46:40,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 20:46:40,375 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-07-22 20:46:40,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 20:46:40,394 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-22 20:46:40,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 20:46:40,401 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-22 20:46:40,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 20:46:40,409 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2022-07-22 20:46:40,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 20:46:40,416 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2022-07-22 20:46:40,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 20:46:40,423 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-22 20:46:40,424 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-22 20:46:40,424 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [605079672] [2022-07-22 20:46:40,425 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [605079672] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-22 20:46:40,425 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-22 20:46:40,425 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-22 20:46:40,426 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [495638580] [2022-07-22 20:46:40,427 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-22 20:46:40,431 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-22 20:46:40,432 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-22 20:46:40,454 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-22 20:46:40,454 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-07-22 20:46:40,458 INFO L87 Difference]: Start difference. First operand has 241 states, 191 states have (on average 1.5654450261780104) internal successors, (299), 199 states have internal predecessors, (299), 32 states have call successors, (32), 15 states have call predecessors, (32), 15 states have return successors, (32), 30 states have call predecessors, (32), 32 states have call successors, (32) Second operand has 6 states, 6 states have (on average 8.333333333333334) internal successors, (50), 3 states have internal predecessors, (50), 3 states have call successors, (8), 5 states have call predecessors, (8), 1 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2022-07-22 20:46:40,852 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-22 20:46:40,852 INFO L93 Difference]: Finished difference Result 482 states and 727 transitions. [2022-07-22 20:46:40,853 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-07-22 20:46:40,854 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 8.333333333333334) internal successors, (50), 3 states have internal predecessors, (50), 3 states have call successors, (8), 5 states have call predecessors, (8), 1 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) Word has length 65 [2022-07-22 20:46:40,854 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-22 20:46:40,862 INFO L225 Difference]: With dead ends: 482 [2022-07-22 20:46:40,862 INFO L226 Difference]: Without dead ends: 248 [2022-07-22 20:46:40,865 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2022-07-22 20:46:40,867 INFO L413 NwaCegarLoop]: 333 mSDtfsCounter, 351 mSDsluCounter, 564 mSDsCounter, 0 mSdLazyCounter, 265 mSolverCounterSat, 82 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 361 SdHoareTripleChecker+Valid, 897 SdHoareTripleChecker+Invalid, 347 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 82 IncrementalHoareTripleChecker+Valid, 265 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-07-22 20:46:40,868 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [361 Valid, 897 Invalid, 347 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [82 Valid, 265 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-07-22 20:46:40,879 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 248 states. [2022-07-22 20:46:40,911 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 248 to 230. [2022-07-22 20:46:40,912 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 230 states, 183 states have (on average 1.46448087431694) internal successors, (268), 188 states have internal predecessors, (268), 32 states have call successors, (32), 15 states have call predecessors, (32), 13 states have return successors, (28), 28 states have call predecessors, (28), 28 states have call successors, (28) [2022-07-22 20:46:40,914 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 230 states to 230 states and 328 transitions. [2022-07-22 20:46:40,915 INFO L78 Accepts]: Start accepts. Automaton has 230 states and 328 transitions. Word has length 65 [2022-07-22 20:46:40,915 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-22 20:46:40,915 INFO L495 AbstractCegarLoop]: Abstraction has 230 states and 328 transitions. [2022-07-22 20:46:40,915 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 8.333333333333334) internal successors, (50), 3 states have internal predecessors, (50), 3 states have call successors, (8), 5 states have call predecessors, (8), 1 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2022-07-22 20:46:40,915 INFO L276 IsEmpty]: Start isEmpty. Operand 230 states and 328 transitions. [2022-07-22 20:46:40,917 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2022-07-22 20:46:40,917 INFO L187 NwaCegarLoop]: Found error trace [2022-07-22 20:46:40,917 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] [2022-07-22 20:46:40,918 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-07-22 20:46:40,918 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-22 20:46:40,923 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 20:46:40,924 INFO L85 PathProgramCache]: Analyzing trace with hash -488764179, now seen corresponding path program 1 times [2022-07-22 20:46:40,924 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 20:46:40,924 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2003422073] [2022-07-22 20:46:40,924 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 20:46:40,924 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 20:46:40,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 20:46:40,981 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-07-22 20:46:40,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 20:46:40,995 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-07-22 20:46:40,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 20:46:41,020 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-07-22 20:46:41,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 20:46:41,027 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-22 20:46:41,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 20:46:41,029 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-22 20:46:41,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 20:46:41,031 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2022-07-22 20:46:41,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 20:46:41,034 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2022-07-22 20:46:41,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 20:46:41,037 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-22 20:46:41,037 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-22 20:46:41,037 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2003422073] [2022-07-22 20:46:41,037 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2003422073] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-22 20:46:41,037 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-22 20:46:41,037 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-07-22 20:46:41,038 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [766392816] [2022-07-22 20:46:41,038 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-22 20:46:41,039 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-07-22 20:46:41,039 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-22 20:46:41,040 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-07-22 20:46:41,040 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2022-07-22 20:46:41,040 INFO L87 Difference]: Start difference. First operand 230 states and 328 transitions. Second operand has 8 states, 8 states have (on average 6.25) internal successors, (50), 5 states have internal predecessors, (50), 3 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2022-07-22 20:46:41,554 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-22 20:46:41,554 INFO L93 Difference]: Finished difference Result 453 states and 642 transitions. [2022-07-22 20:46:41,554 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-07-22 20:46:41,555 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 6.25) internal successors, (50), 5 states have internal predecessors, (50), 3 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) Word has length 65 [2022-07-22 20:46:41,555 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-22 20:46:41,557 INFO L225 Difference]: With dead ends: 453 [2022-07-22 20:46:41,557 INFO L226 Difference]: Without dead ends: 365 [2022-07-22 20:46:41,558 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=79, Invalid=193, Unknown=0, NotChecked=0, Total=272 [2022-07-22 20:46:41,559 INFO L413 NwaCegarLoop]: 341 mSDtfsCounter, 592 mSDsluCounter, 627 mSDsCounter, 0 mSdLazyCounter, 582 mSolverCounterSat, 172 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 597 SdHoareTripleChecker+Valid, 968 SdHoareTripleChecker+Invalid, 754 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 172 IncrementalHoareTripleChecker+Valid, 582 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-07-22 20:46:41,559 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [597 Valid, 968 Invalid, 754 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [172 Valid, 582 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-07-22 20:46:41,560 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 365 states. [2022-07-22 20:46:41,580 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 365 to 326. [2022-07-22 20:46:41,581 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 326 states, 259 states have (on average 1.4362934362934363) internal successors, (372), 266 states have internal predecessors, (372), 43 states have call successors, (43), 22 states have call predecessors, (43), 22 states have return successors, (44), 40 states have call predecessors, (44), 39 states have call successors, (44) [2022-07-22 20:46:41,582 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 326 states to 326 states and 459 transitions. [2022-07-22 20:46:41,582 INFO L78 Accepts]: Start accepts. Automaton has 326 states and 459 transitions. Word has length 65 [2022-07-22 20:46:41,583 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-22 20:46:41,583 INFO L495 AbstractCegarLoop]: Abstraction has 326 states and 459 transitions. [2022-07-22 20:46:41,583 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 6.25) internal successors, (50), 5 states have internal predecessors, (50), 3 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2022-07-22 20:46:41,583 INFO L276 IsEmpty]: Start isEmpty. Operand 326 states and 459 transitions. [2022-07-22 20:46:41,585 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2022-07-22 20:46:41,585 INFO L187 NwaCegarLoop]: Found error trace [2022-07-22 20:46:41,586 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] [2022-07-22 20:46:41,586 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-07-22 20:46:41,586 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-22 20:46:41,586 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 20:46:41,586 INFO L85 PathProgramCache]: Analyzing trace with hash 1049575851, now seen corresponding path program 1 times [2022-07-22 20:46:41,587 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 20:46:41,587 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1214157073] [2022-07-22 20:46:41,587 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 20:46:41,587 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 20:46:41,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 20:46:41,613 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-07-22 20:46:41,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 20:46:41,635 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-07-22 20:46:41,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 20:46:41,646 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-07-22 20:46:41,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 20:46:41,689 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-22 20:46:41,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 20:46:41,722 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-22 20:46:41,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 20:46:41,732 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2022-07-22 20:46:41,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 20:46:41,734 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2022-07-22 20:46:41,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 20:46:41,736 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-22 20:46:41,736 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-22 20:46:41,736 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1214157073] [2022-07-22 20:46:41,736 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1214157073] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-22 20:46:41,736 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-22 20:46:41,737 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-07-22 20:46:41,737 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1659956466] [2022-07-22 20:46:41,737 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-22 20:46:41,737 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-07-22 20:46:41,737 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-22 20:46:41,737 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-07-22 20:46:41,738 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2022-07-22 20:46:41,738 INFO L87 Difference]: Start difference. First operand 326 states and 459 transitions. Second operand has 9 states, 9 states have (on average 5.555555555555555) internal successors, (50), 5 states have internal predecessors, (50), 2 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 2 states have call successors, (7) [2022-07-22 20:46:42,288 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-22 20:46:42,289 INFO L93 Difference]: Finished difference Result 540 states and 753 transitions. [2022-07-22 20:46:42,289 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-07-22 20:46:42,289 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 5.555555555555555) internal successors, (50), 5 states have internal predecessors, (50), 2 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 2 states have call successors, (7) Word has length 65 [2022-07-22 20:46:42,289 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-22 20:46:42,291 INFO L225 Difference]: With dead ends: 540 [2022-07-22 20:46:42,291 INFO L226 Difference]: Without dead ends: 363 [2022-07-22 20:46:42,292 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=66, Invalid=174, Unknown=0, NotChecked=0, Total=240 [2022-07-22 20:46:42,293 INFO L413 NwaCegarLoop]: 315 mSDtfsCounter, 252 mSDsluCounter, 1134 mSDsCounter, 0 mSdLazyCounter, 820 mSolverCounterSat, 81 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 253 SdHoareTripleChecker+Valid, 1449 SdHoareTripleChecker+Invalid, 901 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 81 IncrementalHoareTripleChecker+Valid, 820 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-07-22 20:46:42,293 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [253 Valid, 1449 Invalid, 901 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [81 Valid, 820 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-07-22 20:46:42,294 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 363 states. [2022-07-22 20:46:42,322 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 363 to 331. [2022-07-22 20:46:42,323 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 331 states, 263 states have (on average 1.4258555133079849) internal successors, (375), 270 states have internal predecessors, (375), 43 states have call successors, (43), 22 states have call predecessors, (43), 23 states have return successors, (45), 41 states have call predecessors, (45), 39 states have call successors, (45) [2022-07-22 20:46:42,324 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 331 states to 331 states and 463 transitions. [2022-07-22 20:46:42,324 INFO L78 Accepts]: Start accepts. Automaton has 331 states and 463 transitions. Word has length 65 [2022-07-22 20:46:42,325 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-22 20:46:42,325 INFO L495 AbstractCegarLoop]: Abstraction has 331 states and 463 transitions. [2022-07-22 20:46:42,325 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 5.555555555555555) internal successors, (50), 5 states have internal predecessors, (50), 2 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 2 states have call successors, (7) [2022-07-22 20:46:42,325 INFO L276 IsEmpty]: Start isEmpty. Operand 331 states and 463 transitions. [2022-07-22 20:46:42,327 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2022-07-22 20:46:42,327 INFO L187 NwaCegarLoop]: Found error trace [2022-07-22 20:46:42,327 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] [2022-07-22 20:46:42,327 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-07-22 20:46:42,327 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-22 20:46:42,328 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 20:46:42,328 INFO L85 PathProgramCache]: Analyzing trace with hash 20216553, now seen corresponding path program 1 times [2022-07-22 20:46:42,328 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 20:46:42,328 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [583337188] [2022-07-22 20:46:42,328 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 20:46:42,328 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 20:46:42,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 20:46:42,357 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-07-22 20:46:42,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 20:46:42,371 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-07-22 20:46:42,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 20:46:42,379 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-07-22 20:46:42,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 20:46:42,401 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-22 20:46:42,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 20:46:42,403 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-22 20:46:42,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 20:46:42,412 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2022-07-22 20:46:42,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 20:46:42,415 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2022-07-22 20:46:42,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 20:46:42,417 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-22 20:46:42,417 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-22 20:46:42,417 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [583337188] [2022-07-22 20:46:42,417 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [583337188] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-22 20:46:42,417 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-22 20:46:42,418 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-07-22 20:46:42,418 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2056841992] [2022-07-22 20:46:42,418 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-22 20:46:42,418 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-07-22 20:46:42,418 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-22 20:46:42,419 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-07-22 20:46:42,419 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2022-07-22 20:46:42,419 INFO L87 Difference]: Start difference. First operand 331 states and 463 transitions. Second operand has 10 states, 10 states have (on average 5.0) internal successors, (50), 7 states have internal predecessors, (50), 4 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 4 states have call predecessors, (7), 4 states have call successors, (7) [2022-07-22 20:46:43,675 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-22 20:46:43,675 INFO L93 Difference]: Finished difference Result 1231 states and 1681 transitions. [2022-07-22 20:46:43,676 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2022-07-22 20:46:43,676 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 5.0) internal successors, (50), 7 states have internal predecessors, (50), 4 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 4 states have call predecessors, (7), 4 states have call successors, (7) Word has length 65 [2022-07-22 20:46:43,676 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-22 20:46:43,680 INFO L225 Difference]: With dead ends: 1231 [2022-07-22 20:46:43,680 INFO L226 Difference]: Without dead ends: 1037 [2022-07-22 20:46:43,681 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 341 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=257, Invalid=1075, Unknown=0, NotChecked=0, Total=1332 [2022-07-22 20:46:43,681 INFO L413 NwaCegarLoop]: 437 mSDtfsCounter, 1873 mSDsluCounter, 1260 mSDsCounter, 0 mSdLazyCounter, 1411 mSolverCounterSat, 532 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1889 SdHoareTripleChecker+Valid, 1697 SdHoareTripleChecker+Invalid, 1943 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 532 IncrementalHoareTripleChecker+Valid, 1411 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2022-07-22 20:46:43,682 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1889 Valid, 1697 Invalid, 1943 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [532 Valid, 1411 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2022-07-22 20:46:43,683 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1037 states. [2022-07-22 20:46:43,711 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1037 to 912. [2022-07-22 20:46:43,713 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 912 states, 725 states have (on average 1.3655172413793104) internal successors, (990), 740 states have internal predecessors, (990), 100 states have call successors, (100), 75 states have call predecessors, (100), 85 states have return successors, (114), 98 states have call predecessors, (114), 96 states have call successors, (114) [2022-07-22 20:46:43,715 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 912 states to 912 states and 1204 transitions. [2022-07-22 20:46:43,715 INFO L78 Accepts]: Start accepts. Automaton has 912 states and 1204 transitions. Word has length 65 [2022-07-22 20:46:43,716 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-22 20:46:43,716 INFO L495 AbstractCegarLoop]: Abstraction has 912 states and 1204 transitions. [2022-07-22 20:46:43,716 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 5.0) internal successors, (50), 7 states have internal predecessors, (50), 4 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 4 states have call predecessors, (7), 4 states have call successors, (7) [2022-07-22 20:46:43,716 INFO L276 IsEmpty]: Start isEmpty. Operand 912 states and 1204 transitions. [2022-07-22 20:46:43,717 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2022-07-22 20:46:43,717 INFO L187 NwaCegarLoop]: Found error trace [2022-07-22 20:46:43,717 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] [2022-07-22 20:46:43,717 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-07-22 20:46:43,718 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-22 20:46:43,718 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 20:46:43,718 INFO L85 PathProgramCache]: Analyzing trace with hash 1071665642, now seen corresponding path program 1 times [2022-07-22 20:46:43,718 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 20:46:43,718 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1170586876] [2022-07-22 20:46:43,718 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 20:46:43,718 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 20:46:43,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 20:46:43,736 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-07-22 20:46:43,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 20:46:43,744 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-07-22 20:46:43,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 20:46:43,750 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-07-22 20:46:43,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 20:46:43,777 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-22 20:46:43,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 20:46:43,782 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-22 20:46:43,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 20:46:43,804 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2022-07-22 20:46:43,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 20:46:43,809 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2022-07-22 20:46:43,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 20:46:43,812 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-22 20:46:43,812 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-22 20:46:43,812 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1170586876] [2022-07-22 20:46:43,813 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1170586876] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-22 20:46:43,813 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-22 20:46:43,813 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-07-22 20:46:43,814 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1021930361] [2022-07-22 20:46:43,814 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-22 20:46:43,814 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-07-22 20:46:43,814 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-22 20:46:43,815 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-07-22 20:46:43,815 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2022-07-22 20:46:43,815 INFO L87 Difference]: Start difference. First operand 912 states and 1204 transitions. Second operand has 9 states, 9 states have (on average 5.555555555555555) internal successors, (50), 5 states have internal predecessors, (50), 2 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 2 states have call successors, (7) [2022-07-22 20:46:44,291 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-22 20:46:44,291 INFO L93 Difference]: Finished difference Result 1793 states and 2347 transitions. [2022-07-22 20:46:44,291 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-07-22 20:46:44,291 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 5.555555555555555) internal successors, (50), 5 states have internal predecessors, (50), 2 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 2 states have call successors, (7) Word has length 65 [2022-07-22 20:46:44,292 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-22 20:46:44,295 INFO L225 Difference]: With dead ends: 1793 [2022-07-22 20:46:44,295 INFO L226 Difference]: Without dead ends: 1024 [2022-07-22 20:46:44,297 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=72, Invalid=200, Unknown=0, NotChecked=0, Total=272 [2022-07-22 20:46:44,297 INFO L413 NwaCegarLoop]: 312 mSDtfsCounter, 372 mSDsluCounter, 990 mSDsCounter, 0 mSdLazyCounter, 758 mSolverCounterSat, 121 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 374 SdHoareTripleChecker+Valid, 1302 SdHoareTripleChecker+Invalid, 879 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 121 IncrementalHoareTripleChecker+Valid, 758 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-07-22 20:46:44,298 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [374 Valid, 1302 Invalid, 879 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [121 Valid, 758 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-07-22 20:46:44,299 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1024 states. [2022-07-22 20:46:44,357 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1024 to 932. [2022-07-22 20:46:44,359 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 932 states, 741 states have (on average 1.3508771929824561) internal successors, (1001), 756 states have internal predecessors, (1001), 100 states have call successors, (100), 75 states have call predecessors, (100), 89 states have return successors, (118), 102 states have call predecessors, (118), 96 states have call successors, (118) [2022-07-22 20:46:44,362 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 932 states to 932 states and 1219 transitions. [2022-07-22 20:46:44,362 INFO L78 Accepts]: Start accepts. Automaton has 932 states and 1219 transitions. Word has length 65 [2022-07-22 20:46:44,362 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-22 20:46:44,362 INFO L495 AbstractCegarLoop]: Abstraction has 932 states and 1219 transitions. [2022-07-22 20:46:44,362 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 5.555555555555555) internal successors, (50), 5 states have internal predecessors, (50), 2 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 2 states have call successors, (7) [2022-07-22 20:46:44,362 INFO L276 IsEmpty]: Start isEmpty. Operand 932 states and 1219 transitions. [2022-07-22 20:46:44,363 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2022-07-22 20:46:44,363 INFO L187 NwaCegarLoop]: Found error trace [2022-07-22 20:46:44,363 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] [2022-07-22 20:46:44,363 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-07-22 20:46:44,363 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-22 20:46:44,364 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 20:46:44,364 INFO L85 PathProgramCache]: Analyzing trace with hash -1837098260, now seen corresponding path program 1 times [2022-07-22 20:46:44,364 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 20:46:44,364 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [509703911] [2022-07-22 20:46:44,364 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 20:46:44,364 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 20:46:44,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 20:46:44,387 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-07-22 20:46:44,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 20:46:44,397 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-07-22 20:46:44,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 20:46:44,407 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-07-22 20:46:44,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 20:46:44,414 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-22 20:46:44,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 20:46:44,416 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-22 20:46:44,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 20:46:44,427 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2022-07-22 20:46:44,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 20:46:44,444 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2022-07-22 20:46:44,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 20:46:44,450 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-22 20:46:44,450 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-22 20:46:44,450 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [509703911] [2022-07-22 20:46:44,450 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [509703911] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-22 20:46:44,451 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-22 20:46:44,451 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-07-22 20:46:44,451 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [275174813] [2022-07-22 20:46:44,451 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-22 20:46:44,455 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-07-22 20:46:44,456 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-22 20:46:44,456 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-07-22 20:46:44,456 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2022-07-22 20:46:44,456 INFO L87 Difference]: Start difference. First operand 932 states and 1219 transitions. Second operand has 8 states, 8 states have (on average 6.25) internal successors, (50), 6 states have internal predecessors, (50), 3 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2022-07-22 20:46:45,024 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-22 20:46:45,024 INFO L93 Difference]: Finished difference Result 2500 states and 3166 transitions. [2022-07-22 20:46:45,024 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-07-22 20:46:45,025 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 6.25) internal successors, (50), 6 states have internal predecessors, (50), 3 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) Word has length 65 [2022-07-22 20:46:45,025 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-22 20:46:45,031 INFO L225 Difference]: With dead ends: 2500 [2022-07-22 20:46:45,031 INFO L226 Difference]: Without dead ends: 1712 [2022-07-22 20:46:45,054 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 57 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=95, Invalid=247, Unknown=0, NotChecked=0, Total=342 [2022-07-22 20:46:45,055 INFO L413 NwaCegarLoop]: 334 mSDtfsCounter, 650 mSDsluCounter, 811 mSDsCounter, 0 mSdLazyCounter, 802 mSolverCounterSat, 133 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 669 SdHoareTripleChecker+Valid, 1145 SdHoareTripleChecker+Invalid, 935 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 133 IncrementalHoareTripleChecker+Valid, 802 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-07-22 20:46:45,056 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [669 Valid, 1145 Invalid, 935 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [133 Valid, 802 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-07-22 20:46:45,057 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1712 states. [2022-07-22 20:46:45,097 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1712 to 1380. [2022-07-22 20:46:45,099 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1380 states, 1094 states have (on average 1.3254113345521024) internal successors, (1450), 1118 states have internal predecessors, (1450), 146 states have call successors, (146), 114 states have call predecessors, (146), 138 states have return successors, (190), 150 states have call predecessors, (190), 142 states have call successors, (190) [2022-07-22 20:46:45,102 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1380 states to 1380 states and 1786 transitions. [2022-07-22 20:46:45,103 INFO L78 Accepts]: Start accepts. Automaton has 1380 states and 1786 transitions. Word has length 65 [2022-07-22 20:46:45,103 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-22 20:46:45,103 INFO L495 AbstractCegarLoop]: Abstraction has 1380 states and 1786 transitions. [2022-07-22 20:46:45,103 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 6.25) internal successors, (50), 6 states have internal predecessors, (50), 3 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2022-07-22 20:46:45,104 INFO L276 IsEmpty]: Start isEmpty. Operand 1380 states and 1786 transitions. [2022-07-22 20:46:45,104 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2022-07-22 20:46:45,104 INFO L187 NwaCegarLoop]: Found error trace [2022-07-22 20:46:45,105 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] [2022-07-22 20:46:45,105 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-07-22 20:46:45,105 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-22 20:46:45,105 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 20:46:45,105 INFO L85 PathProgramCache]: Analyzing trace with hash -1971111766, now seen corresponding path program 1 times [2022-07-22 20:46:45,106 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 20:46:45,106 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1193013574] [2022-07-22 20:46:45,106 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 20:46:45,106 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 20:46:45,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 20:46:45,127 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-07-22 20:46:45,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 20:46:45,133 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-07-22 20:46:45,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 20:46:45,139 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-07-22 20:46:45,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 20:46:45,148 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-22 20:46:45,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 20:46:45,150 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-22 20:46:45,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 20:46:45,151 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2022-07-22 20:46:45,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 20:46:45,153 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2022-07-22 20:46:45,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 20:46:45,156 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-22 20:46:45,156 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-22 20:46:45,156 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1193013574] [2022-07-22 20:46:45,156 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1193013574] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-22 20:46:45,156 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-22 20:46:45,157 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-07-22 20:46:45,157 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [680712310] [2022-07-22 20:46:45,157 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-22 20:46:45,157 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-07-22 20:46:45,157 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-22 20:46:45,158 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-07-22 20:46:45,158 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2022-07-22 20:46:45,158 INFO L87 Difference]: Start difference. First operand 1380 states and 1786 transitions. Second operand has 7 states, 7 states have (on average 7.142857142857143) internal successors, (50), 4 states have internal predecessors, (50), 4 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2022-07-22 20:46:45,480 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-22 20:46:45,480 INFO L93 Difference]: Finished difference Result 3851 states and 4925 transitions. [2022-07-22 20:46:45,481 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-07-22 20:46:45,481 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 7.142857142857143) internal successors, (50), 4 states have internal predecessors, (50), 4 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) Word has length 65 [2022-07-22 20:46:45,481 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-22 20:46:45,489 INFO L225 Difference]: With dead ends: 3851 [2022-07-22 20:46:45,489 INFO L226 Difference]: Without dead ends: 2617 [2022-07-22 20:46:45,492 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=71, Invalid=139, Unknown=0, NotChecked=0, Total=210 [2022-07-22 20:46:45,495 INFO L413 NwaCegarLoop]: 299 mSDtfsCounter, 772 mSDsluCounter, 481 mSDsCounter, 0 mSdLazyCounter, 273 mSolverCounterSat, 167 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 795 SdHoareTripleChecker+Valid, 780 SdHoareTripleChecker+Invalid, 440 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 167 IncrementalHoareTripleChecker+Valid, 273 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-07-22 20:46:45,495 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [795 Valid, 780 Invalid, 440 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [167 Valid, 273 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-07-22 20:46:45,497 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2617 states. [2022-07-22 20:46:45,575 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2617 to 2509. [2022-07-22 20:46:45,578 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2509 states, 1963 states have (on average 1.2745797249108508) internal successors, (2502), 2008 states have internal predecessors, (2502), 270 states have call successors, (270), 220 states have call predecessors, (270), 274 states have return successors, (398), 283 states have call predecessors, (398), 266 states have call successors, (398) [2022-07-22 20:46:45,586 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2509 states to 2509 states and 3170 transitions. [2022-07-22 20:46:45,587 INFO L78 Accepts]: Start accepts. Automaton has 2509 states and 3170 transitions. Word has length 65 [2022-07-22 20:46:45,587 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-22 20:46:45,587 INFO L495 AbstractCegarLoop]: Abstraction has 2509 states and 3170 transitions. [2022-07-22 20:46:45,587 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 7.142857142857143) internal successors, (50), 4 states have internal predecessors, (50), 4 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2022-07-22 20:46:45,587 INFO L276 IsEmpty]: Start isEmpty. Operand 2509 states and 3170 transitions. [2022-07-22 20:46:45,590 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2022-07-22 20:46:45,590 INFO L187 NwaCegarLoop]: Found error trace [2022-07-22 20:46:45,590 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] [2022-07-22 20:46:45,590 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-07-22 20:46:45,591 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-22 20:46:45,591 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 20:46:45,591 INFO L85 PathProgramCache]: Analyzing trace with hash -291684510, now seen corresponding path program 1 times [2022-07-22 20:46:45,591 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 20:46:45,591 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [927490259] [2022-07-22 20:46:45,591 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 20:46:45,591 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 20:46:45,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 20:46:45,620 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-07-22 20:46:45,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 20:46:45,626 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-07-22 20:46:45,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 20:46:45,634 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-07-22 20:46:45,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 20:46:45,638 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-22 20:46:45,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 20:46:45,641 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-22 20:46:45,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 20:46:45,642 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2022-07-22 20:46:45,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 20:46:45,647 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2022-07-22 20:46:45,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 20:46:45,649 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-22 20:46:45,649 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-22 20:46:45,649 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [927490259] [2022-07-22 20:46:45,649 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [927490259] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-22 20:46:45,649 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-22 20:46:45,649 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-22 20:46:45,650 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [113523294] [2022-07-22 20:46:45,650 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-22 20:46:45,650 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-22 20:46:45,650 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-22 20:46:45,652 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-22 20:46:45,652 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-07-22 20:46:45,652 INFO L87 Difference]: Start difference. First operand 2509 states and 3170 transitions. Second operand has 6 states, 6 states have (on average 8.5) internal successors, (51), 3 states have internal predecessors, (51), 3 states have call successors, (8), 5 states have call predecessors, (8), 1 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2022-07-22 20:46:46,073 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-22 20:46:46,073 INFO L93 Difference]: Finished difference Result 5831 states and 7344 transitions. [2022-07-22 20:46:46,073 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-07-22 20:46:46,073 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 8.5) internal successors, (51), 3 states have internal predecessors, (51), 3 states have call successors, (8), 5 states have call predecessors, (8), 1 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) Word has length 66 [2022-07-22 20:46:46,074 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-22 20:46:46,085 INFO L225 Difference]: With dead ends: 5831 [2022-07-22 20:46:46,086 INFO L226 Difference]: Without dead ends: 3468 [2022-07-22 20:46:46,091 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=39, Invalid=71, Unknown=0, NotChecked=0, Total=110 [2022-07-22 20:46:46,091 INFO L413 NwaCegarLoop]: 321 mSDtfsCounter, 421 mSDsluCounter, 583 mSDsCounter, 0 mSdLazyCounter, 353 mSolverCounterSat, 119 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 430 SdHoareTripleChecker+Valid, 904 SdHoareTripleChecker+Invalid, 472 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 119 IncrementalHoareTripleChecker+Valid, 353 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-07-22 20:46:46,092 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [430 Valid, 904 Invalid, 472 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [119 Valid, 353 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-07-22 20:46:46,094 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3468 states. [2022-07-22 20:46:46,182 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3468 to 3214. [2022-07-22 20:46:46,185 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3214 states, 2511 states have (on average 1.2652329749103943) internal successors, (3177), 2562 states have internal predecessors, (3177), 346 states have call successors, (346), 286 states have call predecessors, (346), 355 states have return successors, (494), 368 states have call predecessors, (494), 342 states have call successors, (494) [2022-07-22 20:46:46,193 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3214 states to 3214 states and 4017 transitions. [2022-07-22 20:46:46,194 INFO L78 Accepts]: Start accepts. Automaton has 3214 states and 4017 transitions. Word has length 66 [2022-07-22 20:46:46,194 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-22 20:46:46,195 INFO L495 AbstractCegarLoop]: Abstraction has 3214 states and 4017 transitions. [2022-07-22 20:46:46,195 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 8.5) internal successors, (51), 3 states have internal predecessors, (51), 3 states have call successors, (8), 5 states have call predecessors, (8), 1 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2022-07-22 20:46:46,195 INFO L276 IsEmpty]: Start isEmpty. Operand 3214 states and 4017 transitions. [2022-07-22 20:46:46,196 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2022-07-22 20:46:46,196 INFO L187 NwaCegarLoop]: Found error trace [2022-07-22 20:46:46,196 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] [2022-07-22 20:46:46,196 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-07-22 20:46:46,196 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-22 20:46:46,197 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 20:46:46,197 INFO L85 PathProgramCache]: Analyzing trace with hash 342944188, now seen corresponding path program 1 times [2022-07-22 20:46:46,197 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 20:46:46,197 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1209442002] [2022-07-22 20:46:46,197 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 20:46:46,197 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 20:46:46,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 20:46:46,211 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-07-22 20:46:46,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 20:46:46,218 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-07-22 20:46:46,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 20:46:46,224 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2022-07-22 20:46:46,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 20:46:46,227 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2022-07-22 20:46:46,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 20:46:46,229 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2022-07-22 20:46:46,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 20:46:46,231 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-22 20:46:46,231 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-22 20:46:46,231 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1209442002] [2022-07-22 20:46:46,231 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1209442002] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-22 20:46:46,231 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-22 20:46:46,232 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-07-22 20:46:46,232 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [425340289] [2022-07-22 20:46:46,232 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-22 20:46:46,232 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-07-22 20:46:46,232 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-22 20:46:46,233 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-22 20:46:46,233 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-07-22 20:46:46,233 INFO L87 Difference]: Start difference. First operand 3214 states and 4017 transitions. Second operand has 5 states, 5 states have (on average 11.6) internal successors, (58), 3 states have internal predecessors, (58), 2 states have call successors, (6), 4 states have call predecessors, (6), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-07-22 20:46:46,599 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-22 20:46:46,600 INFO L93 Difference]: Finished difference Result 3374 states and 4261 transitions. [2022-07-22 20:46:46,600 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-22 20:46:46,600 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 11.6) internal successors, (58), 3 states have internal predecessors, (58), 2 states have call successors, (6), 4 states have call predecessors, (6), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 69 [2022-07-22 20:46:46,600 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-22 20:46:46,611 INFO L225 Difference]: With dead ends: 3374 [2022-07-22 20:46:46,612 INFO L226 Difference]: Without dead ends: 3246 [2022-07-22 20:46:46,613 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2022-07-22 20:46:46,615 INFO L413 NwaCegarLoop]: 337 mSDtfsCounter, 396 mSDsluCounter, 321 mSDsCounter, 0 mSdLazyCounter, 280 mSolverCounterSat, 76 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 410 SdHoareTripleChecker+Valid, 658 SdHoareTripleChecker+Invalid, 356 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 76 IncrementalHoareTripleChecker+Valid, 280 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-07-22 20:46:46,615 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [410 Valid, 658 Invalid, 356 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [76 Valid, 280 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-07-22 20:46:46,618 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3246 states. [2022-07-22 20:46:46,726 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3246 to 3214. [2022-07-22 20:46:46,730 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3214 states, 2511 states have (on average 1.2648347272003186) internal successors, (3176), 2562 states have internal predecessors, (3176), 346 states have call successors, (346), 286 states have call predecessors, (346), 355 states have return successors, (494), 368 states have call predecessors, (494), 342 states have call successors, (494) [2022-07-22 20:46:46,738 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3214 states to 3214 states and 4016 transitions. [2022-07-22 20:46:46,739 INFO L78 Accepts]: Start accepts. Automaton has 3214 states and 4016 transitions. Word has length 69 [2022-07-22 20:46:46,739 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-22 20:46:46,739 INFO L495 AbstractCegarLoop]: Abstraction has 3214 states and 4016 transitions. [2022-07-22 20:46:46,739 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 11.6) internal successors, (58), 3 states have internal predecessors, (58), 2 states have call successors, (6), 4 states have call predecessors, (6), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-07-22 20:46:46,739 INFO L276 IsEmpty]: Start isEmpty. Operand 3214 states and 4016 transitions. [2022-07-22 20:46:46,741 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2022-07-22 20:46:46,741 INFO L187 NwaCegarLoop]: Found error trace [2022-07-22 20:46:46,741 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] [2022-07-22 20:46:46,742 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-07-22 20:46:46,742 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-22 20:46:46,742 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 20:46:46,742 INFO L85 PathProgramCache]: Analyzing trace with hash -1618630470, now seen corresponding path program 1 times [2022-07-22 20:46:46,742 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 20:46:46,742 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2066405091] [2022-07-22 20:46:46,743 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 20:46:46,743 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 20:46:46,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 20:46:46,758 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-07-22 20:46:46,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 20:46:46,767 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-07-22 20:46:46,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 20:46:46,782 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2022-07-22 20:46:46,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 20:46:46,789 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2022-07-22 20:46:46,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 20:46:46,791 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2022-07-22 20:46:46,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 20:46:46,792 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-22 20:46:46,792 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-22 20:46:46,793 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2066405091] [2022-07-22 20:46:46,793 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2066405091] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-22 20:46:46,793 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-22 20:46:46,793 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-22 20:46:46,793 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1331553800] [2022-07-22 20:46:46,793 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-22 20:46:46,794 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-22 20:46:46,794 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-22 20:46:46,794 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-22 20:46:46,794 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-22 20:46:46,794 INFO L87 Difference]: Start difference. First operand 3214 states and 4016 transitions. Second operand has 6 states, 6 states have (on average 9.666666666666666) internal successors, (58), 4 states have internal predecessors, (58), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-07-22 20:46:47,366 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-22 20:46:47,366 INFO L93 Difference]: Finished difference Result 3524 states and 4487 transitions. [2022-07-22 20:46:47,366 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-07-22 20:46:47,366 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 9.666666666666666) internal successors, (58), 4 states have internal predecessors, (58), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 69 [2022-07-22 20:46:47,367 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-22 20:46:47,377 INFO L225 Difference]: With dead ends: 3524 [2022-07-22 20:46:47,377 INFO L226 Difference]: Without dead ends: 3400 [2022-07-22 20:46:47,378 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=33, Invalid=77, Unknown=0, NotChecked=0, Total=110 [2022-07-22 20:46:47,379 INFO L413 NwaCegarLoop]: 339 mSDtfsCounter, 637 mSDsluCounter, 514 mSDsCounter, 0 mSdLazyCounter, 668 mSolverCounterSat, 120 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 656 SdHoareTripleChecker+Valid, 853 SdHoareTripleChecker+Invalid, 788 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 120 IncrementalHoareTripleChecker+Valid, 668 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-07-22 20:46:47,380 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [656 Valid, 853 Invalid, 788 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [120 Valid, 668 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-07-22 20:46:47,382 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3400 states. [2022-07-22 20:46:47,485 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3400 to 3335. [2022-07-22 20:46:47,491 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3335 states, 2614 states have (on average 1.2746748278500382) internal successors, (3332), 2666 states have internal predecessors, (3332), 357 states have call successors, (357), 292 states have call predecessors, (357), 362 states have return successors, (508), 379 states have call predecessors, (508), 353 states have call successors, (508) [2022-07-22 20:46:47,498 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3335 states to 3335 states and 4197 transitions. [2022-07-22 20:46:47,498 INFO L78 Accepts]: Start accepts. Automaton has 3335 states and 4197 transitions. Word has length 69 [2022-07-22 20:46:47,499 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-22 20:46:47,499 INFO L495 AbstractCegarLoop]: Abstraction has 3335 states and 4197 transitions. [2022-07-22 20:46:47,499 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 9.666666666666666) internal successors, (58), 4 states have internal predecessors, (58), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-07-22 20:46:47,499 INFO L276 IsEmpty]: Start isEmpty. Operand 3335 states and 4197 transitions. [2022-07-22 20:46:47,500 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2022-07-22 20:46:47,500 INFO L187 NwaCegarLoop]: Found error trace [2022-07-22 20:46:47,500 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] [2022-07-22 20:46:47,500 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-07-22 20:46:47,501 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-22 20:46:47,501 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 20:46:47,502 INFO L85 PathProgramCache]: Analyzing trace with hash -1515916106, now seen corresponding path program 1 times [2022-07-22 20:46:47,502 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 20:46:47,502 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1282707306] [2022-07-22 20:46:47,502 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 20:46:47,502 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 20:46:47,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 20:46:47,515 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-07-22 20:46:47,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 20:46:47,523 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-07-22 20:46:47,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 20:46:47,539 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2022-07-22 20:46:47,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 20:46:47,544 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2022-07-22 20:46:47,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 20:46:47,546 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2022-07-22 20:46:47,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 20:46:47,548 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-22 20:46:47,548 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-22 20:46:47,548 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1282707306] [2022-07-22 20:46:47,549 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1282707306] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-22 20:46:47,549 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-22 20:46:47,549 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-07-22 20:46:47,549 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1931433858] [2022-07-22 20:46:47,549 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-22 20:46:47,549 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-07-22 20:46:47,549 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-22 20:46:47,550 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-07-22 20:46:47,550 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-07-22 20:46:47,550 INFO L87 Difference]: Start difference. First operand 3335 states and 4197 transitions. Second operand has 7 states, 7 states have (on average 8.285714285714286) internal successors, (58), 5 states have internal predecessors, (58), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-07-22 20:46:48,289 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-22 20:46:48,289 INFO L93 Difference]: Finished difference Result 3797 states and 4891 transitions. [2022-07-22 20:46:48,290 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-07-22 20:46:48,290 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 8.285714285714286) internal successors, (58), 5 states have internal predecessors, (58), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 69 [2022-07-22 20:46:48,290 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-22 20:46:48,302 INFO L225 Difference]: With dead ends: 3797 [2022-07-22 20:46:48,303 INFO L226 Difference]: Without dead ends: 3552 [2022-07-22 20:46:48,305 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=66, Invalid=174, Unknown=0, NotChecked=0, Total=240 [2022-07-22 20:46:48,306 INFO L413 NwaCegarLoop]: 430 mSDtfsCounter, 629 mSDsluCounter, 891 mSDsCounter, 0 mSdLazyCounter, 1056 mSolverCounterSat, 100 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 648 SdHoareTripleChecker+Valid, 1321 SdHoareTripleChecker+Invalid, 1156 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 100 IncrementalHoareTripleChecker+Valid, 1056 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-07-22 20:46:48,306 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [648 Valid, 1321 Invalid, 1156 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [100 Valid, 1056 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-07-22 20:46:48,309 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3552 states. [2022-07-22 20:46:48,438 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3552 to 3449. [2022-07-22 20:46:48,443 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3449 states, 2710 states have (on average 1.2819188191881918) internal successors, (3474), 2763 states have internal predecessors, (3474), 368 states have call successors, (368), 298 states have call predecessors, (368), 369 states have return successors, (521), 391 states have call predecessors, (521), 364 states have call successors, (521) [2022-07-22 20:46:48,449 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3449 states to 3449 states and 4363 transitions. [2022-07-22 20:46:48,450 INFO L78 Accepts]: Start accepts. Automaton has 3449 states and 4363 transitions. Word has length 69 [2022-07-22 20:46:48,450 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-22 20:46:48,450 INFO L495 AbstractCegarLoop]: Abstraction has 3449 states and 4363 transitions. [2022-07-22 20:46:48,451 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 8.285714285714286) internal successors, (58), 5 states have internal predecessors, (58), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-07-22 20:46:48,451 INFO L276 IsEmpty]: Start isEmpty. Operand 3449 states and 4363 transitions. [2022-07-22 20:46:48,451 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2022-07-22 20:46:48,452 INFO L187 NwaCegarLoop]: Found error trace [2022-07-22 20:46:48,452 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] [2022-07-22 20:46:48,452 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-07-22 20:46:48,452 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-22 20:46:48,452 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 20:46:48,452 INFO L85 PathProgramCache]: Analyzing trace with hash -129130696, now seen corresponding path program 1 times [2022-07-22 20:46:48,453 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 20:46:48,453 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1055970956] [2022-07-22 20:46:48,453 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 20:46:48,453 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 20:46:48,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 20:46:48,478 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-07-22 20:46:48,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 20:46:48,487 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-07-22 20:46:48,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 20:46:48,509 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2022-07-22 20:46:48,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 20:46:48,513 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2022-07-22 20:46:48,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 20:46:48,516 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2022-07-22 20:46:48,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 20:46:48,518 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-22 20:46:48,519 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-22 20:46:48,519 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1055970956] [2022-07-22 20:46:48,519 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1055970956] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-22 20:46:48,519 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-22 20:46:48,519 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-07-22 20:46:48,519 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [698181447] [2022-07-22 20:46:48,519 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-22 20:46:48,520 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-07-22 20:46:48,520 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-22 20:46:48,520 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-07-22 20:46:48,520 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2022-07-22 20:46:48,520 INFO L87 Difference]: Start difference. First operand 3449 states and 4363 transitions. Second operand has 7 states, 7 states have (on average 8.285714285714286) internal successors, (58), 5 states have internal predecessors, (58), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-07-22 20:46:48,913 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-22 20:46:48,913 INFO L93 Difference]: Finished difference Result 3907 states and 5057 transitions. [2022-07-22 20:46:48,914 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-22 20:46:48,914 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 8.285714285714286) internal successors, (58), 5 states have internal predecessors, (58), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 69 [2022-07-22 20:46:48,914 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-22 20:46:48,926 INFO L225 Difference]: With dead ends: 3907 [2022-07-22 20:46:48,926 INFO L226 Difference]: Without dead ends: 3548 [2022-07-22 20:46:48,928 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=36, Invalid=74, Unknown=0, NotChecked=0, Total=110 [2022-07-22 20:46:48,928 INFO L413 NwaCegarLoop]: 289 mSDtfsCounter, 637 mSDsluCounter, 414 mSDsCounter, 0 mSdLazyCounter, 458 mSolverCounterSat, 142 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 657 SdHoareTripleChecker+Valid, 703 SdHoareTripleChecker+Invalid, 600 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 142 IncrementalHoareTripleChecker+Valid, 458 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-07-22 20:46:48,929 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [657 Valid, 703 Invalid, 600 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [142 Valid, 458 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-07-22 20:46:48,931 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3548 states. [2022-07-22 20:46:49,031 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3548 to 3449. [2022-07-22 20:46:49,045 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3449 states, 2710 states have (on average 1.2808118081180813) internal successors, (3471), 2763 states have internal predecessors, (3471), 368 states have call successors, (368), 298 states have call predecessors, (368), 369 states have return successors, (521), 391 states have call predecessors, (521), 364 states have call successors, (521) [2022-07-22 20:46:49,052 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3449 states to 3449 states and 4360 transitions. [2022-07-22 20:46:49,053 INFO L78 Accepts]: Start accepts. Automaton has 3449 states and 4360 transitions. Word has length 69 [2022-07-22 20:46:49,054 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-22 20:46:49,054 INFO L495 AbstractCegarLoop]: Abstraction has 3449 states and 4360 transitions. [2022-07-22 20:46:49,055 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 8.285714285714286) internal successors, (58), 5 states have internal predecessors, (58), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-07-22 20:46:49,055 INFO L276 IsEmpty]: Start isEmpty. Operand 3449 states and 4360 transitions. [2022-07-22 20:46:49,056 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2022-07-22 20:46:49,056 INFO L187 NwaCegarLoop]: Found error trace [2022-07-22 20:46:49,056 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] [2022-07-22 20:46:49,056 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-07-22 20:46:49,056 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-22 20:46:49,056 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 20:46:49,056 INFO L85 PathProgramCache]: Analyzing trace with hash 314769978, now seen corresponding path program 1 times [2022-07-22 20:46:49,056 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 20:46:49,056 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [358695080] [2022-07-22 20:46:49,056 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 20:46:49,057 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 20:46:49,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 20:46:49,069 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-07-22 20:46:49,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 20:46:49,077 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-07-22 20:46:49,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 20:46:49,095 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2022-07-22 20:46:49,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 20:46:49,098 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2022-07-22 20:46:49,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 20:46:49,100 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2022-07-22 20:46:49,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 20:46:49,108 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-22 20:46:49,108 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-22 20:46:49,108 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [358695080] [2022-07-22 20:46:49,108 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [358695080] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-22 20:46:49,108 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-22 20:46:49,108 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-07-22 20:46:49,108 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [75800420] [2022-07-22 20:46:49,108 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-22 20:46:49,109 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-07-22 20:46:49,109 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-22 20:46:49,109 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-07-22 20:46:49,109 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-07-22 20:46:49,109 INFO L87 Difference]: Start difference. First operand 3449 states and 4360 transitions. Second operand has 7 states, 7 states have (on average 8.285714285714286) internal successors, (58), 5 states have internal predecessors, (58), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-07-22 20:46:49,846 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-22 20:46:49,846 INFO L93 Difference]: Finished difference Result 4243 states and 5535 transitions. [2022-07-22 20:46:49,847 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-07-22 20:46:49,847 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 8.285714285714286) internal successors, (58), 5 states have internal predecessors, (58), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 69 [2022-07-22 20:46:49,847 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-22 20:46:49,866 INFO L225 Difference]: With dead ends: 4243 [2022-07-22 20:46:49,866 INFO L226 Difference]: Without dead ends: 3884 [2022-07-22 20:46:49,868 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=73, Invalid=199, Unknown=0, NotChecked=0, Total=272 [2022-07-22 20:46:49,869 INFO L413 NwaCegarLoop]: 409 mSDtfsCounter, 672 mSDsluCounter, 880 mSDsCounter, 0 mSdLazyCounter, 1018 mSolverCounterSat, 107 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 694 SdHoareTripleChecker+Valid, 1289 SdHoareTripleChecker+Invalid, 1125 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 107 IncrementalHoareTripleChecker+Valid, 1018 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-07-22 20:46:49,869 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [694 Valid, 1289 Invalid, 1125 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [107 Valid, 1018 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-07-22 20:46:49,873 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3884 states. [2022-07-22 20:46:50,007 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3884 to 3658. [2022-07-22 20:46:50,011 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3658 states, 2885 states have (on average 1.2908145580589254) internal successors, (3724), 2940 states have internal predecessors, (3724), 388 states have call successors, (388), 310 states have call predecessors, (388), 383 states have return successors, (549), 413 states have call predecessors, (549), 384 states have call successors, (549) [2022-07-22 20:46:50,019 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3658 states to 3658 states and 4661 transitions. [2022-07-22 20:46:50,019 INFO L78 Accepts]: Start accepts. Automaton has 3658 states and 4661 transitions. Word has length 69 [2022-07-22 20:46:50,020 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-22 20:46:50,020 INFO L495 AbstractCegarLoop]: Abstraction has 3658 states and 4661 transitions. [2022-07-22 20:46:50,020 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 8.285714285714286) internal successors, (58), 5 states have internal predecessors, (58), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-07-22 20:46:50,020 INFO L276 IsEmpty]: Start isEmpty. Operand 3658 states and 4661 transitions. [2022-07-22 20:46:50,021 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2022-07-22 20:46:50,021 INFO L187 NwaCegarLoop]: Found error trace [2022-07-22 20:46:50,021 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] [2022-07-22 20:46:50,021 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-07-22 20:46:50,021 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-22 20:46:50,022 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 20:46:50,022 INFO L85 PathProgramCache]: Analyzing trace with hash 1853110008, now seen corresponding path program 1 times [2022-07-22 20:46:50,022 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 20:46:50,022 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [530140227] [2022-07-22 20:46:50,022 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 20:46:50,022 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 20:46:50,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 20:46:50,038 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-07-22 20:46:50,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 20:46:50,045 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-07-22 20:46:50,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 20:46:50,062 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2022-07-22 20:46:50,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 20:46:50,066 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2022-07-22 20:46:50,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 20:46:50,068 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2022-07-22 20:46:50,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 20:46:50,069 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-22 20:46:50,069 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-22 20:46:50,069 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [530140227] [2022-07-22 20:46:50,070 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [530140227] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-22 20:46:50,070 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-22 20:46:50,070 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-07-22 20:46:50,070 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1878621173] [2022-07-22 20:46:50,070 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-22 20:46:50,070 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-07-22 20:46:50,070 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-22 20:46:50,070 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-07-22 20:46:50,070 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-07-22 20:46:50,071 INFO L87 Difference]: Start difference. First operand 3658 states and 4661 transitions. Second operand has 7 states, 7 states have (on average 8.285714285714286) internal successors, (58), 5 states have internal predecessors, (58), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-07-22 20:46:50,897 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-22 20:46:50,898 INFO L93 Difference]: Finished difference Result 4946 states and 6542 transitions. [2022-07-22 20:46:50,898 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-07-22 20:46:50,898 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 8.285714285714286) internal successors, (58), 5 states have internal predecessors, (58), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 69 [2022-07-22 20:46:50,899 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-22 20:46:50,909 INFO L225 Difference]: With dead ends: 4946 [2022-07-22 20:46:50,909 INFO L226 Difference]: Without dead ends: 4378 [2022-07-22 20:46:50,911 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=73, Invalid=199, Unknown=0, NotChecked=0, Total=272 [2022-07-22 20:46:50,911 INFO L413 NwaCegarLoop]: 418 mSDtfsCounter, 618 mSDsluCounter, 883 mSDsCounter, 0 mSdLazyCounter, 1072 mSolverCounterSat, 102 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 636 SdHoareTripleChecker+Valid, 1301 SdHoareTripleChecker+Invalid, 1174 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 102 IncrementalHoareTripleChecker+Valid, 1072 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-07-22 20:46:50,912 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [636 Valid, 1301 Invalid, 1174 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [102 Valid, 1072 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-07-22 20:46:50,915 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4378 states. [2022-07-22 20:46:51,045 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4378 to 4089. [2022-07-22 20:46:51,049 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4089 states, 3250 states have (on average 1.3101538461538462) internal successors, (4258), 3309 states have internal predecessors, (4258), 426 states have call successors, (426), 334 states have call predecessors, (426), 411 states have return successors, (609), 455 states have call predecessors, (609), 422 states have call successors, (609) [2022-07-22 20:46:51,060 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4089 states to 4089 states and 5293 transitions. [2022-07-22 20:46:51,061 INFO L78 Accepts]: Start accepts. Automaton has 4089 states and 5293 transitions. Word has length 69 [2022-07-22 20:46:51,061 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-22 20:46:51,061 INFO L495 AbstractCegarLoop]: Abstraction has 4089 states and 5293 transitions. [2022-07-22 20:46:51,062 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 8.285714285714286) internal successors, (58), 5 states have internal predecessors, (58), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-07-22 20:46:51,062 INFO L276 IsEmpty]: Start isEmpty. Operand 4089 states and 5293 transitions. [2022-07-22 20:46:51,064 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2022-07-22 20:46:51,064 INFO L187 NwaCegarLoop]: Found error trace [2022-07-22 20:46:51,064 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] [2022-07-22 20:46:51,064 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2022-07-22 20:46:51,064 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-22 20:46:51,065 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 20:46:51,065 INFO L85 PathProgramCache]: Analyzing trace with hash -175476102, now seen corresponding path program 1 times [2022-07-22 20:46:51,065 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 20:46:51,065 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [847332571] [2022-07-22 20:46:51,065 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 20:46:51,065 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 20:46:51,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 20:46:51,081 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-07-22 20:46:51,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 20:46:51,088 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-07-22 20:46:51,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 20:46:51,093 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2022-07-22 20:46:51,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 20:46:51,117 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2022-07-22 20:46:51,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 20:46:51,120 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2022-07-22 20:46:51,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 20:46:51,122 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-22 20:46:51,122 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-22 20:46:51,122 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [847332571] [2022-07-22 20:46:51,122 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [847332571] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-22 20:46:51,122 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-22 20:46:51,122 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-07-22 20:46:51,122 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1864103330] [2022-07-22 20:46:51,123 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-22 20:46:51,123 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-07-22 20:46:51,123 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-22 20:46:51,123 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-07-22 20:46:51,123 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-07-22 20:46:51,124 INFO L87 Difference]: Start difference. First operand 4089 states and 5293 transitions. Second operand has 7 states, 7 states have (on average 8.285714285714286) internal successors, (58), 5 states have internal predecessors, (58), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-07-22 20:46:51,780 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-22 20:46:51,780 INFO L93 Difference]: Finished difference Result 5625 states and 7572 transitions. [2022-07-22 20:46:51,780 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-07-22 20:46:51,780 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 8.285714285714286) internal successors, (58), 5 states have internal predecessors, (58), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 69 [2022-07-22 20:46:51,780 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-22 20:46:51,798 INFO L225 Difference]: With dead ends: 5625 [2022-07-22 20:46:51,798 INFO L226 Difference]: Without dead ends: 4627 [2022-07-22 20:46:51,803 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=60, Invalid=122, Unknown=0, NotChecked=0, Total=182 [2022-07-22 20:46:51,803 INFO L413 NwaCegarLoop]: 314 mSDtfsCounter, 365 mSDsluCounter, 784 mSDsCounter, 0 mSdLazyCounter, 777 mSolverCounterSat, 76 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 365 SdHoareTripleChecker+Valid, 1098 SdHoareTripleChecker+Invalid, 853 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 76 IncrementalHoareTripleChecker+Valid, 777 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-07-22 20:46:51,804 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [365 Valid, 1098 Invalid, 853 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [76 Valid, 777 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-07-22 20:46:51,807 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4627 states. [2022-07-22 20:46:51,986 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4627 to 4116. [2022-07-22 20:46:51,990 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4116 states, 3277 states have (on average 1.3075984131827891) internal successors, (4285), 3336 states have internal predecessors, (4285), 426 states have call successors, (426), 334 states have call predecessors, (426), 411 states have return successors, (609), 455 states have call predecessors, (609), 422 states have call successors, (609) [2022-07-22 20:46:51,998 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4116 states to 4116 states and 5320 transitions. [2022-07-22 20:46:51,999 INFO L78 Accepts]: Start accepts. Automaton has 4116 states and 5320 transitions. Word has length 69 [2022-07-22 20:46:51,999 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-22 20:46:51,999 INFO L495 AbstractCegarLoop]: Abstraction has 4116 states and 5320 transitions. [2022-07-22 20:46:51,999 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 8.285714285714286) internal successors, (58), 5 states have internal predecessors, (58), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-07-22 20:46:51,999 INFO L276 IsEmpty]: Start isEmpty. Operand 4116 states and 5320 transitions. [2022-07-22 20:46:52,001 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2022-07-22 20:46:52,002 INFO L187 NwaCegarLoop]: Found error trace [2022-07-22 20:46:52,002 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] [2022-07-22 20:46:52,002 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2022-07-22 20:46:52,003 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-22 20:46:52,003 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 20:46:52,003 INFO L85 PathProgramCache]: Analyzing trace with hash 72670392, now seen corresponding path program 1 times [2022-07-22 20:46:52,003 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 20:46:52,003 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1451919062] [2022-07-22 20:46:52,003 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 20:46:52,004 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 20:46:52,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 20:46:52,021 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-07-22 20:46:52,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 20:46:52,030 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-07-22 20:46:52,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 20:46:52,037 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2022-07-22 20:46:52,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 20:46:52,068 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2022-07-22 20:46:52,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 20:46:52,071 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2022-07-22 20:46:52,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 20:46:52,073 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-22 20:46:52,073 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-22 20:46:52,073 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1451919062] [2022-07-22 20:46:52,073 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1451919062] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-22 20:46:52,073 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-22 20:46:52,073 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-07-22 20:46:52,074 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2069678306] [2022-07-22 20:46:52,074 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-22 20:46:52,074 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-07-22 20:46:52,074 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-22 20:46:52,074 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-07-22 20:46:52,075 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2022-07-22 20:46:52,075 INFO L87 Difference]: Start difference. First operand 4116 states and 5320 transitions. Second operand has 7 states, 7 states have (on average 8.285714285714286) internal successors, (58), 5 states have internal predecessors, (58), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-07-22 20:46:53,213 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-22 20:46:53,213 INFO L93 Difference]: Finished difference Result 7610 states and 10576 transitions. [2022-07-22 20:46:53,213 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2022-07-22 20:46:53,214 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 8.285714285714286) internal successors, (58), 5 states have internal predecessors, (58), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 69 [2022-07-22 20:46:53,214 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-22 20:46:53,231 INFO L225 Difference]: With dead ends: 7610 [2022-07-22 20:46:53,231 INFO L226 Difference]: Without dead ends: 6585 [2022-07-22 20:46:53,236 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 52 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=87, Invalid=219, Unknown=0, NotChecked=0, Total=306 [2022-07-22 20:46:53,237 INFO L413 NwaCegarLoop]: 491 mSDtfsCounter, 1371 mSDsluCounter, 618 mSDsCounter, 0 mSdLazyCounter, 1038 mSolverCounterSat, 348 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1395 SdHoareTripleChecker+Valid, 1109 SdHoareTripleChecker+Invalid, 1386 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 348 IncrementalHoareTripleChecker+Valid, 1038 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2022-07-22 20:46:53,237 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1395 Valid, 1109 Invalid, 1386 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [348 Valid, 1038 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2022-07-22 20:46:53,242 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6585 states. [2022-07-22 20:46:53,490 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6585 to 6034. [2022-07-22 20:46:53,497 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6034 states, 4873 states have (on average 1.3435255489431561) internal successors, (6547), 4963 states have internal predecessors, (6547), 618 states have call successors, (618), 448 states have call predecessors, (618), 541 states have return successors, (918), 632 states have call predecessors, (918), 614 states have call successors, (918) [2022-07-22 20:46:53,509 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6034 states to 6034 states and 8083 transitions. [2022-07-22 20:46:53,510 INFO L78 Accepts]: Start accepts. Automaton has 6034 states and 8083 transitions. Word has length 69 [2022-07-22 20:46:53,510 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-22 20:46:53,510 INFO L495 AbstractCegarLoop]: Abstraction has 6034 states and 8083 transitions. [2022-07-22 20:46:53,511 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 8.285714285714286) internal successors, (58), 5 states have internal predecessors, (58), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-07-22 20:46:53,511 INFO L276 IsEmpty]: Start isEmpty. Operand 6034 states and 8083 transitions. [2022-07-22 20:46:53,512 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2022-07-22 20:46:53,512 INFO L187 NwaCegarLoop]: Found error trace [2022-07-22 20:46:53,512 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] [2022-07-22 20:46:53,512 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2022-07-22 20:46:53,513 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-22 20:46:53,513 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 20:46:53,514 INFO L85 PathProgramCache]: Analyzing trace with hash 867157537, now seen corresponding path program 1 times [2022-07-22 20:46:53,514 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 20:46:53,514 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1252496267] [2022-07-22 20:46:53,514 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 20:46:53,514 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 20:46:53,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 20:46:53,531 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-07-22 20:46:53,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 20:46:53,536 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-07-22 20:46:53,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 20:46:53,541 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-07-22 20:46:53,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 20:46:53,544 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-22 20:46:53,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 20:46:53,545 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-22 20:46:53,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 20:46:53,545 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2022-07-22 20:46:53,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 20:46:53,547 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2022-07-22 20:46:53,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 20:46:53,549 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-22 20:46:53,549 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-22 20:46:53,549 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1252496267] [2022-07-22 20:46:53,549 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1252496267] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-22 20:46:53,549 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-22 20:46:53,549 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-22 20:46:53,550 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [103607477] [2022-07-22 20:46:53,550 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-22 20:46:53,550 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-22 20:46:53,550 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-22 20:46:53,550 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-22 20:46:53,551 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-07-22 20:46:53,551 INFO L87 Difference]: Start difference. First operand 6034 states and 8083 transitions. Second operand has 6 states, 6 states have (on average 9.5) internal successors, (57), 3 states have internal predecessors, (57), 3 states have call successors, (8), 5 states have call predecessors, (8), 1 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2022-07-22 20:46:53,983 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-22 20:46:53,983 INFO L93 Difference]: Finished difference Result 9620 states and 12513 transitions. [2022-07-22 20:46:53,984 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-07-22 20:46:53,984 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 9.5) internal successors, (57), 3 states have internal predecessors, (57), 3 states have call successors, (8), 5 states have call predecessors, (8), 1 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) Word has length 72 [2022-07-22 20:46:53,984 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-22 20:46:53,998 INFO L225 Difference]: With dead ends: 9620 [2022-07-22 20:46:53,999 INFO L226 Difference]: Without dead ends: 6550 [2022-07-22 20:46:54,004 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=39, Invalid=71, Unknown=0, NotChecked=0, Total=110 [2022-07-22 20:46:54,004 INFO L413 NwaCegarLoop]: 333 mSDtfsCounter, 572 mSDsluCounter, 504 mSDsCounter, 0 mSdLazyCounter, 272 mSolverCounterSat, 110 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 596 SdHoareTripleChecker+Valid, 837 SdHoareTripleChecker+Invalid, 382 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 110 IncrementalHoareTripleChecker+Valid, 272 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-07-22 20:46:54,004 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [596 Valid, 837 Invalid, 382 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [110 Valid, 272 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-07-22 20:46:54,008 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6550 states. [2022-07-22 20:46:54,288 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6550 to 6317. [2022-07-22 20:46:54,294 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6317 states, 5098 states have (on average 1.3367987446057277) internal successors, (6815), 5191 states have internal predecessors, (6815), 646 states have call successors, (646), 473 states have call predecessors, (646), 571 states have return successors, (952), 662 states have call predecessors, (952), 642 states have call successors, (952) [2022-07-22 20:46:54,306 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6317 states to 6317 states and 8413 transitions. [2022-07-22 20:46:54,307 INFO L78 Accepts]: Start accepts. Automaton has 6317 states and 8413 transitions. Word has length 72 [2022-07-22 20:46:54,307 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-22 20:46:54,307 INFO L495 AbstractCegarLoop]: Abstraction has 6317 states and 8413 transitions. [2022-07-22 20:46:54,308 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 9.5) internal successors, (57), 3 states have internal predecessors, (57), 3 states have call successors, (8), 5 states have call predecessors, (8), 1 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2022-07-22 20:46:54,308 INFO L276 IsEmpty]: Start isEmpty. Operand 6317 states and 8413 transitions. [2022-07-22 20:46:54,309 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2022-07-22 20:46:54,309 INFO L187 NwaCegarLoop]: Found error trace [2022-07-22 20:46:54,309 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-22 20:46:54,309 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2022-07-22 20:46:54,309 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-22 20:46:54,310 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 20:46:54,310 INFO L85 PathProgramCache]: Analyzing trace with hash 595856072, now seen corresponding path program 1 times [2022-07-22 20:46:54,310 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 20:46:54,310 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [831416121] [2022-07-22 20:46:54,310 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 20:46:54,310 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 20:46:54,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 20:46:54,334 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-07-22 20:46:54,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 20:46:54,340 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-07-22 20:46:54,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 20:46:54,346 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-07-22 20:46:54,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 20:46:54,349 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-22 20:46:54,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 20:46:54,350 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-22 20:46:54,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 20:46:54,352 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2022-07-22 20:46:54,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 20:46:54,353 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2022-07-22 20:46:54,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 20:46:54,357 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-22 20:46:54,357 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-22 20:46:54,357 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [831416121] [2022-07-22 20:46:54,357 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [831416121] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-22 20:46:54,357 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-22 20:46:54,358 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-07-22 20:46:54,358 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1527387928] [2022-07-22 20:46:54,358 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-22 20:46:54,358 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-07-22 20:46:54,358 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-22 20:46:54,359 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-07-22 20:46:54,359 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2022-07-22 20:46:54,359 INFO L87 Difference]: Start difference. First operand 6317 states and 8413 transitions. Second operand has 7 states, 7 states have (on average 8.285714285714286) internal successors, (58), 4 states have internal predecessors, (58), 2 states have call successors, (8), 5 states have call predecessors, (8), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) [2022-07-22 20:46:54,897 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-22 20:46:54,897 INFO L93 Difference]: Finished difference Result 7371 states and 9680 transitions. [2022-07-22 20:46:54,898 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-07-22 20:46:54,898 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 8.285714285714286) internal successors, (58), 4 states have internal predecessors, (58), 2 states have call successors, (8), 5 states have call predecessors, (8), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) Word has length 73 [2022-07-22 20:46:54,898 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-22 20:46:54,911 INFO L225 Difference]: With dead ends: 7371 [2022-07-22 20:46:54,911 INFO L226 Difference]: Without dead ends: 7368 [2022-07-22 20:46:54,913 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=69, Invalid=141, Unknown=0, NotChecked=0, Total=210 [2022-07-22 20:46:54,913 INFO L413 NwaCegarLoop]: 329 mSDtfsCounter, 890 mSDsluCounter, 487 mSDsCounter, 0 mSdLazyCounter, 290 mSolverCounterSat, 246 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 900 SdHoareTripleChecker+Valid, 816 SdHoareTripleChecker+Invalid, 536 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 246 IncrementalHoareTripleChecker+Valid, 290 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-07-22 20:46:54,913 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [900 Valid, 816 Invalid, 536 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [246 Valid, 290 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-07-22 20:46:54,917 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7368 states. [2022-07-22 20:46:55,165 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7368 to 7074. [2022-07-22 20:46:55,171 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7074 states, 5676 states have (on average 1.3238195912614517) internal successors, (7514), 5776 states have internal predecessors, (7514), 729 states have call successors, (729), 545 states have call predecessors, (729), 667 states have return successors, (1080), 762 states have call predecessors, (1080), 726 states have call successors, (1080) [2022-07-22 20:46:55,185 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7074 states to 7074 states and 9323 transitions. [2022-07-22 20:46:55,186 INFO L78 Accepts]: Start accepts. Automaton has 7074 states and 9323 transitions. Word has length 73 [2022-07-22 20:46:55,186 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-22 20:46:55,187 INFO L495 AbstractCegarLoop]: Abstraction has 7074 states and 9323 transitions. [2022-07-22 20:46:55,187 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 8.285714285714286) internal successors, (58), 4 states have internal predecessors, (58), 2 states have call successors, (8), 5 states have call predecessors, (8), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) [2022-07-22 20:46:55,187 INFO L276 IsEmpty]: Start isEmpty. Operand 7074 states and 9323 transitions. [2022-07-22 20:46:55,188 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2022-07-22 20:46:55,188 INFO L187 NwaCegarLoop]: Found error trace [2022-07-22 20:46:55,189 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-22 20:46:55,189 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2022-07-22 20:46:55,189 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-22 20:46:55,189 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 20:46:55,189 INFO L85 PathProgramCache]: Analyzing trace with hash 1290941259, now seen corresponding path program 1 times [2022-07-22 20:46:55,189 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 20:46:55,189 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [70297634] [2022-07-22 20:46:55,189 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 20:46:55,189 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 20:46:55,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 20:46:55,227 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-07-22 20:46:55,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 20:46:55,233 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-07-22 20:46:55,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 20:46:55,239 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-07-22 20:46:55,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 20:46:55,241 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-22 20:46:55,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 20:46:55,242 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-22 20:46:55,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 20:46:55,242 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2022-07-22 20:46:55,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 20:46:55,244 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2022-07-22 20:46:55,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 20:46:55,245 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-22 20:46:55,245 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-22 20:46:55,245 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [70297634] [2022-07-22 20:46:55,245 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [70297634] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-22 20:46:55,245 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1547904451] [2022-07-22 20:46:55,245 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 20:46:55,246 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-22 20:46:55,246 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 20:46:55,247 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-22 20:46:55,250 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-07-22 20:46:55,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 20:46:55,360 INFO L263 TraceCheckSpWp]: Trace formula consists of 305 conjuncts, 9 conjunts are in the unsatisfiable core [2022-07-22 20:46:55,366 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-22 20:46:55,584 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-22 20:46:55,584 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-22 20:46:55,682 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-22 20:46:55,683 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1547904451] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-22 20:46:55,683 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-22 20:46:55,683 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 5, 4] total 10 [2022-07-22 20:46:55,683 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1086152699] [2022-07-22 20:46:55,683 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-22 20:46:55,683 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-07-22 20:46:55,683 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-22 20:46:55,684 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-07-22 20:46:55,684 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2022-07-22 20:46:55,684 INFO L87 Difference]: Start difference. First operand 7074 states and 9323 transitions. Second operand has 10 states, 10 states have (on average 12.0) internal successors, (120), 7 states have internal predecessors, (120), 4 states have call successors, (20), 6 states have call predecessors, (20), 2 states have return successors, (19), 3 states have call predecessors, (19), 3 states have call successors, (19) [2022-07-22 20:46:57,118 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-22 20:46:57,119 INFO L93 Difference]: Finished difference Result 11493 states and 14697 transitions. [2022-07-22 20:46:57,119 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2022-07-22 20:46:57,119 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 12.0) internal successors, (120), 7 states have internal predecessors, (120), 4 states have call successors, (20), 6 states have call predecessors, (20), 2 states have return successors, (19), 3 states have call predecessors, (19), 3 states have call successors, (19) Word has length 74 [2022-07-22 20:46:57,119 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-22 20:46:57,144 INFO L225 Difference]: With dead ends: 11493 [2022-07-22 20:46:57,144 INFO L226 Difference]: Without dead ends: 11490 [2022-07-22 20:46:57,148 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 203 GetRequests, 174 SyntacticMatches, 2 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 189 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=170, Invalid=642, Unknown=0, NotChecked=0, Total=812 [2022-07-22 20:46:57,149 INFO L413 NwaCegarLoop]: 479 mSDtfsCounter, 1263 mSDsluCounter, 1221 mSDsCounter, 0 mSdLazyCounter, 1398 mSolverCounterSat, 264 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1319 SdHoareTripleChecker+Valid, 1700 SdHoareTripleChecker+Invalid, 1662 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 264 IncrementalHoareTripleChecker+Valid, 1398 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2022-07-22 20:46:57,149 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1319 Valid, 1700 Invalid, 1662 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [264 Valid, 1398 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2022-07-22 20:46:57,162 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11490 states. [2022-07-22 20:46:57,714 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11490 to 10633. [2022-07-22 20:46:57,723 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10633 states, 8461 states have (on average 1.2938186975534807) internal successors, (10947), 8612 states have internal predecessors, (10947), 1099 states have call successors, (1099), 870 states have call predecessors, (1099), 1071 states have return successors, (1626), 1160 states have call predecessors, (1626), 1096 states have call successors, (1626) [2022-07-22 20:46:57,744 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10633 states to 10633 states and 13672 transitions. [2022-07-22 20:46:57,746 INFO L78 Accepts]: Start accepts. Automaton has 10633 states and 13672 transitions. Word has length 74 [2022-07-22 20:46:57,746 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-22 20:46:57,746 INFO L495 AbstractCegarLoop]: Abstraction has 10633 states and 13672 transitions. [2022-07-22 20:46:57,746 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 12.0) internal successors, (120), 7 states have internal predecessors, (120), 4 states have call successors, (20), 6 states have call predecessors, (20), 2 states have return successors, (19), 3 states have call predecessors, (19), 3 states have call successors, (19) [2022-07-22 20:46:57,746 INFO L276 IsEmpty]: Start isEmpty. Operand 10633 states and 13672 transitions. [2022-07-22 20:46:57,748 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2022-07-22 20:46:57,748 INFO L187 NwaCegarLoop]: Found error trace [2022-07-22 20:46:57,748 INFO L195 NwaCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-22 20:46:57,781 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-07-22 20:46:57,963 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-22 20:46:57,964 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-22 20:46:57,964 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 20:46:57,964 INFO L85 PathProgramCache]: Analyzing trace with hash 372887048, now seen corresponding path program 2 times [2022-07-22 20:46:57,964 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 20:46:57,965 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1796478303] [2022-07-22 20:46:57,965 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 20:46:57,965 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 20:46:57,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 20:46:57,992 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-07-22 20:46:57,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 20:46:57,998 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-07-22 20:46:57,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 20:46:58,003 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-07-22 20:46:58,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 20:46:58,005 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-22 20:46:58,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 20:46:58,006 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-22 20:46:58,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 20:46:58,007 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2022-07-22 20:46:58,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 20:46:58,008 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2022-07-22 20:46:58,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 20:46:58,009 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-22 20:46:58,009 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-22 20:46:58,009 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1796478303] [2022-07-22 20:46:58,010 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1796478303] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-22 20:46:58,010 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-22 20:46:58,010 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-22 20:46:58,010 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1729803187] [2022-07-22 20:46:58,010 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-22 20:46:58,010 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-22 20:46:58,010 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-22 20:46:58,011 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-22 20:46:58,011 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-07-22 20:46:58,011 INFO L87 Difference]: Start difference. First operand 10633 states and 13672 transitions. Second operand has 6 states, 6 states have (on average 10.333333333333334) internal successors, (62), 3 states have internal predecessors, (62), 2 states have call successors, (8), 5 states have call predecessors, (8), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) [2022-07-22 20:46:58,571 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-22 20:46:58,572 INFO L93 Difference]: Finished difference Result 13642 states and 17396 transitions. [2022-07-22 20:46:58,572 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-07-22 20:46:58,572 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 10.333333333333334) internal successors, (62), 3 states have internal predecessors, (62), 2 states have call successors, (8), 5 states have call predecessors, (8), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) Word has length 77 [2022-07-22 20:46:58,573 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-22 20:46:58,591 INFO L225 Difference]: With dead ends: 13642 [2022-07-22 20:46:58,591 INFO L226 Difference]: Without dead ends: 6844 [2022-07-22 20:46:58,603 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2022-07-22 20:46:58,604 INFO L413 NwaCegarLoop]: 362 mSDtfsCounter, 522 mSDsluCounter, 532 mSDsCounter, 0 mSdLazyCounter, 292 mSolverCounterSat, 96 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 548 SdHoareTripleChecker+Valid, 894 SdHoareTripleChecker+Invalid, 388 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 96 IncrementalHoareTripleChecker+Valid, 292 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-07-22 20:46:58,604 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [548 Valid, 894 Invalid, 388 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [96 Valid, 292 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-07-22 20:46:58,608 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6844 states. [2022-07-22 20:46:58,864 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6844 to 5818. [2022-07-22 20:46:58,870 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5818 states, 4712 states have (on average 1.330220713073005) internal successors, (6268), 4785 states have internal predecessors, (6268), 599 states have call successors, (599), 435 states have call predecessors, (599), 505 states have return successors, (852), 607 states have call predecessors, (852), 596 states have call successors, (852) [2022-07-22 20:46:58,881 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5818 states to 5818 states and 7719 transitions. [2022-07-22 20:46:58,883 INFO L78 Accepts]: Start accepts. Automaton has 5818 states and 7719 transitions. Word has length 77 [2022-07-22 20:46:58,883 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-22 20:46:58,883 INFO L495 AbstractCegarLoop]: Abstraction has 5818 states and 7719 transitions. [2022-07-22 20:46:58,883 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 10.333333333333334) internal successors, (62), 3 states have internal predecessors, (62), 2 states have call successors, (8), 5 states have call predecessors, (8), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) [2022-07-22 20:46:58,883 INFO L276 IsEmpty]: Start isEmpty. Operand 5818 states and 7719 transitions. [2022-07-22 20:46:58,886 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2022-07-22 20:46:58,886 INFO L187 NwaCegarLoop]: Found error trace [2022-07-22 20:46:58,886 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-22 20:46:58,887 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2022-07-22 20:46:58,905 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-22 20:46:58,906 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 20:46:58,906 INFO L85 PathProgramCache]: Analyzing trace with hash -1502182211, now seen corresponding path program 1 times [2022-07-22 20:46:58,906 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 20:46:58,906 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [793190069] [2022-07-22 20:46:58,906 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 20:46:58,906 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 20:46:58,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 20:46:58,934 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-07-22 20:46:58,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 20:46:58,955 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-07-22 20:46:58,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 20:46:58,961 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-07-22 20:46:58,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 20:46:58,963 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-22 20:46:58,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 20:46:58,964 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-22 20:46:58,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 20:46:58,964 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2022-07-22 20:46:58,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 20:46:58,965 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2022-07-22 20:46:58,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 20:46:58,966 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2022-07-22 20:46:58,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 20:46:58,968 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2022-07-22 20:46:58,968 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-22 20:46:58,968 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [793190069] [2022-07-22 20:46:58,968 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [793190069] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-22 20:46:58,968 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-22 20:46:58,968 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-07-22 20:46:58,968 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1724260604] [2022-07-22 20:46:58,968 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-22 20:46:58,969 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-07-22 20:46:58,970 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-22 20:46:58,970 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-07-22 20:46:58,970 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2022-07-22 20:46:58,970 INFO L87 Difference]: Start difference. First operand 5818 states and 7719 transitions. Second operand has 8 states, 8 states have (on average 7.875) internal successors, (63), 5 states have internal predecessors, (63), 4 states have call successors, (9), 5 states have call predecessors, (9), 2 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) [2022-07-22 20:46:59,929 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-22 20:46:59,930 INFO L93 Difference]: Finished difference Result 11542 states and 14643 transitions. [2022-07-22 20:46:59,930 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2022-07-22 20:46:59,930 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 7.875) internal successors, (63), 5 states have internal predecessors, (63), 4 states have call successors, (9), 5 states have call predecessors, (9), 2 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) Word has length 84 [2022-07-22 20:46:59,930 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-22 20:46:59,947 INFO L225 Difference]: With dead ends: 11542 [2022-07-22 20:46:59,948 INFO L226 Difference]: Without dead ends: 7746 [2022-07-22 20:46:59,955 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 94 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=131, Invalid=331, Unknown=0, NotChecked=0, Total=462 [2022-07-22 20:46:59,956 INFO L413 NwaCegarLoop]: 364 mSDtfsCounter, 711 mSDsluCounter, 834 mSDsCounter, 0 mSdLazyCounter, 691 mSolverCounterSat, 211 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 723 SdHoareTripleChecker+Valid, 1198 SdHoareTripleChecker+Invalid, 902 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 211 IncrementalHoareTripleChecker+Valid, 691 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-07-22 20:46:59,956 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [723 Valid, 1198 Invalid, 902 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [211 Valid, 691 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-07-22 20:46:59,960 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7746 states. [2022-07-22 20:47:00,323 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7746 to 7515. [2022-07-22 20:47:00,329 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7515 states, 6006 states have (on average 1.2938727938727939) internal successors, (7771), 6116 states have internal predecessors, (7771), 783 states have call successors, (783), 593 states have call predecessors, (783), 724 states have return successors, (1173), 815 states have call predecessors, (1173), 780 states have call successors, (1173) [2022-07-22 20:47:00,340 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7515 states to 7515 states and 9727 transitions. [2022-07-22 20:47:00,342 INFO L78 Accepts]: Start accepts. Automaton has 7515 states and 9727 transitions. Word has length 84 [2022-07-22 20:47:00,342 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-22 20:47:00,342 INFO L495 AbstractCegarLoop]: Abstraction has 7515 states and 9727 transitions. [2022-07-22 20:47:00,342 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 7.875) internal successors, (63), 5 states have internal predecessors, (63), 4 states have call successors, (9), 5 states have call predecessors, (9), 2 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) [2022-07-22 20:47:00,342 INFO L276 IsEmpty]: Start isEmpty. Operand 7515 states and 9727 transitions. [2022-07-22 20:47:00,346 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2022-07-22 20:47:00,346 INFO L187 NwaCegarLoop]: Found error trace [2022-07-22 20:47:00,347 INFO L195 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-22 20:47:00,347 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2022-07-22 20:47:00,347 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-22 20:47:00,347 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 20:47:00,347 INFO L85 PathProgramCache]: Analyzing trace with hash 905485990, now seen corresponding path program 1 times [2022-07-22 20:47:00,347 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 20:47:00,347 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [533574102] [2022-07-22 20:47:00,347 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 20:47:00,347 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 20:47:00,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 20:47:00,369 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-07-22 20:47:00,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 20:47:00,379 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-07-22 20:47:00,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 20:47:00,384 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-07-22 20:47:00,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 20:47:00,386 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-22 20:47:00,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 20:47:00,386 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-22 20:47:00,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 20:47:00,387 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2022-07-22 20:47:00,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 20:47:00,388 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2022-07-22 20:47:00,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 20:47:00,389 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2022-07-22 20:47:00,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 20:47:00,394 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 18 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-07-22 20:47:00,394 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-22 20:47:00,395 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [533574102] [2022-07-22 20:47:00,395 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [533574102] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-22 20:47:00,395 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-22 20:47:00,395 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-07-22 20:47:00,395 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [118993180] [2022-07-22 20:47:00,395 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-22 20:47:00,395 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-07-22 20:47:00,395 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-22 20:47:00,395 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-07-22 20:47:00,396 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2022-07-22 20:47:00,396 INFO L87 Difference]: Start difference. First operand 7515 states and 9727 transitions. Second operand has 9 states, 9 states have (on average 8.222222222222221) internal successors, (74), 6 states have internal predecessors, (74), 4 states have call successors, (9), 5 states have call predecessors, (9), 3 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) [2022-07-22 20:47:01,399 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-22 20:47:01,399 INFO L93 Difference]: Finished difference Result 10394 states and 13211 transitions. [2022-07-22 20:47:01,401 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2022-07-22 20:47:01,401 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 8.222222222222221) internal successors, (74), 6 states have internal predecessors, (74), 4 states have call successors, (9), 5 states have call predecessors, (9), 3 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) Word has length 93 [2022-07-22 20:47:01,401 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-22 20:47:01,417 INFO L225 Difference]: With dead ends: 10394 [2022-07-22 20:47:01,417 INFO L226 Difference]: Without dead ends: 6580 [2022-07-22 20:47:01,424 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 156 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=162, Invalid=540, Unknown=0, NotChecked=0, Total=702 [2022-07-22 20:47:01,425 INFO L413 NwaCegarLoop]: 352 mSDtfsCounter, 1360 mSDsluCounter, 702 mSDsCounter, 0 mSdLazyCounter, 787 mSolverCounterSat, 364 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1389 SdHoareTripleChecker+Valid, 1054 SdHoareTripleChecker+Invalid, 1151 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 364 IncrementalHoareTripleChecker+Valid, 787 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-07-22 20:47:01,425 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1389 Valid, 1054 Invalid, 1151 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [364 Valid, 787 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-07-22 20:47:01,429 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6580 states. [2022-07-22 20:47:01,744 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6580 to 6203. [2022-07-22 20:47:01,748 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6203 states, 4978 states have (on average 1.3045399758939333) internal successors, (6494), 5071 states have internal predecessors, (6494), 641 states have call successors, (641), 469 states have call predecessors, (641), 582 states have return successors, (938), 672 states have call predecessors, (938), 638 states have call successors, (938) [2022-07-22 20:47:01,756 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6203 states to 6203 states and 8073 transitions. [2022-07-22 20:47:01,758 INFO L78 Accepts]: Start accepts. Automaton has 6203 states and 8073 transitions. Word has length 93 [2022-07-22 20:47:01,758 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-22 20:47:01,758 INFO L495 AbstractCegarLoop]: Abstraction has 6203 states and 8073 transitions. [2022-07-22 20:47:01,758 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 8.222222222222221) internal successors, (74), 6 states have internal predecessors, (74), 4 states have call successors, (9), 5 states have call predecessors, (9), 3 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) [2022-07-22 20:47:01,758 INFO L276 IsEmpty]: Start isEmpty. Operand 6203 states and 8073 transitions. [2022-07-22 20:47:01,763 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2022-07-22 20:47:01,763 INFO L187 NwaCegarLoop]: Found error trace [2022-07-22 20:47:01,763 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-22 20:47:01,763 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2022-07-22 20:47:01,763 INFO L420 AbstractCegarLoop]: === Iteration 23 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-22 20:47:01,763 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 20:47:01,763 INFO L85 PathProgramCache]: Analyzing trace with hash -33791116, now seen corresponding path program 1 times [2022-07-22 20:47:01,764 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 20:47:01,764 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [983058748] [2022-07-22 20:47:01,764 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 20:47:01,764 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 20:47:01,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 20:47:01,774 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-07-22 20:47:01,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 20:47:01,781 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-07-22 20:47:01,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 20:47:01,786 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2022-07-22 20:47:01,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 20:47:01,808 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2022-07-22 20:47:01,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 20:47:01,810 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2022-07-22 20:47:01,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 20:47:01,811 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2022-07-22 20:47:01,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 20:47:01,814 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-07-22 20:47:01,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 20:47:01,816 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2022-07-22 20:47:01,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 20:47:01,817 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2022-07-22 20:47:01,817 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-22 20:47:01,817 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [983058748] [2022-07-22 20:47:01,817 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [983058748] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-22 20:47:01,817 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [348342691] [2022-07-22 20:47:01,817 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 20:47:01,818 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-22 20:47:01,818 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 20:47:01,819 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-22 20:47:01,833 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-07-22 20:47:01,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 20:47:01,901 INFO L263 TraceCheckSpWp]: Trace formula consists of 414 conjuncts, 2 conjunts are in the unsatisfiable core [2022-07-22 20:47:01,904 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-22 20:47:01,917 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2022-07-22 20:47:01,917 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-22 20:47:01,917 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [348342691] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-22 20:47:01,917 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-07-22 20:47:01,917 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [7] total 8 [2022-07-22 20:47:01,917 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1435794830] [2022-07-22 20:47:01,919 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-22 20:47:01,919 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-22 20:47:01,919 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-22 20:47:01,919 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-22 20:47:01,919 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2022-07-22 20:47:01,920 INFO L87 Difference]: Start difference. First operand 6203 states and 8073 transitions. Second operand has 3 states, 3 states have (on average 25.0) internal successors, (75), 3 states have internal predecessors, (75), 3 states have call successors, (9), 3 states have call predecessors, (9), 2 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2022-07-22 20:47:02,257 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-22 20:47:02,257 INFO L93 Difference]: Finished difference Result 9369 states and 12759 transitions. [2022-07-22 20:47:02,257 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-22 20:47:02,258 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 25.0) internal successors, (75), 3 states have internal predecessors, (75), 3 states have call successors, (9), 3 states have call predecessors, (9), 2 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) Word has length 111 [2022-07-22 20:47:02,258 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-22 20:47:02,274 INFO L225 Difference]: With dead ends: 9369 [2022-07-22 20:47:02,275 INFO L226 Difference]: Without dead ends: 6733 [2022-07-22 20:47:02,282 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 132 GetRequests, 126 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2022-07-22 20:47:02,283 INFO L413 NwaCegarLoop]: 465 mSDtfsCounter, 142 mSDsluCounter, 318 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 142 SdHoareTripleChecker+Valid, 783 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-22 20:47:02,283 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [142 Valid, 783 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-22 20:47:02,287 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6733 states. [2022-07-22 20:47:02,579 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6733 to 6733. [2022-07-22 20:47:02,584 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6733 states, 5425 states have (on average 1.3133640552995391) internal successors, (7125), 5522 states have internal predecessors, (7125), 690 states have call successors, (690), 499 states have call predecessors, (690), 616 states have return successors, (1016), 721 states have call predecessors, (1016), 687 states have call successors, (1016) [2022-07-22 20:47:02,594 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6733 states to 6733 states and 8831 transitions. [2022-07-22 20:47:02,595 INFO L78 Accepts]: Start accepts. Automaton has 6733 states and 8831 transitions. Word has length 111 [2022-07-22 20:47:02,596 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-22 20:47:02,596 INFO L495 AbstractCegarLoop]: Abstraction has 6733 states and 8831 transitions. [2022-07-22 20:47:02,596 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 25.0) internal successors, (75), 3 states have internal predecessors, (75), 3 states have call successors, (9), 3 states have call predecessors, (9), 2 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2022-07-22 20:47:02,596 INFO L276 IsEmpty]: Start isEmpty. Operand 6733 states and 8831 transitions. [2022-07-22 20:47:02,603 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 146 [2022-07-22 20:47:02,603 INFO L187 NwaCegarLoop]: Found error trace [2022-07-22 20:47:02,603 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-22 20:47:02,631 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2022-07-22 20:47:02,829 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable22 [2022-07-22 20:47:02,829 INFO L420 AbstractCegarLoop]: === Iteration 24 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-22 20:47:02,830 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 20:47:02,830 INFO L85 PathProgramCache]: Analyzing trace with hash -878802759, now seen corresponding path program 1 times [2022-07-22 20:47:02,830 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 20:47:02,830 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [666388622] [2022-07-22 20:47:02,830 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 20:47:02,830 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 20:47:02,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 20:47:02,864 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-07-22 20:47:02,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 20:47:02,871 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-07-22 20:47:02,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 20:47:02,876 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-07-22 20:47:02,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 20:47:02,878 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-22 20:47:02,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 20:47:02,879 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-22 20:47:02,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 20:47:02,880 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2022-07-22 20:47:02,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 20:47:02,883 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2022-07-22 20:47:02,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 20:47:02,884 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2022-07-22 20:47:02,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 20:47:02,895 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2022-07-22 20:47:02,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 20:47:02,896 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2022-07-22 20:47:02,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 20:47:02,897 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2022-07-22 20:47:02,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 20:47:02,904 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-22 20:47:02,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 20:47:02,905 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-22 20:47:02,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 20:47:02,906 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2022-07-22 20:47:02,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 20:47:02,907 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2022-07-22 20:47:02,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 20:47:02,908 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 125 [2022-07-22 20:47:02,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 20:47:02,909 INFO L134 CoverageAnalysis]: Checked inductivity of 80 backedges. 20 proven. 6 refuted. 0 times theorem prover too weak. 54 trivial. 0 not checked. [2022-07-22 20:47:02,909 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-22 20:47:02,909 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [666388622] [2022-07-22 20:47:02,909 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [666388622] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-22 20:47:02,909 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [458391315] [2022-07-22 20:47:02,910 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 20:47:02,910 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-22 20:47:02,910 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 20:47:02,911 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-22 20:47:02,912 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-07-22 20:47:02,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 20:47:02,987 INFO L263 TraceCheckSpWp]: Trace formula consists of 483 conjuncts, 5 conjunts are in the unsatisfiable core [2022-07-22 20:47:02,996 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-22 20:47:03,019 INFO L134 CoverageAnalysis]: Checked inductivity of 80 backedges. 71 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2022-07-22 20:47:03,020 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-22 20:47:03,020 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [458391315] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-22 20:47:03,020 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-07-22 20:47:03,020 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [10] total 12 [2022-07-22 20:47:03,020 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1613279732] [2022-07-22 20:47:03,020 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-22 20:47:03,021 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-22 20:47:03,021 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-22 20:47:03,021 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-22 20:47:03,021 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=108, Unknown=0, NotChecked=0, Total=132 [2022-07-22 20:47:03,024 INFO L87 Difference]: Start difference. First operand 6733 states and 8831 transitions. Second operand has 6 states, 6 states have (on average 17.666666666666668) internal successors, (106), 5 states have internal predecessors, (106), 2 states have call successors, (16), 2 states have call predecessors, (16), 3 states have return successors, (16), 3 states have call predecessors, (16), 2 states have call successors, (16) [2022-07-22 20:47:03,278 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-22 20:47:03,278 INFO L93 Difference]: Finished difference Result 8412 states and 10844 transitions. [2022-07-22 20:47:03,279 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-22 20:47:03,279 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 17.666666666666668) internal successors, (106), 5 states have internal predecessors, (106), 2 states have call successors, (16), 2 states have call predecessors, (16), 3 states have return successors, (16), 3 states have call predecessors, (16), 2 states have call successors, (16) Word has length 145 [2022-07-22 20:47:03,279 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-22 20:47:03,290 INFO L225 Difference]: With dead ends: 8412 [2022-07-22 20:47:03,291 INFO L226 Difference]: Without dead ends: 5175 [2022-07-22 20:47:03,295 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 185 GetRequests, 173 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=34, Invalid=148, Unknown=0, NotChecked=0, Total=182 [2022-07-22 20:47:03,296 INFO L413 NwaCegarLoop]: 323 mSDtfsCounter, 34 mSDsluCounter, 1252 mSDsCounter, 0 mSdLazyCounter, 27 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 36 SdHoareTripleChecker+Valid, 1575 SdHoareTripleChecker+Invalid, 28 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 27 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-22 20:47:03,296 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [36 Valid, 1575 Invalid, 28 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 27 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-22 20:47:03,299 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5175 states. [2022-07-22 20:47:03,513 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5175 to 5052. [2022-07-22 20:47:03,517 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5052 states, 4186 states have (on average 1.3509316770186335) internal successors, (5655), 4244 states have internal predecessors, (5655), 482 states have call successors, (482), 316 states have call predecessors, (482), 382 states have return successors, (722), 499 states have call predecessors, (722), 479 states have call successors, (722) [2022-07-22 20:47:03,525 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5052 states to 5052 states and 6859 transitions. [2022-07-22 20:47:03,526 INFO L78 Accepts]: Start accepts. Automaton has 5052 states and 6859 transitions. Word has length 145 [2022-07-22 20:47:03,526 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-22 20:47:03,526 INFO L495 AbstractCegarLoop]: Abstraction has 5052 states and 6859 transitions. [2022-07-22 20:47:03,526 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 17.666666666666668) internal successors, (106), 5 states have internal predecessors, (106), 2 states have call successors, (16), 2 states have call predecessors, (16), 3 states have return successors, (16), 3 states have call predecessors, (16), 2 states have call successors, (16) [2022-07-22 20:47:03,526 INFO L276 IsEmpty]: Start isEmpty. Operand 5052 states and 6859 transitions. [2022-07-22 20:47:03,532 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2022-07-22 20:47:03,532 INFO L187 NwaCegarLoop]: Found error trace [2022-07-22 20:47:03,532 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-22 20:47:03,551 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2022-07-22 20:47:03,747 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-22 20:47:03,748 INFO L420 AbstractCegarLoop]: === Iteration 25 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-22 20:47:03,748 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 20:47:03,748 INFO L85 PathProgramCache]: Analyzing trace with hash -1647944136, now seen corresponding path program 1 times [2022-07-22 20:47:03,748 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 20:47:03,748 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [318211668] [2022-07-22 20:47:03,748 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 20:47:03,748 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 20:47:03,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 20:47:03,764 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-07-22 20:47:03,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 20:47:03,771 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-07-22 20:47:03,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 20:47:03,777 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2022-07-22 20:47:03,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 20:47:03,800 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2022-07-22 20:47:03,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 20:47:03,802 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2022-07-22 20:47:03,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 20:47:03,803 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2022-07-22 20:47:03,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 20:47:03,806 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-07-22 20:47:03,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 20:47:03,807 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2022-07-22 20:47:03,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 20:47:03,810 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-07-22 20:47:03,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 20:47:03,811 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2022-07-22 20:47:03,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 20:47:03,813 INFO L134 CoverageAnalysis]: Checked inductivity of 71 backedges. 0 proven. 22 refuted. 0 times theorem prover too weak. 49 trivial. 0 not checked. [2022-07-22 20:47:03,813 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-22 20:47:03,813 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [318211668] [2022-07-22 20:47:03,813 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [318211668] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-22 20:47:03,813 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2028034960] [2022-07-22 20:47:03,813 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 20:47:03,813 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-22 20:47:03,814 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 20:47:03,815 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-22 20:47:03,816 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2022-07-22 20:47:03,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 20:47:03,891 INFO L263 TraceCheckSpWp]: Trace formula consists of 512 conjuncts, 2 conjunts are in the unsatisfiable core [2022-07-22 20:47:03,893 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-22 20:47:03,994 INFO L134 CoverageAnalysis]: Checked inductivity of 71 backedges. 51 proven. 0 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2022-07-22 20:47:03,994 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-22 20:47:03,994 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2028034960] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-22 20:47:03,995 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-07-22 20:47:03,995 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [7] total 8 [2022-07-22 20:47:03,995 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1047384533] [2022-07-22 20:47:03,995 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-22 20:47:03,995 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-22 20:47:03,995 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-22 20:47:03,996 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-22 20:47:03,996 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2022-07-22 20:47:03,996 INFO L87 Difference]: Start difference. First operand 5052 states and 6859 transitions. Second operand has 3 states, 3 states have (on average 34.333333333333336) internal successors, (103), 2 states have internal predecessors, (103), 2 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) [2022-07-22 20:47:04,326 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-22 20:47:04,326 INFO L93 Difference]: Finished difference Result 11808 states and 16744 transitions. [2022-07-22 20:47:04,327 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-22 20:47:04,327 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 34.333333333333336) internal successors, (103), 2 states have internal predecessors, (103), 2 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) Word has length 143 [2022-07-22 20:47:04,327 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-22 20:47:04,347 INFO L225 Difference]: With dead ends: 11808 [2022-07-22 20:47:04,347 INFO L226 Difference]: Without dead ends: 8335 [2022-07-22 20:47:04,357 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 168 GetRequests, 162 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2022-07-22 20:47:04,357 INFO L413 NwaCegarLoop]: 331 mSDtfsCounter, 235 mSDsluCounter, 170 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 235 SdHoareTripleChecker+Valid, 501 SdHoareTripleChecker+Invalid, 12 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-22 20:47:04,358 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [235 Valid, 501 Invalid, 12 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-22 20:47:04,362 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8335 states. [2022-07-22 20:47:04,726 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8335 to 8265. [2022-07-22 20:47:04,732 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8265 states, 6889 states have (on average 1.379445492814632) internal successors, (9503), 6990 states have internal predecessors, (9503), 774 states have call successors, (774), 506 states have call predecessors, (774), 600 states have return successors, (1166), 776 states have call predecessors, (1166), 771 states have call successors, (1166) [2022-07-22 20:47:04,745 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8265 states to 8265 states and 11443 transitions. [2022-07-22 20:47:04,746 INFO L78 Accepts]: Start accepts. Automaton has 8265 states and 11443 transitions. Word has length 143 [2022-07-22 20:47:04,746 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-22 20:47:04,746 INFO L495 AbstractCegarLoop]: Abstraction has 8265 states and 11443 transitions. [2022-07-22 20:47:04,746 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 34.333333333333336) internal successors, (103), 2 states have internal predecessors, (103), 2 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) [2022-07-22 20:47:04,747 INFO L276 IsEmpty]: Start isEmpty. Operand 8265 states and 11443 transitions. [2022-07-22 20:47:04,755 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2022-07-22 20:47:04,755 INFO L187 NwaCegarLoop]: Found error trace [2022-07-22 20:47:04,755 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-22 20:47:04,773 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2022-07-22 20:47:04,972 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-22 20:47:04,973 INFO L420 AbstractCegarLoop]: === Iteration 26 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-22 20:47:04,973 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 20:47:04,973 INFO L85 PathProgramCache]: Analyzing trace with hash -1613614096, now seen corresponding path program 1 times [2022-07-22 20:47:04,973 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 20:47:04,973 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1444306055] [2022-07-22 20:47:04,973 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 20:47:04,973 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 20:47:04,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 20:47:04,988 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-07-22 20:47:04,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 20:47:04,997 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-07-22 20:47:04,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 20:47:05,002 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2022-07-22 20:47:05,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 20:47:05,030 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2022-07-22 20:47:05,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 20:47:05,032 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2022-07-22 20:47:05,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 20:47:05,033 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2022-07-22 20:47:05,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 20:47:05,036 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-07-22 20:47:05,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 20:47:05,037 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2022-07-22 20:47:05,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 20:47:05,041 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-07-22 20:47:05,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 20:47:05,043 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2022-07-22 20:47:05,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 20:47:05,045 INFO L134 CoverageAnalysis]: Checked inductivity of 71 backedges. 0 proven. 22 refuted. 0 times theorem prover too weak. 49 trivial. 0 not checked. [2022-07-22 20:47:05,045 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-22 20:47:05,045 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1444306055] [2022-07-22 20:47:05,045 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1444306055] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-22 20:47:05,045 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1888209820] [2022-07-22 20:47:05,045 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 20:47:05,046 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-22 20:47:05,046 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 20:47:05,047 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-22 20:47:05,048 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2022-07-22 20:47:05,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 20:47:05,126 INFO L263 TraceCheckSpWp]: Trace formula consists of 512 conjuncts, 2 conjunts are in the unsatisfiable core [2022-07-22 20:47:05,129 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-22 20:47:05,208 INFO L134 CoverageAnalysis]: Checked inductivity of 71 backedges. 51 proven. 0 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2022-07-22 20:47:05,209 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-22 20:47:05,209 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1888209820] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-22 20:47:05,209 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-07-22 20:47:05,209 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [7] total 8 [2022-07-22 20:47:05,209 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2009260331] [2022-07-22 20:47:05,210 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-22 20:47:05,210 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-22 20:47:05,210 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-22 20:47:05,210 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-22 20:47:05,211 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2022-07-22 20:47:05,211 INFO L87 Difference]: Start difference. First operand 8265 states and 11443 transitions. Second operand has 3 states, 3 states have (on average 34.333333333333336) internal successors, (103), 2 states have internal predecessors, (103), 2 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) [2022-07-22 20:47:05,724 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-22 20:47:05,724 INFO L93 Difference]: Finished difference Result 15601 states and 22203 transitions. [2022-07-22 20:47:05,725 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-22 20:47:05,725 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 34.333333333333336) internal successors, (103), 2 states have internal predecessors, (103), 2 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) Word has length 143 [2022-07-22 20:47:05,725 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-22 20:47:05,753 INFO L225 Difference]: With dead ends: 15601 [2022-07-22 20:47:05,754 INFO L226 Difference]: Without dead ends: 11391 [2022-07-22 20:47:05,768 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 168 GetRequests, 162 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2022-07-22 20:47:05,769 INFO L413 NwaCegarLoop]: 351 mSDtfsCounter, 236 mSDsluCounter, 170 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 236 SdHoareTripleChecker+Valid, 521 SdHoareTripleChecker+Invalid, 12 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-22 20:47:05,769 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [236 Valid, 521 Invalid, 12 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-22 20:47:05,776 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11391 states. [2022-07-22 20:47:06,251 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11391 to 11291. [2022-07-22 20:47:06,259 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11291 states, 9440 states have (on average 1.3933262711864407) internal successors, (13153), 9575 states have internal predecessors, (13153), 1050 states have call successors, (1050), 681 states have call predecessors, (1050), 799 states have return successors, (1561), 1042 states have call predecessors, (1561), 1047 states have call successors, (1561) [2022-07-22 20:47:06,279 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11291 states to 11291 states and 15764 transitions. [2022-07-22 20:47:06,281 INFO L78 Accepts]: Start accepts. Automaton has 11291 states and 15764 transitions. Word has length 143 [2022-07-22 20:47:06,281 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-22 20:47:06,281 INFO L495 AbstractCegarLoop]: Abstraction has 11291 states and 15764 transitions. [2022-07-22 20:47:06,281 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 34.333333333333336) internal successors, (103), 2 states have internal predecessors, (103), 2 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) [2022-07-22 20:47:06,281 INFO L276 IsEmpty]: Start isEmpty. Operand 11291 states and 15764 transitions. [2022-07-22 20:47:06,292 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 160 [2022-07-22 20:47:06,292 INFO L187 NwaCegarLoop]: Found error trace [2022-07-22 20:47:06,292 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-22 20:47:06,309 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2022-07-22 20:47:06,492 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable25 [2022-07-22 20:47:06,493 INFO L420 AbstractCegarLoop]: === Iteration 27 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-22 20:47:06,493 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 20:47:06,493 INFO L85 PathProgramCache]: Analyzing trace with hash 50370099, now seen corresponding path program 1 times [2022-07-22 20:47:06,493 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 20:47:06,493 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1953985664] [2022-07-22 20:47:06,493 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 20:47:06,493 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 20:47:06,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 20:47:06,514 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-07-22 20:47:06,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 20:47:06,519 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-07-22 20:47:06,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 20:47:06,524 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-07-22 20:47:06,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 20:47:06,526 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-22 20:47:06,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 20:47:06,527 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-22 20:47:06,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 20:47:06,528 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2022-07-22 20:47:06,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 20:47:06,529 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2022-07-22 20:47:06,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 20:47:06,529 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2022-07-22 20:47:06,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 20:47:06,531 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2022-07-22 20:47:06,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 20:47:06,536 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2022-07-22 20:47:06,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 20:47:06,537 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2022-07-22 20:47:06,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 20:47:06,539 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-22 20:47:06,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 20:47:06,540 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-22 20:47:06,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 20:47:06,541 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 118 [2022-07-22 20:47:06,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 20:47:06,542 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 124 [2022-07-22 20:47:06,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 20:47:06,542 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 139 [2022-07-22 20:47:06,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 20:47:06,544 INFO L134 CoverageAnalysis]: Checked inductivity of 89 backedges. 25 proven. 0 refuted. 0 times theorem prover too weak. 64 trivial. 0 not checked. [2022-07-22 20:47:06,544 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-22 20:47:06,544 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1953985664] [2022-07-22 20:47:06,544 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1953985664] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-22 20:47:06,544 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-22 20:47:06,544 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-07-22 20:47:06,544 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1645060923] [2022-07-22 20:47:06,544 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-22 20:47:06,545 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-07-22 20:47:06,545 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-22 20:47:06,545 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-07-22 20:47:06,545 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2022-07-22 20:47:06,546 INFO L87 Difference]: Start difference. First operand 11291 states and 15764 transitions. Second operand has 7 states, 7 states have (on average 13.428571428571429) internal successors, (94), 4 states have internal predecessors, (94), 3 states have call successors, (15), 5 states have call predecessors, (15), 2 states have return successors, (14), 3 states have call predecessors, (14), 3 states have call successors, (14) [2022-07-22 20:47:07,310 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-22 20:47:07,311 INFO L93 Difference]: Finished difference Result 12574 states and 17284 transitions. [2022-07-22 20:47:07,311 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-07-22 20:47:07,311 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 13.428571428571429) internal successors, (94), 4 states have internal predecessors, (94), 3 states have call successors, (15), 5 states have call predecessors, (15), 2 states have return successors, (14), 3 states have call predecessors, (14), 3 states have call successors, (14) Word has length 159 [2022-07-22 20:47:07,311 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-22 20:47:07,338 INFO L225 Difference]: With dead ends: 12574 [2022-07-22 20:47:07,338 INFO L226 Difference]: Without dead ends: 11184 [2022-07-22 20:47:07,347 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=36, Invalid=74, Unknown=0, NotChecked=0, Total=110 [2022-07-22 20:47:07,347 INFO L413 NwaCegarLoop]: 333 mSDtfsCounter, 280 mSDsluCounter, 812 mSDsCounter, 0 mSdLazyCounter, 510 mSolverCounterSat, 77 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 281 SdHoareTripleChecker+Valid, 1145 SdHoareTripleChecker+Invalid, 587 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 77 IncrementalHoareTripleChecker+Valid, 510 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-07-22 20:47:07,348 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [281 Valid, 1145 Invalid, 587 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [77 Valid, 510 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-07-22 20:47:07,356 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11184 states. [2022-07-22 20:47:07,788 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11184 to 11038. [2022-07-22 20:47:07,795 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11038 states, 9238 states have (on average 1.3988958649058238) internal successors, (12923), 9373 states have internal predecessors, (12923), 1025 states have call successors, (1025), 660 states have call predecessors, (1025), 773 states have return successors, (1523), 1012 states have call predecessors, (1523), 1022 states have call successors, (1523) [2022-07-22 20:47:07,813 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11038 states to 11038 states and 15471 transitions. [2022-07-22 20:47:07,815 INFO L78 Accepts]: Start accepts. Automaton has 11038 states and 15471 transitions. Word has length 159 [2022-07-22 20:47:07,815 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-22 20:47:07,815 INFO L495 AbstractCegarLoop]: Abstraction has 11038 states and 15471 transitions. [2022-07-22 20:47:07,815 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 13.428571428571429) internal successors, (94), 4 states have internal predecessors, (94), 3 states have call successors, (15), 5 states have call predecessors, (15), 2 states have return successors, (14), 3 states have call predecessors, (14), 3 states have call successors, (14) [2022-07-22 20:47:07,815 INFO L276 IsEmpty]: Start isEmpty. Operand 11038 states and 15471 transitions. [2022-07-22 20:47:07,825 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 163 [2022-07-22 20:47:07,825 INFO L187 NwaCegarLoop]: Found error trace [2022-07-22 20:47:07,825 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-22 20:47:07,825 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2022-07-22 20:47:07,825 INFO L420 AbstractCegarLoop]: === Iteration 28 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-22 20:47:07,825 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 20:47:07,825 INFO L85 PathProgramCache]: Analyzing trace with hash 2115413199, now seen corresponding path program 1 times [2022-07-22 20:47:07,826 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 20:47:07,826 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [714983725] [2022-07-22 20:47:07,826 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 20:47:07,826 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 20:47:07,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 20:47:07,853 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-07-22 20:47:07,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 20:47:07,861 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-07-22 20:47:07,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 20:47:07,868 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-07-22 20:47:07,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 20:47:07,870 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-22 20:47:07,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 20:47:07,871 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-22 20:47:07,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 20:47:07,872 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2022-07-22 20:47:07,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 20:47:07,874 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2022-07-22 20:47:07,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 20:47:07,875 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2022-07-22 20:47:07,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 20:47:07,876 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2022-07-22 20:47:07,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 20:47:07,881 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2022-07-22 20:47:07,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 20:47:07,883 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2022-07-22 20:47:07,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 20:47:07,890 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-22 20:47:07,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 20:47:07,891 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-22 20:47:07,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 20:47:07,893 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2022-07-22 20:47:07,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 20:47:07,894 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2022-07-22 20:47:07,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 20:47:07,896 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 142 [2022-07-22 20:47:07,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 20:47:07,898 INFO L134 CoverageAnalysis]: Checked inductivity of 86 backedges. 25 proven. 7 refuted. 0 times theorem prover too weak. 54 trivial. 0 not checked. [2022-07-22 20:47:07,898 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-22 20:47:07,898 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [714983725] [2022-07-22 20:47:07,898 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [714983725] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-22 20:47:07,898 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [58177293] [2022-07-22 20:47:07,898 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 20:47:07,899 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-22 20:47:07,899 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 20:47:07,900 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-22 20:47:07,901 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2022-07-22 20:47:07,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 20:47:07,987 INFO L263 TraceCheckSpWp]: Trace formula consists of 545 conjuncts, 12 conjunts are in the unsatisfiable core [2022-07-22 20:47:07,989 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-22 20:47:08,127 INFO L134 CoverageAnalysis]: Checked inductivity of 86 backedges. 49 proven. 0 refuted. 0 times theorem prover too weak. 37 trivial. 0 not checked. [2022-07-22 20:47:08,127 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-22 20:47:08,127 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [58177293] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-22 20:47:08,127 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-07-22 20:47:08,127 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [9] total 11 [2022-07-22 20:47:08,127 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1364886036] [2022-07-22 20:47:08,127 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-22 20:47:08,128 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-22 20:47:08,128 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-22 20:47:08,128 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-22 20:47:08,128 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=84, Unknown=0, NotChecked=0, Total=110 [2022-07-22 20:47:08,128 INFO L87 Difference]: Start difference. First operand 11038 states and 15471 transitions. Second operand has 4 states, 4 states have (on average 27.25) internal successors, (109), 4 states have internal predecessors, (109), 2 states have call successors, (14), 3 states have call predecessors, (14), 3 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2022-07-22 20:47:08,705 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-22 20:47:08,706 INFO L93 Difference]: Finished difference Result 13364 states and 18279 transitions. [2022-07-22 20:47:08,706 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-07-22 20:47:08,706 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 27.25) internal successors, (109), 4 states have internal predecessors, (109), 2 states have call successors, (14), 3 states have call predecessors, (14), 3 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) Word has length 162 [2022-07-22 20:47:08,706 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-22 20:47:08,732 INFO L225 Difference]: With dead ends: 13364 [2022-07-22 20:47:08,733 INFO L226 Difference]: Without dead ends: 11954 [2022-07-22 20:47:08,740 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 205 GetRequests, 195 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=31, Invalid=101, Unknown=0, NotChecked=0, Total=132 [2022-07-22 20:47:08,740 INFO L413 NwaCegarLoop]: 310 mSDtfsCounter, 177 mSDsluCounter, 324 mSDsCounter, 0 mSdLazyCounter, 186 mSolverCounterSat, 44 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 182 SdHoareTripleChecker+Valid, 634 SdHoareTripleChecker+Invalid, 230 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 44 IncrementalHoareTripleChecker+Valid, 186 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-22 20:47:08,740 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [182 Valid, 634 Invalid, 230 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [44 Valid, 186 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-22 20:47:08,747 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11954 states. [2022-07-22 20:47:09,279 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11954 to 11912. [2022-07-22 20:47:09,289 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11912 states, 9969 states have (on average 1.3802788644798876) internal successors, (13760), 10108 states have internal predecessors, (13760), 1095 states have call successors, (1095), 711 states have call predecessors, (1095), 846 states have return successors, (1634), 1100 states have call predecessors, (1634), 1092 states have call successors, (1634) [2022-07-22 20:47:09,309 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11912 states to 11912 states and 16489 transitions. [2022-07-22 20:47:09,311 INFO L78 Accepts]: Start accepts. Automaton has 11912 states and 16489 transitions. Word has length 162 [2022-07-22 20:47:09,311 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-22 20:47:09,311 INFO L495 AbstractCegarLoop]: Abstraction has 11912 states and 16489 transitions. [2022-07-22 20:47:09,311 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 27.25) internal successors, (109), 4 states have internal predecessors, (109), 2 states have call successors, (14), 3 states have call predecessors, (14), 3 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2022-07-22 20:47:09,312 INFO L276 IsEmpty]: Start isEmpty. Operand 11912 states and 16489 transitions. [2022-07-22 20:47:09,322 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 161 [2022-07-22 20:47:09,322 INFO L187 NwaCegarLoop]: Found error trace [2022-07-22 20:47:09,322 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-22 20:47:09,339 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2022-07-22 20:47:09,523 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable27 [2022-07-22 20:47:09,523 INFO L420 AbstractCegarLoop]: === Iteration 29 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-22 20:47:09,523 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 20:47:09,524 INFO L85 PathProgramCache]: Analyzing trace with hash -1963717299, now seen corresponding path program 1 times [2022-07-22 20:47:09,524 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 20:47:09,524 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [548193404] [2022-07-22 20:47:09,524 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 20:47:09,524 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 20:47:09,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 20:47:09,538 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-07-22 20:47:09,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 20:47:09,545 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-07-22 20:47:09,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 20:47:09,550 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2022-07-22 20:47:09,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 20:47:09,576 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2022-07-22 20:47:09,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 20:47:09,578 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2022-07-22 20:47:09,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 20:47:09,581 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2022-07-22 20:47:09,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 20:47:09,582 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2022-07-22 20:47:09,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 20:47:09,584 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-07-22 20:47:09,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 20:47:09,586 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 115 [2022-07-22 20:47:09,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 20:47:09,588 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-07-22 20:47:09,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 20:47:09,590 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 145 [2022-07-22 20:47:09,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 20:47:09,598 INFO L134 CoverageAnalysis]: Checked inductivity of 98 backedges. 0 proven. 22 refuted. 0 times theorem prover too weak. 76 trivial. 0 not checked. [2022-07-22 20:47:09,598 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-22 20:47:09,598 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [548193404] [2022-07-22 20:47:09,598 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [548193404] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-22 20:47:09,598 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [102642356] [2022-07-22 20:47:09,599 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 20:47:09,599 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-22 20:47:09,599 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 20:47:09,600 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-22 20:47:09,601 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2022-07-22 20:47:09,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 20:47:09,679 INFO L263 TraceCheckSpWp]: Trace formula consists of 553 conjuncts, 2 conjunts are in the unsatisfiable core [2022-07-22 20:47:09,681 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-22 20:47:09,700 INFO L134 CoverageAnalysis]: Checked inductivity of 98 backedges. 69 proven. 0 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2022-07-22 20:47:09,700 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-22 20:47:09,700 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [102642356] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-22 20:47:09,700 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-07-22 20:47:09,700 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [7] total 8 [2022-07-22 20:47:09,701 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [156373643] [2022-07-22 20:47:09,701 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-22 20:47:09,701 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-22 20:47:09,702 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-22 20:47:09,702 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-22 20:47:09,702 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2022-07-22 20:47:09,703 INFO L87 Difference]: Start difference. First operand 11912 states and 16489 transitions. Second operand has 3 states, 3 states have (on average 37.666666666666664) internal successors, (113), 3 states have internal predecessors, (113), 3 states have call successors, (11), 3 states have call predecessors, (11), 2 states have return successors, (10), 2 states have call predecessors, (10), 3 states have call successors, (10) [2022-07-22 20:47:10,346 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-22 20:47:10,346 INFO L93 Difference]: Finished difference Result 21811 states and 30766 transitions. [2022-07-22 20:47:10,347 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-22 20:47:10,347 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 37.666666666666664) internal successors, (113), 3 states have internal predecessors, (113), 3 states have call successors, (11), 3 states have call predecessors, (11), 2 states have return successors, (10), 2 states have call predecessors, (10), 3 states have call successors, (10) Word has length 160 [2022-07-22 20:47:10,347 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-22 20:47:10,373 INFO L225 Difference]: With dead ends: 21811 [2022-07-22 20:47:10,373 INFO L226 Difference]: Without dead ends: 12814 [2022-07-22 20:47:10,388 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 187 GetRequests, 181 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2022-07-22 20:47:10,388 INFO L413 NwaCegarLoop]: 324 mSDtfsCounter, 298 mSDsluCounter, 34 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 298 SdHoareTripleChecker+Valid, 358 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-22 20:47:10,389 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [298 Valid, 358 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-22 20:47:10,397 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12814 states. [2022-07-22 20:47:11,075 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12814 to 12439. [2022-07-22 20:47:11,084 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12439 states, 10492 states have (on average 1.3265345024780786) internal successors, (13918), 10611 states have internal predecessors, (13918), 1063 states have call successors, (1063), 754 states have call predecessors, (1063), 882 states have return successors, (1512), 1077 states have call predecessors, (1512), 1060 states have call successors, (1512) [2022-07-22 20:47:11,105 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12439 states to 12439 states and 16493 transitions. [2022-07-22 20:47:11,107 INFO L78 Accepts]: Start accepts. Automaton has 12439 states and 16493 transitions. Word has length 160 [2022-07-22 20:47:11,107 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-22 20:47:11,107 INFO L495 AbstractCegarLoop]: Abstraction has 12439 states and 16493 transitions. [2022-07-22 20:47:11,107 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 37.666666666666664) internal successors, (113), 3 states have internal predecessors, (113), 3 states have call successors, (11), 3 states have call predecessors, (11), 2 states have return successors, (10), 2 states have call predecessors, (10), 3 states have call successors, (10) [2022-07-22 20:47:11,108 INFO L276 IsEmpty]: Start isEmpty. Operand 12439 states and 16493 transitions. [2022-07-22 20:47:11,116 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 161 [2022-07-22 20:47:11,116 INFO L187 NwaCegarLoop]: Found error trace [2022-07-22 20:47:11,116 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-22 20:47:11,132 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2022-07-22 20:47:11,316 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-22 20:47:11,317 INFO L420 AbstractCegarLoop]: === Iteration 30 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-22 20:47:11,317 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 20:47:11,317 INFO L85 PathProgramCache]: Analyzing trace with hash -2001388946, now seen corresponding path program 1 times [2022-07-22 20:47:11,317 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 20:47:11,317 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [816247364] [2022-07-22 20:47:11,318 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 20:47:11,318 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 20:47:11,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 20:47:11,337 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-07-22 20:47:11,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 20:47:11,344 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-07-22 20:47:11,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 20:47:11,349 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2022-07-22 20:47:11,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 20:47:11,369 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2022-07-22 20:47:11,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 20:47:11,372 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2022-07-22 20:47:11,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 20:47:11,373 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2022-07-22 20:47:11,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 20:47:11,374 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2022-07-22 20:47:11,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 20:47:11,376 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-07-22 20:47:11,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 20:47:11,378 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 115 [2022-07-22 20:47:11,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 20:47:11,380 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-07-22 20:47:11,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 20:47:11,381 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 145 [2022-07-22 20:47:11,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 20:47:11,382 INFO L134 CoverageAnalysis]: Checked inductivity of 98 backedges. 0 proven. 22 refuted. 0 times theorem prover too weak. 76 trivial. 0 not checked. [2022-07-22 20:47:11,383 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-22 20:47:11,383 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [816247364] [2022-07-22 20:47:11,383 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [816247364] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-22 20:47:11,383 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1226040083] [2022-07-22 20:47:11,383 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 20:47:11,383 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-22 20:47:11,383 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 20:47:11,385 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-22 20:47:11,386 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2022-07-22 20:47:11,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 20:47:11,466 INFO L263 TraceCheckSpWp]: Trace formula consists of 547 conjuncts, 3 conjunts are in the unsatisfiable core [2022-07-22 20:47:11,468 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-22 20:47:11,531 INFO L134 CoverageAnalysis]: Checked inductivity of 98 backedges. 82 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2022-07-22 20:47:11,532 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-22 20:47:11,532 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1226040083] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-22 20:47:11,532 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-07-22 20:47:11,532 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [7] total 8 [2022-07-22 20:47:11,532 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1210392506] [2022-07-22 20:47:11,532 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-22 20:47:11,533 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-22 20:47:11,533 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-22 20:47:11,533 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-22 20:47:11,533 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2022-07-22 20:47:11,534 INFO L87 Difference]: Start difference. First operand 12439 states and 16493 transitions. Second operand has 3 states, 3 states have (on average 42.333333333333336) internal successors, (127), 3 states have internal predecessors, (127), 3 states have call successors, (10), 3 states have call predecessors, (10), 3 states have return successors, (10), 3 states have call predecessors, (10), 3 states have call successors, (10) [2022-07-22 20:47:12,089 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-22 20:47:12,089 INFO L93 Difference]: Finished difference Result 21018 states and 28214 transitions. [2022-07-22 20:47:12,089 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-22 20:47:12,090 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 42.333333333333336) internal successors, (127), 3 states have internal predecessors, (127), 3 states have call successors, (10), 3 states have call predecessors, (10), 3 states have return successors, (10), 3 states have call predecessors, (10), 3 states have call successors, (10) Word has length 160 [2022-07-22 20:47:12,090 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-22 20:47:12,109 INFO L225 Difference]: With dead ends: 21018 [2022-07-22 20:47:12,109 INFO L226 Difference]: Without dead ends: 10780 [2022-07-22 20:47:12,121 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 187 GetRequests, 181 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2022-07-22 20:47:12,122 INFO L413 NwaCegarLoop]: 318 mSDtfsCounter, 253 mSDsluCounter, 33 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 253 SdHoareTripleChecker+Valid, 351 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-22 20:47:12,122 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [253 Valid, 351 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-22 20:47:12,127 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10780 states. [2022-07-22 20:47:12,650 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10780 to 10740. [2022-07-22 20:47:12,658 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10740 states, 9090 states have (on average 1.28987898789879) internal successors, (11725), 9175 states have internal predecessors, (11725), 871 states have call successors, (871), 661 states have call predecessors, (871), 777 states have return successors, (1226), 907 states have call predecessors, (1226), 868 states have call successors, (1226) [2022-07-22 20:47:12,675 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10740 states to 10740 states and 13822 transitions. [2022-07-22 20:47:12,677 INFO L78 Accepts]: Start accepts. Automaton has 10740 states and 13822 transitions. Word has length 160 [2022-07-22 20:47:12,678 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-22 20:47:12,678 INFO L495 AbstractCegarLoop]: Abstraction has 10740 states and 13822 transitions. [2022-07-22 20:47:12,678 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 42.333333333333336) internal successors, (127), 3 states have internal predecessors, (127), 3 states have call successors, (10), 3 states have call predecessors, (10), 3 states have return successors, (10), 3 states have call predecessors, (10), 3 states have call successors, (10) [2022-07-22 20:47:12,678 INFO L276 IsEmpty]: Start isEmpty. Operand 10740 states and 13822 transitions. [2022-07-22 20:47:12,685 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 161 [2022-07-22 20:47:12,685 INFO L187 NwaCegarLoop]: Found error trace [2022-07-22 20:47:12,685 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-22 20:47:12,703 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2022-07-22 20:47:12,885 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29,9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-22 20:47:12,886 INFO L420 AbstractCegarLoop]: === Iteration 31 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-22 20:47:12,886 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 20:47:12,886 INFO L85 PathProgramCache]: Analyzing trace with hash 453524583, now seen corresponding path program 1 times [2022-07-22 20:47:12,886 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 20:47:12,886 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [719227906] [2022-07-22 20:47:12,886 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 20:47:12,886 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 20:47:12,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 20:47:12,897 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-07-22 20:47:12,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 20:47:12,903 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-07-22 20:47:12,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 20:47:12,907 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2022-07-22 20:47:12,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 20:47:12,928 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2022-07-22 20:47:12,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 20:47:12,930 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2022-07-22 20:47:12,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 20:47:12,931 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2022-07-22 20:47:12,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 20:47:12,932 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2022-07-22 20:47:12,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 20:47:12,936 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-07-22 20:47:12,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 20:47:12,938 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2022-07-22 20:47:12,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 20:47:12,940 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-07-22 20:47:12,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 20:47:12,941 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 145 [2022-07-22 20:47:12,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 20:47:12,943 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 0 proven. 22 refuted. 0 times theorem prover too weak. 78 trivial. 0 not checked. [2022-07-22 20:47:12,943 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-22 20:47:12,943 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [719227906] [2022-07-22 20:47:12,943 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [719227906] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-22 20:47:12,943 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [562541107] [2022-07-22 20:47:12,943 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 20:47:12,943 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-22 20:47:12,944 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 20:47:12,945 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-22 20:47:12,946 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2022-07-22 20:47:13,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 20:47:13,024 INFO L263 TraceCheckSpWp]: Trace formula consists of 544 conjuncts, 3 conjunts are in the unsatisfiable core [2022-07-22 20:47:13,026 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-22 20:47:13,037 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 59 proven. 0 refuted. 0 times theorem prover too weak. 41 trivial. 0 not checked. [2022-07-22 20:47:13,038 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-22 20:47:13,038 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [562541107] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-22 20:47:13,038 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-07-22 20:47:13,038 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [7] total 8 [2022-07-22 20:47:13,038 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2075349604] [2022-07-22 20:47:13,038 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-22 20:47:13,039 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-22 20:47:13,039 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-22 20:47:13,039 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-22 20:47:13,039 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2022-07-22 20:47:13,039 INFO L87 Difference]: Start difference. First operand 10740 states and 13822 transitions. Second operand has 3 states, 3 states have (on average 35.0) internal successors, (105), 3 states have internal predecessors, (105), 2 states have call successors, (10), 2 states have call predecessors, (10), 3 states have return successors, (9), 3 states have call predecessors, (9), 2 states have call successors, (9) [2022-07-22 20:47:13,591 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-22 20:47:13,591 INFO L93 Difference]: Finished difference Result 19185 states and 25013 transitions. [2022-07-22 20:47:13,591 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-22 20:47:13,591 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 35.0) internal successors, (105), 3 states have internal predecessors, (105), 2 states have call successors, (10), 2 states have call predecessors, (10), 3 states have return successors, (9), 3 states have call predecessors, (9), 2 states have call successors, (9) Word has length 160 [2022-07-22 20:47:13,592 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-22 20:47:13,610 INFO L225 Difference]: With dead ends: 19185 [2022-07-22 20:47:13,610 INFO L226 Difference]: Without dead ends: 10646 [2022-07-22 20:47:13,622 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 187 GetRequests, 181 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2022-07-22 20:47:13,623 INFO L413 NwaCegarLoop]: 340 mSDtfsCounter, 278 mSDsluCounter, 164 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 278 SdHoareTripleChecker+Valid, 504 SdHoareTripleChecker+Invalid, 10 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-22 20:47:13,623 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [278 Valid, 504 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-22 20:47:13,629 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10646 states. [2022-07-22 20:47:14,148 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10646 to 10646. [2022-07-22 20:47:14,156 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10646 states, 8996 states have (on average 1.272009782125389) internal successors, (11443), 9081 states have internal predecessors, (11443), 871 states have call successors, (871), 661 states have call predecessors, (871), 777 states have return successors, (1226), 907 states have call predecessors, (1226), 868 states have call successors, (1226) [2022-07-22 20:47:14,170 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10646 states to 10646 states and 13540 transitions. [2022-07-22 20:47:14,173 INFO L78 Accepts]: Start accepts. Automaton has 10646 states and 13540 transitions. Word has length 160 [2022-07-22 20:47:14,173 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-22 20:47:14,173 INFO L495 AbstractCegarLoop]: Abstraction has 10646 states and 13540 transitions. [2022-07-22 20:47:14,173 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 35.0) internal successors, (105), 3 states have internal predecessors, (105), 2 states have call successors, (10), 2 states have call predecessors, (10), 3 states have return successors, (9), 3 states have call predecessors, (9), 2 states have call successors, (9) [2022-07-22 20:47:14,173 INFO L276 IsEmpty]: Start isEmpty. Operand 10646 states and 13540 transitions. [2022-07-22 20:47:14,178 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 162 [2022-07-22 20:47:14,178 INFO L187 NwaCegarLoop]: Found error trace [2022-07-22 20:47:14,179 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-22 20:47:14,198 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2022-07-22 20:47:14,386 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30,10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-22 20:47:14,388 INFO L420 AbstractCegarLoop]: === Iteration 32 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-22 20:47:14,388 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 20:47:14,388 INFO L85 PathProgramCache]: Analyzing trace with hash 1421882321, now seen corresponding path program 1 times [2022-07-22 20:47:14,388 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 20:47:14,388 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [579826977] [2022-07-22 20:47:14,389 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 20:47:14,389 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 20:47:14,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 20:47:14,400 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-07-22 20:47:14,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 20:47:14,406 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-07-22 20:47:14,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 20:47:14,410 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2022-07-22 20:47:14,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 20:47:14,445 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2022-07-22 20:47:14,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 20:47:14,447 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2022-07-22 20:47:14,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 20:47:14,448 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2022-07-22 20:47:14,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 20:47:14,450 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-07-22 20:47:14,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 20:47:14,452 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2022-07-22 20:47:14,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 20:47:14,453 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2022-07-22 20:47:14,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 20:47:14,455 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-07-22 20:47:14,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 20:47:14,457 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 146 [2022-07-22 20:47:14,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 20:47:14,458 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 0 proven. 22 refuted. 0 times theorem prover too weak. 78 trivial. 0 not checked. [2022-07-22 20:47:14,458 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-22 20:47:14,458 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [579826977] [2022-07-22 20:47:14,458 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [579826977] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-22 20:47:14,459 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [682022955] [2022-07-22 20:47:14,459 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 20:47:14,459 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-22 20:47:14,459 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 20:47:14,460 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-22 20:47:14,479 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2022-07-22 20:47:14,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 20:47:14,554 INFO L263 TraceCheckSpWp]: Trace formula consists of 545 conjuncts, 2 conjunts are in the unsatisfiable core [2022-07-22 20:47:14,556 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-22 20:47:14,573 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 80 proven. 0 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2022-07-22 20:47:14,574 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-22 20:47:14,574 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [682022955] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-22 20:47:14,574 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-07-22 20:47:14,574 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [7] total 8 [2022-07-22 20:47:14,574 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1117353862] [2022-07-22 20:47:14,574 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-22 20:47:14,574 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-22 20:47:14,574 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-22 20:47:14,575 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-22 20:47:14,575 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2022-07-22 20:47:14,575 INFO L87 Difference]: Start difference. First operand 10646 states and 13540 transitions. Second operand has 3 states, 3 states have (on average 39.666666666666664) internal successors, (119), 3 states have internal predecessors, (119), 3 states have call successors, (12), 3 states have call predecessors, (12), 3 states have return successors, (11), 3 states have call predecessors, (11), 3 states have call successors, (11) [2022-07-22 20:47:15,413 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-22 20:47:15,413 INFO L93 Difference]: Finished difference Result 25956 states and 33661 transitions. [2022-07-22 20:47:15,414 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-22 20:47:15,414 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 39.666666666666664) internal successors, (119), 3 states have internal predecessors, (119), 3 states have call successors, (12), 3 states have call predecessors, (12), 3 states have return successors, (11), 3 states have call predecessors, (11), 3 states have call successors, (11) Word has length 161 [2022-07-22 20:47:15,414 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-22 20:47:15,452 INFO L225 Difference]: With dead ends: 25956 [2022-07-22 20:47:15,452 INFO L226 Difference]: Without dead ends: 17511 [2022-07-22 20:47:15,470 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 188 GetRequests, 182 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2022-07-22 20:47:15,470 INFO L413 NwaCegarLoop]: 464 mSDtfsCounter, 149 mSDsluCounter, 313 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 149 SdHoareTripleChecker+Valid, 777 SdHoareTripleChecker+Invalid, 13 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-22 20:47:15,470 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [149 Valid, 777 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-22 20:47:15,481 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17511 states. [2022-07-22 20:47:16,505 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17511 to 17507. [2022-07-22 20:47:16,518 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17507 states, 14790 states have (on average 1.2752535496957405) internal successors, (18861), 14942 states have internal predecessors, (18861), 1461 states have call successors, (1461), 1084 states have call predecessors, (1461), 1254 states have return successors, (2233), 1488 states have call predecessors, (2233), 1458 states have call successors, (2233) [2022-07-22 20:47:16,548 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17507 states to 17507 states and 22555 transitions. [2022-07-22 20:47:16,551 INFO L78 Accepts]: Start accepts. Automaton has 17507 states and 22555 transitions. Word has length 161 [2022-07-22 20:47:16,551 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-22 20:47:16,551 INFO L495 AbstractCegarLoop]: Abstraction has 17507 states and 22555 transitions. [2022-07-22 20:47:16,551 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 39.666666666666664) internal successors, (119), 3 states have internal predecessors, (119), 3 states have call successors, (12), 3 states have call predecessors, (12), 3 states have return successors, (11), 3 states have call predecessors, (11), 3 states have call successors, (11) [2022-07-22 20:47:16,551 INFO L276 IsEmpty]: Start isEmpty. Operand 17507 states and 22555 transitions. [2022-07-22 20:47:16,561 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 162 [2022-07-22 20:47:16,561 INFO L187 NwaCegarLoop]: Found error trace [2022-07-22 20:47:16,562 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-22 20:47:16,580 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2022-07-22 20:47:16,762 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable31 [2022-07-22 20:47:16,762 INFO L420 AbstractCegarLoop]: === Iteration 33 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-22 20:47:16,763 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 20:47:16,763 INFO L85 PathProgramCache]: Analyzing trace with hash -831857108, now seen corresponding path program 1 times [2022-07-22 20:47:16,763 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 20:47:16,763 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1180511059] [2022-07-22 20:47:16,763 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 20:47:16,763 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 20:47:16,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 20:47:16,773 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-07-22 20:47:16,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 20:47:16,780 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-07-22 20:47:16,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 20:47:16,784 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2022-07-22 20:47:16,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 20:47:16,806 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2022-07-22 20:47:16,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 20:47:16,808 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2022-07-22 20:47:16,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 20:47:16,809 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2022-07-22 20:47:16,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 20:47:16,810 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2022-07-22 20:47:16,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 20:47:16,812 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-07-22 20:47:16,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 20:47:16,814 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2022-07-22 20:47:16,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 20:47:16,816 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-07-22 20:47:16,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 20:47:16,817 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 146 [2022-07-22 20:47:16,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 20:47:16,818 INFO L134 CoverageAnalysis]: Checked inductivity of 102 backedges. 0 proven. 22 refuted. 0 times theorem prover too weak. 80 trivial. 0 not checked. [2022-07-22 20:47:16,818 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-22 20:47:16,818 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1180511059] [2022-07-22 20:47:16,819 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1180511059] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-22 20:47:16,819 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1140549325] [2022-07-22 20:47:16,819 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 20:47:16,819 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-22 20:47:16,819 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 20:47:16,820 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-22 20:47:16,821 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2022-07-22 20:47:16,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 20:47:16,900 INFO L263 TraceCheckSpWp]: Trace formula consists of 551 conjuncts, 3 conjunts are in the unsatisfiable core [2022-07-22 20:47:16,902 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-22 20:47:16,932 INFO L134 CoverageAnalysis]: Checked inductivity of 102 backedges. 62 proven. 0 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2022-07-22 20:47:16,932 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-22 20:47:16,932 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1140549325] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-22 20:47:16,932 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-07-22 20:47:16,932 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [7] total 8 [2022-07-22 20:47:16,932 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1163277773] [2022-07-22 20:47:16,932 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-22 20:47:16,933 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-22 20:47:16,933 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-22 20:47:16,933 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-22 20:47:16,933 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2022-07-22 20:47:16,933 INFO L87 Difference]: Start difference. First operand 17507 states and 22555 transitions. Second operand has 3 states, 3 states have (on average 35.666666666666664) internal successors, (107), 3 states have internal predecessors, (107), 3 states have call successors, (10), 3 states have call predecessors, (10), 3 states have return successors, (9), 3 states have call predecessors, (9), 3 states have call successors, (9) [2022-07-22 20:47:18,470 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-22 20:47:18,470 INFO L93 Difference]: Finished difference Result 47490 states and 62539 transitions. [2022-07-22 20:47:18,470 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-22 20:47:18,470 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 35.666666666666664) internal successors, (107), 3 states have internal predecessors, (107), 3 states have call successors, (10), 3 states have call predecessors, (10), 3 states have return successors, (9), 3 states have call predecessors, (9), 3 states have call successors, (9) Word has length 161 [2022-07-22 20:47:18,471 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-22 20:47:18,544 INFO L225 Difference]: With dead ends: 47490 [2022-07-22 20:47:18,544 INFO L226 Difference]: Without dead ends: 32188 [2022-07-22 20:47:18,572 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 188 GetRequests, 182 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2022-07-22 20:47:18,573 INFO L413 NwaCegarLoop]: 357 mSDtfsCounter, 278 mSDsluCounter, 173 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 278 SdHoareTripleChecker+Valid, 530 SdHoareTripleChecker+Invalid, 13 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-22 20:47:18,573 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [278 Valid, 530 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-22 20:47:18,591 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32188 states. [2022-07-22 20:47:20,386 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32188 to 32004. [2022-07-22 20:47:20,407 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 32004 states, 27074 states have (on average 1.2708133264386496) internal successors, (34406), 27360 states have internal predecessors, (34406), 2659 states have call successors, (2659), 1984 states have call predecessors, (2659), 2269 states have return successors, (5013), 2675 states have call predecessors, (5013), 2656 states have call successors, (5013) [2022-07-22 20:47:20,464 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32004 states to 32004 states and 42078 transitions. [2022-07-22 20:47:20,468 INFO L78 Accepts]: Start accepts. Automaton has 32004 states and 42078 transitions. Word has length 161 [2022-07-22 20:47:20,468 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-22 20:47:20,468 INFO L495 AbstractCegarLoop]: Abstraction has 32004 states and 42078 transitions. [2022-07-22 20:47:20,468 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 35.666666666666664) internal successors, (107), 3 states have internal predecessors, (107), 3 states have call successors, (10), 3 states have call predecessors, (10), 3 states have return successors, (9), 3 states have call predecessors, (9), 3 states have call successors, (9) [2022-07-22 20:47:20,468 INFO L276 IsEmpty]: Start isEmpty. Operand 32004 states and 42078 transitions. [2022-07-22 20:47:20,488 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 162 [2022-07-22 20:47:20,488 INFO L187 NwaCegarLoop]: Found error trace [2022-07-22 20:47:20,489 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-22 20:47:20,505 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Forceful destruction successful, exit code 0 [2022-07-22 20:47:20,689 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable32 [2022-07-22 20:47:20,689 INFO L420 AbstractCegarLoop]: === Iteration 34 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-22 20:47:20,689 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 20:47:20,690 INFO L85 PathProgramCache]: Analyzing trace with hash 60308522, now seen corresponding path program 1 times [2022-07-22 20:47:20,690 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 20:47:20,690 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [559552038] [2022-07-22 20:47:20,690 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 20:47:20,690 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 20:47:20,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 20:47:20,704 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-07-22 20:47:20,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 20:47:20,710 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-07-22 20:47:20,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 20:47:20,717 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2022-07-22 20:47:20,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 20:47:20,720 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2022-07-22 20:47:20,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 20:47:20,721 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2022-07-22 20:47:20,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 20:47:20,722 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2022-07-22 20:47:20,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 20:47:20,723 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2022-07-22 20:47:20,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 20:47:20,724 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-07-22 20:47:20,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 20:47:20,726 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2022-07-22 20:47:20,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 20:47:20,733 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-07-22 20:47:20,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 20:47:20,738 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 146 [2022-07-22 20:47:20,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 20:47:20,739 INFO L134 CoverageAnalysis]: Checked inductivity of 102 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 102 trivial. 0 not checked. [2022-07-22 20:47:20,739 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-22 20:47:20,739 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [559552038] [2022-07-22 20:47:20,739 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [559552038] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-22 20:47:20,740 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-22 20:47:20,740 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-07-22 20:47:20,740 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [424630115] [2022-07-22 20:47:20,740 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-22 20:47:20,740 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-07-22 20:47:20,740 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-22 20:47:20,741 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-22 20:47:20,741 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-07-22 20:47:20,741 INFO L87 Difference]: Start difference. First operand 32004 states and 42078 transitions. Second operand has 5 states, 5 states have (on average 16.0) internal successors, (80), 3 states have internal predecessors, (80), 3 states have call successors, (9), 4 states have call predecessors, (9), 1 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) [2022-07-22 20:47:22,751 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-22 20:47:22,752 INFO L93 Difference]: Finished difference Result 58974 states and 77653 transitions. [2022-07-22 20:47:22,752 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-22 20:47:22,752 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 16.0) internal successors, (80), 3 states have internal predecessors, (80), 3 states have call successors, (9), 4 states have call predecessors, (9), 1 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) Word has length 161 [2022-07-22 20:47:22,752 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-22 20:47:22,826 INFO L225 Difference]: With dead ends: 58974 [2022-07-22 20:47:22,826 INFO L226 Difference]: Without dead ends: 29173 [2022-07-22 20:47:22,868 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 25 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2022-07-22 20:47:22,868 INFO L413 NwaCegarLoop]: 307 mSDtfsCounter, 416 mSDsluCounter, 311 mSDsCounter, 0 mSdLazyCounter, 254 mSolverCounterSat, 79 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 432 SdHoareTripleChecker+Valid, 618 SdHoareTripleChecker+Invalid, 333 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 79 IncrementalHoareTripleChecker+Valid, 254 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-07-22 20:47:22,869 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [432 Valid, 618 Invalid, 333 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [79 Valid, 254 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-07-22 20:47:22,884 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29173 states. [2022-07-22 20:47:24,845 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29173 to 26979. [2022-07-22 20:47:24,867 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 26979 states, 22783 states have (on average 1.2722644076723872) internal successors, (28986), 23235 states have internal predecessors, (28986), 2071 states have call successors, (2071), 1542 states have call predecessors, (2071), 2123 states have return successors, (4294), 2209 states have call predecessors, (4294), 2068 states have call successors, (4294) [2022-07-22 20:47:24,924 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26979 states to 26979 states and 35351 transitions. [2022-07-22 20:47:24,929 INFO L78 Accepts]: Start accepts. Automaton has 26979 states and 35351 transitions. Word has length 161 [2022-07-22 20:47:24,929 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-22 20:47:24,929 INFO L495 AbstractCegarLoop]: Abstraction has 26979 states and 35351 transitions. [2022-07-22 20:47:24,930 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 16.0) internal successors, (80), 3 states have internal predecessors, (80), 3 states have call successors, (9), 4 states have call predecessors, (9), 1 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) [2022-07-22 20:47:24,930 INFO L276 IsEmpty]: Start isEmpty. Operand 26979 states and 35351 transitions. [2022-07-22 20:47:24,949 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 164 [2022-07-22 20:47:24,950 INFO L187 NwaCegarLoop]: Found error trace [2022-07-22 20:47:24,950 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-22 20:47:24,950 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33 [2022-07-22 20:47:24,950 INFO L420 AbstractCegarLoop]: === Iteration 35 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-22 20:47:24,950 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 20:47:24,951 INFO L85 PathProgramCache]: Analyzing trace with hash -81101080, now seen corresponding path program 1 times [2022-07-22 20:47:24,951 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 20:47:24,951 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [763306833] [2022-07-22 20:47:24,951 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 20:47:24,951 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 20:47:24,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 20:47:24,964 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-07-22 20:47:24,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 20:47:25,037 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-07-22 20:47:25,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 20:47:25,043 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2022-07-22 20:47:25,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 20:47:25,068 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2022-07-22 20:47:25,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 20:47:25,070 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2022-07-22 20:47:25,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 20:47:25,071 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2022-07-22 20:47:25,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 20:47:25,072 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2022-07-22 20:47:25,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 20:47:25,074 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-07-22 20:47:25,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 20:47:25,076 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2022-07-22 20:47:25,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 20:47:25,078 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-07-22 20:47:25,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 20:47:25,080 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 148 [2022-07-22 20:47:25,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 20:47:25,081 INFO L134 CoverageAnalysis]: Checked inductivity of 103 backedges. 0 proven. 22 refuted. 0 times theorem prover too weak. 81 trivial. 0 not checked. [2022-07-22 20:47:25,081 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-22 20:47:25,081 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [763306833] [2022-07-22 20:47:25,081 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [763306833] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-22 20:47:25,083 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1589961435] [2022-07-22 20:47:25,083 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 20:47:25,083 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-22 20:47:25,083 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 20:47:25,084 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-22 20:47:25,085 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2022-07-22 20:47:25,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 20:47:25,164 INFO L263 TraceCheckSpWp]: Trace formula consists of 565 conjuncts, 3 conjunts are in the unsatisfiable core [2022-07-22 20:47:25,166 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-22 20:47:25,194 INFO L134 CoverageAnalysis]: Checked inductivity of 103 backedges. 95 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2022-07-22 20:47:25,194 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-22 20:47:25,194 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1589961435] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-22 20:47:25,194 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-07-22 20:47:25,195 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [7] total 8 [2022-07-22 20:47:25,195 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [357268230] [2022-07-22 20:47:25,195 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-22 20:47:25,195 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-22 20:47:25,195 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-22 20:47:25,195 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-22 20:47:25,196 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2022-07-22 20:47:25,196 INFO L87 Difference]: Start difference. First operand 26979 states and 35351 transitions. Second operand has 3 states, 3 states have (on average 44.666666666666664) internal successors, (134), 3 states have internal predecessors, (134), 3 states have call successors, (12), 3 states have call predecessors, (12), 3 states have return successors, (11), 3 states have call predecessors, (11), 3 states have call successors, (11) [2022-07-22 20:47:26,861 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-22 20:47:26,861 INFO L93 Difference]: Finished difference Result 44846 states and 61259 transitions. [2022-07-22 20:47:26,862 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-22 20:47:26,862 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 44.666666666666664) internal successors, (134), 3 states have internal predecessors, (134), 3 states have call successors, (12), 3 states have call predecessors, (12), 3 states have return successors, (11), 3 states have call predecessors, (11), 3 states have call successors, (11) Word has length 163 [2022-07-22 20:47:26,862 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-22 20:47:26,924 INFO L225 Difference]: With dead ends: 44846 [2022-07-22 20:47:26,924 INFO L226 Difference]: Without dead ends: 27045 [2022-07-22 20:47:26,952 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 190 GetRequests, 184 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2022-07-22 20:47:26,953 INFO L413 NwaCegarLoop]: 429 mSDtfsCounter, 138 mSDsluCounter, 284 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 138 SdHoareTripleChecker+Valid, 713 SdHoareTripleChecker+Invalid, 10 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-22 20:47:26,953 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [138 Valid, 713 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-22 20:47:26,968 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27045 states. [2022-07-22 20:47:28,555 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27045 to 26979. [2022-07-22 20:47:28,575 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 26979 states, 22783 states have (on average 1.2479919238028354) internal successors, (28433), 23235 states have internal predecessors, (28433), 2071 states have call successors, (2071), 1542 states have call predecessors, (2071), 2123 states have return successors, (4294), 2209 states have call predecessors, (4294), 2068 states have call successors, (4294) [2022-07-22 20:47:28,626 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26979 states to 26979 states and 34798 transitions. [2022-07-22 20:47:28,630 INFO L78 Accepts]: Start accepts. Automaton has 26979 states and 34798 transitions. Word has length 163 [2022-07-22 20:47:28,630 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-22 20:47:28,630 INFO L495 AbstractCegarLoop]: Abstraction has 26979 states and 34798 transitions. [2022-07-22 20:47:28,630 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 44.666666666666664) internal successors, (134), 3 states have internal predecessors, (134), 3 states have call successors, (12), 3 states have call predecessors, (12), 3 states have return successors, (11), 3 states have call predecessors, (11), 3 states have call successors, (11) [2022-07-22 20:47:28,631 INFO L276 IsEmpty]: Start isEmpty. Operand 26979 states and 34798 transitions. [2022-07-22 20:47:28,647 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 164 [2022-07-22 20:47:28,647 INFO L187 NwaCegarLoop]: Found error trace [2022-07-22 20:47:28,647 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-22 20:47:28,664 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Forceful destruction successful, exit code 0 [2022-07-22 20:47:28,864 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable34 [2022-07-22 20:47:28,864 INFO L420 AbstractCegarLoop]: === Iteration 36 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-22 20:47:28,865 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 20:47:28,865 INFO L85 PathProgramCache]: Analyzing trace with hash -929152312, now seen corresponding path program 1 times [2022-07-22 20:47:28,865 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 20:47:28,865 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [892701422] [2022-07-22 20:47:28,865 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 20:47:28,865 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 20:47:28,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 20:47:28,877 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-07-22 20:47:28,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 20:47:28,883 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-07-22 20:47:28,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 20:47:28,887 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2022-07-22 20:47:28,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 20:47:28,910 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2022-07-22 20:47:28,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 20:47:28,912 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2022-07-22 20:47:28,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 20:47:28,913 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2022-07-22 20:47:28,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 20:47:28,914 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2022-07-22 20:47:28,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 20:47:28,916 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-07-22 20:47:28,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 20:47:28,918 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2022-07-22 20:47:28,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 20:47:28,920 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-07-22 20:47:28,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 20:47:28,922 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 148 [2022-07-22 20:47:28,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 20:47:28,923 INFO L134 CoverageAnalysis]: Checked inductivity of 101 backedges. 0 proven. 20 refuted. 0 times theorem prover too weak. 81 trivial. 0 not checked. [2022-07-22 20:47:28,923 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-22 20:47:28,923 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [892701422] [2022-07-22 20:47:28,923 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [892701422] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-22 20:47:28,923 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [224789121] [2022-07-22 20:47:28,924 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 20:47:28,924 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-22 20:47:28,924 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 20:47:28,925 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-22 20:47:28,926 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2022-07-22 20:47:29,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 20:47:29,009 INFO L263 TraceCheckSpWp]: Trace formula consists of 571 conjuncts, 2 conjunts are in the unsatisfiable core [2022-07-22 20:47:29,011 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-22 20:47:29,067 INFO L134 CoverageAnalysis]: Checked inductivity of 101 backedges. 83 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2022-07-22 20:47:29,068 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-22 20:47:29,068 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [224789121] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-22 20:47:29,068 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-07-22 20:47:29,068 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [7] total 8 [2022-07-22 20:47:29,068 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [338418841] [2022-07-22 20:47:29,068 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-22 20:47:29,069 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-22 20:47:29,069 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-22 20:47:29,069 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-22 20:47:29,069 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2022-07-22 20:47:29,069 INFO L87 Difference]: Start difference. First operand 26979 states and 34798 transitions. Second operand has 3 states, 3 states have (on average 42.333333333333336) internal successors, (127), 3 states have internal predecessors, (127), 3 states have call successors, (11), 3 states have call predecessors, (11), 3 states have return successors, (10), 3 states have call predecessors, (10), 3 states have call successors, (10) [2022-07-22 20:47:30,802 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-22 20:47:30,802 INFO L93 Difference]: Finished difference Result 48806 states and 65023 transitions. [2022-07-22 20:47:30,803 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-22 20:47:30,803 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 42.333333333333336) internal successors, (127), 3 states have internal predecessors, (127), 3 states have call successors, (11), 3 states have call predecessors, (11), 3 states have return successors, (10), 3 states have call predecessors, (10), 3 states have call successors, (10) Word has length 163 [2022-07-22 20:47:30,803 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-22 20:47:30,866 INFO L225 Difference]: With dead ends: 48806 [2022-07-22 20:47:30,866 INFO L226 Difference]: Without dead ends: 26524 [2022-07-22 20:47:30,905 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 190 GetRequests, 184 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2022-07-22 20:47:30,906 INFO L413 NwaCegarLoop]: 313 mSDtfsCounter, 265 mSDsluCounter, 31 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 265 SdHoareTripleChecker+Valid, 344 SdHoareTripleChecker+Invalid, 12 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-22 20:47:30,906 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [265 Valid, 344 Invalid, 12 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-22 20:47:30,921 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26524 states. [2022-07-22 20:47:32,244 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26524 to 18133. [2022-07-22 20:47:32,257 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18133 states, 15366 states have (on average 1.2041520239489782) internal successors, (18503), 15648 states have internal predecessors, (18503), 1353 states have call successors, (1353), 1032 states have call predecessors, (1353), 1412 states have return successors, (2496), 1456 states have call predecessors, (2496), 1350 states have call successors, (2496) [2022-07-22 20:47:32,285 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18133 states to 18133 states and 22352 transitions. [2022-07-22 20:47:32,288 INFO L78 Accepts]: Start accepts. Automaton has 18133 states and 22352 transitions. Word has length 163 [2022-07-22 20:47:32,288 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-22 20:47:32,288 INFO L495 AbstractCegarLoop]: Abstraction has 18133 states and 22352 transitions. [2022-07-22 20:47:32,288 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 42.333333333333336) internal successors, (127), 3 states have internal predecessors, (127), 3 states have call successors, (11), 3 states have call predecessors, (11), 3 states have return successors, (10), 3 states have call predecessors, (10), 3 states have call successors, (10) [2022-07-22 20:47:32,289 INFO L276 IsEmpty]: Start isEmpty. Operand 18133 states and 22352 transitions. [2022-07-22 20:47:32,297 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 166 [2022-07-22 20:47:32,297 INFO L187 NwaCegarLoop]: Found error trace [2022-07-22 20:47:32,297 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-22 20:47:32,316 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Forceful destruction successful, exit code 0 [2022-07-22 20:47:32,497 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable35 [2022-07-22 20:47:32,498 INFO L420 AbstractCegarLoop]: === Iteration 37 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-22 20:47:32,498 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 20:47:32,498 INFO L85 PathProgramCache]: Analyzing trace with hash 282552368, now seen corresponding path program 1 times [2022-07-22 20:47:32,498 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 20:47:32,499 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1020479246] [2022-07-22 20:47:32,499 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 20:47:32,499 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 20:47:32,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 20:47:32,519 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-07-22 20:47:32,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 20:47:32,529 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-07-22 20:47:32,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 20:47:32,535 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2022-07-22 20:47:32,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 20:47:32,562 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2022-07-22 20:47:32,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 20:47:32,565 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2022-07-22 20:47:32,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 20:47:32,566 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2022-07-22 20:47:32,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 20:47:32,574 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2022-07-22 20:47:32,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 20:47:32,579 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-07-22 20:47:32,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 20:47:32,582 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 120 [2022-07-22 20:47:32,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 20:47:32,585 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-07-22 20:47:32,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 20:47:32,590 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 150 [2022-07-22 20:47:32,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 20:47:32,592 INFO L134 CoverageAnalysis]: Checked inductivity of 104 backedges. 0 proven. 22 refuted. 0 times theorem prover too weak. 82 trivial. 0 not checked. [2022-07-22 20:47:32,592 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-22 20:47:32,592 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1020479246] [2022-07-22 20:47:32,592 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1020479246] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-22 20:47:32,592 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [433065288] [2022-07-22 20:47:32,593 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 20:47:32,593 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-22 20:47:32,593 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 20:47:32,604 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-22 20:47:32,705 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Waiting until timeout for monitored process [2022-07-22 20:47:32,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 20:47:32,785 INFO L263 TraceCheckSpWp]: Trace formula consists of 566 conjuncts, 6 conjunts are in the unsatisfiable core [2022-07-22 20:47:32,787 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-22 20:47:32,868 INFO L134 CoverageAnalysis]: Checked inductivity of 104 backedges. 39 proven. 0 refuted. 0 times theorem prover too weak. 65 trivial. 0 not checked. [2022-07-22 20:47:32,869 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-22 20:47:32,869 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [433065288] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-22 20:47:32,869 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-07-22 20:47:32,869 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [7] total 10 [2022-07-22 20:47:32,869 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1784166412] [2022-07-22 20:47:32,869 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-22 20:47:32,870 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-07-22 20:47:32,870 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-22 20:47:32,871 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-22 20:47:32,871 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2022-07-22 20:47:32,872 INFO L87 Difference]: Start difference. First operand 18133 states and 22352 transitions. Second operand has 5 states, 5 states have (on average 20.0) internal successors, (100), 4 states have internal predecessors, (100), 2 states have call successors, (9), 3 states have call predecessors, (9), 4 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2022-07-22 20:47:34,263 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-22 20:47:34,264 INFO L93 Difference]: Finished difference Result 34065 states and 42439 transitions. [2022-07-22 20:47:34,264 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-22 20:47:34,264 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 20.0) internal successors, (100), 4 states have internal predecessors, (100), 2 states have call successors, (9), 3 states have call predecessors, (9), 4 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) Word has length 165 [2022-07-22 20:47:34,264 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-22 20:47:34,298 INFO L225 Difference]: With dead ends: 34065 [2022-07-22 20:47:34,298 INFO L226 Difference]: Without dead ends: 18133 [2022-07-22 20:47:34,316 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 193 GetRequests, 184 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=88, Unknown=0, NotChecked=0, Total=110 [2022-07-22 20:47:34,317 INFO L413 NwaCegarLoop]: 280 mSDtfsCounter, 352 mSDsluCounter, 293 mSDsCounter, 0 mSdLazyCounter, 214 mSolverCounterSat, 44 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 371 SdHoareTripleChecker+Valid, 573 SdHoareTripleChecker+Invalid, 258 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 44 IncrementalHoareTripleChecker+Valid, 214 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-22 20:47:34,317 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [371 Valid, 573 Invalid, 258 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [44 Valid, 214 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-22 20:47:34,326 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18133 states. [2022-07-22 20:47:35,736 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18133 to 18133. [2022-07-22 20:47:35,749 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18133 states, 15366 states have (on average 1.1799427307041521) internal successors, (18131), 15648 states have internal predecessors, (18131), 1353 states have call successors, (1353), 1032 states have call predecessors, (1353), 1412 states have return successors, (2496), 1456 states have call predecessors, (2496), 1350 states have call successors, (2496) [2022-07-22 20:47:35,781 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18133 states to 18133 states and 21980 transitions. [2022-07-22 20:47:35,783 INFO L78 Accepts]: Start accepts. Automaton has 18133 states and 21980 transitions. Word has length 165 [2022-07-22 20:47:35,783 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-22 20:47:35,784 INFO L495 AbstractCegarLoop]: Abstraction has 18133 states and 21980 transitions. [2022-07-22 20:47:35,784 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 20.0) internal successors, (100), 4 states have internal predecessors, (100), 2 states have call successors, (9), 3 states have call predecessors, (9), 4 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2022-07-22 20:47:35,784 INFO L276 IsEmpty]: Start isEmpty. Operand 18133 states and 21980 transitions. [2022-07-22 20:47:35,793 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 166 [2022-07-22 20:47:35,793 INFO L187 NwaCegarLoop]: Found error trace [2022-07-22 20:47:35,793 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-22 20:47:35,810 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Forceful destruction successful, exit code 0 [2022-07-22 20:47:35,995 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable36,15 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-22 20:47:35,995 INFO L420 AbstractCegarLoop]: === Iteration 38 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-22 20:47:35,995 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 20:47:35,995 INFO L85 PathProgramCache]: Analyzing trace with hash -810082834, now seen corresponding path program 1 times [2022-07-22 20:47:35,996 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 20:47:35,996 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [446104744] [2022-07-22 20:47:35,996 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 20:47:35,996 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 20:47:36,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 20:47:36,008 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-07-22 20:47:36,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 20:47:36,015 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-07-22 20:47:36,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 20:47:36,021 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2022-07-22 20:47:36,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 20:47:36,050 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2022-07-22 20:47:36,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 20:47:36,053 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2022-07-22 20:47:36,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 20:47:36,054 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2022-07-22 20:47:36,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 20:47:36,055 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2022-07-22 20:47:36,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 20:47:36,057 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-07-22 20:47:36,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 20:47:36,060 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 120 [2022-07-22 20:47:36,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 20:47:36,062 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-07-22 20:47:36,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 20:47:36,065 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 150 [2022-07-22 20:47:36,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 20:47:36,066 INFO L134 CoverageAnalysis]: Checked inductivity of 104 backedges. 0 proven. 22 refuted. 0 times theorem prover too weak. 82 trivial. 0 not checked. [2022-07-22 20:47:36,066 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-22 20:47:36,066 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [446104744] [2022-07-22 20:47:36,066 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [446104744] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-22 20:47:36,066 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [459402936] [2022-07-22 20:47:36,066 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 20:47:36,067 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-22 20:47:36,067 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 20:47:36,068 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-22 20:47:36,070 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Waiting until timeout for monitored process [2022-07-22 20:47:36,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 20:47:36,154 INFO L263 TraceCheckSpWp]: Trace formula consists of 563 conjuncts, 6 conjunts are in the unsatisfiable core [2022-07-22 20:47:36,157 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-22 20:47:36,223 INFO L134 CoverageAnalysis]: Checked inductivity of 104 backedges. 39 proven. 0 refuted. 0 times theorem prover too weak. 65 trivial. 0 not checked. [2022-07-22 20:47:36,223 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-22 20:47:36,223 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [459402936] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-22 20:47:36,224 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-07-22 20:47:36,224 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [7] total 10 [2022-07-22 20:47:36,224 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [796351493] [2022-07-22 20:47:36,224 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-22 20:47:36,226 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-07-22 20:47:36,226 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-22 20:47:36,226 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-22 20:47:36,226 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2022-07-22 20:47:36,226 INFO L87 Difference]: Start difference. First operand 18133 states and 21980 transitions. Second operand has 5 states, 5 states have (on average 20.0) internal successors, (100), 4 states have internal predecessors, (100), 2 states have call successors, (9), 3 states have call predecessors, (9), 4 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2022-07-22 20:47:37,586 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-22 20:47:37,586 INFO L93 Difference]: Finished difference Result 27073 states and 33157 transitions. [2022-07-22 20:47:37,587 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-22 20:47:37,587 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 20.0) internal successors, (100), 4 states have internal predecessors, (100), 2 states have call successors, (9), 3 states have call predecessors, (9), 4 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) Word has length 165 [2022-07-22 20:47:37,587 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-22 20:47:37,616 INFO L225 Difference]: With dead ends: 27073 [2022-07-22 20:47:37,616 INFO L226 Difference]: Without dead ends: 15711 [2022-07-22 20:47:37,631 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 193 GetRequests, 184 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=88, Unknown=0, NotChecked=0, Total=110 [2022-07-22 20:47:37,632 INFO L413 NwaCegarLoop]: 277 mSDtfsCounter, 348 mSDsluCounter, 289 mSDsCounter, 0 mSdLazyCounter, 214 mSolverCounterSat, 44 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 367 SdHoareTripleChecker+Valid, 566 SdHoareTripleChecker+Invalid, 258 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 44 IncrementalHoareTripleChecker+Valid, 214 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-22 20:47:37,632 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [367 Valid, 566 Invalid, 258 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [44 Valid, 214 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-22 20:47:37,640 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15711 states. [2022-07-22 20:47:38,668 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15711 to 12330. [2022-07-22 20:47:38,677 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12330 states, 10442 states have (on average 1.1630913618080827) internal successors, (12145), 10615 states have internal predecessors, (12145), 935 states have call successors, (935), 702 states have call predecessors, (935), 951 states have return successors, (1680), 1014 states have call predecessors, (1680), 932 states have call successors, (1680) [2022-07-22 20:47:38,697 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12330 states to 12330 states and 14760 transitions. [2022-07-22 20:47:38,699 INFO L78 Accepts]: Start accepts. Automaton has 12330 states and 14760 transitions. Word has length 165 [2022-07-22 20:47:38,699 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-22 20:47:38,699 INFO L495 AbstractCegarLoop]: Abstraction has 12330 states and 14760 transitions. [2022-07-22 20:47:38,699 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 20.0) internal successors, (100), 4 states have internal predecessors, (100), 2 states have call successors, (9), 3 states have call predecessors, (9), 4 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2022-07-22 20:47:38,699 INFO L276 IsEmpty]: Start isEmpty. Operand 12330 states and 14760 transitions. [2022-07-22 20:47:38,704 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 166 [2022-07-22 20:47:38,704 INFO L187 NwaCegarLoop]: Found error trace [2022-07-22 20:47:38,705 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-22 20:47:38,721 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Forceful destruction successful, exit code 0 [2022-07-22 20:47:38,905 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable37 [2022-07-22 20:47:38,905 INFO L420 AbstractCegarLoop]: === Iteration 39 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-22 20:47:38,906 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 20:47:38,906 INFO L85 PathProgramCache]: Analyzing trace with hash -322035728, now seen corresponding path program 1 times [2022-07-22 20:47:38,906 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 20:47:38,906 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1833487234] [2022-07-22 20:47:38,906 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 20:47:38,906 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 20:47:38,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 20:47:38,917 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-07-22 20:47:38,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 20:47:38,925 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-07-22 20:47:38,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 20:47:38,930 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2022-07-22 20:47:38,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 20:47:38,953 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2022-07-22 20:47:38,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 20:47:38,955 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2022-07-22 20:47:38,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 20:47:38,956 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2022-07-22 20:47:38,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 20:47:38,956 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2022-07-22 20:47:38,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 20:47:38,959 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-07-22 20:47:38,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 20:47:38,960 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 120 [2022-07-22 20:47:38,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 20:47:38,963 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-07-22 20:47:38,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 20:47:38,964 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 150 [2022-07-22 20:47:38,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 20:47:38,965 INFO L134 CoverageAnalysis]: Checked inductivity of 104 backedges. 0 proven. 22 refuted. 0 times theorem prover too weak. 82 trivial. 0 not checked. [2022-07-22 20:47:38,966 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-22 20:47:38,966 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1833487234] [2022-07-22 20:47:38,966 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1833487234] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-22 20:47:38,966 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [357336944] [2022-07-22 20:47:38,966 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 20:47:38,966 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-22 20:47:38,966 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 20:47:38,967 INFO L229 MonitoredProcess]: Starting monitored process 17 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-22 20:47:38,969 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Waiting until timeout for monitored process [2022-07-22 20:47:39,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 20:47:39,045 INFO L263 TraceCheckSpWp]: Trace formula consists of 560 conjuncts, 7 conjunts are in the unsatisfiable core [2022-07-22 20:47:39,047 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-22 20:47:39,068 INFO L134 CoverageAnalysis]: Checked inductivity of 104 backedges. 23 proven. 0 refuted. 0 times theorem prover too weak. 81 trivial. 0 not checked. [2022-07-22 20:47:39,068 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-22 20:47:39,068 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [357336944] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-22 20:47:39,068 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-07-22 20:47:39,068 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [7] total 7 [2022-07-22 20:47:39,068 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1562669093] [2022-07-22 20:47:39,068 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-22 20:47:39,068 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-07-22 20:47:39,068 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-22 20:47:39,069 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-22 20:47:39,069 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-07-22 20:47:39,069 INFO L87 Difference]: Start difference. First operand 12330 states and 14760 transitions. Second operand has 5 states, 5 states have (on average 18.8) internal successors, (94), 5 states have internal predecessors, (94), 2 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2022-07-22 20:47:40,059 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-22 20:47:40,060 INFO L93 Difference]: Finished difference Result 22316 states and 27242 transitions. [2022-07-22 20:47:40,060 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-07-22 20:47:40,060 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 18.8) internal successors, (94), 5 states have internal predecessors, (94), 2 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) Word has length 165 [2022-07-22 20:47:40,060 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-22 20:47:40,081 INFO L225 Difference]: With dead ends: 22316 [2022-07-22 20:47:40,081 INFO L226 Difference]: Without dead ends: 12189 [2022-07-22 20:47:40,094 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 194 GetRequests, 185 SyntacticMatches, 2 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2022-07-22 20:47:40,094 INFO L413 NwaCegarLoop]: 305 mSDtfsCounter, 49 mSDsluCounter, 929 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 49 SdHoareTripleChecker+Valid, 1234 SdHoareTripleChecker+Invalid, 14 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-22 20:47:40,095 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [49 Valid, 1234 Invalid, 14 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-22 20:47:40,101 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12189 states. [2022-07-22 20:47:41,006 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12189 to 11933. [2022-07-22 20:47:41,014 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11933 states, 10063 states have (on average 1.1470734373447282) internal successors, (11543), 10225 states have internal predecessors, (11543), 935 states have call successors, (935), 702 states have call predecessors, (935), 933 states have return successors, (1572), 1007 states have call predecessors, (1572), 932 states have call successors, (1572) [2022-07-22 20:47:41,030 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11933 states to 11933 states and 14050 transitions. [2022-07-22 20:47:41,032 INFO L78 Accepts]: Start accepts. Automaton has 11933 states and 14050 transitions. Word has length 165 [2022-07-22 20:47:41,032 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-22 20:47:41,032 INFO L495 AbstractCegarLoop]: Abstraction has 11933 states and 14050 transitions. [2022-07-22 20:47:41,033 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 18.8) internal successors, (94), 5 states have internal predecessors, (94), 2 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2022-07-22 20:47:41,033 INFO L276 IsEmpty]: Start isEmpty. Operand 11933 states and 14050 transitions. [2022-07-22 20:47:41,037 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 166 [2022-07-22 20:47:41,037 INFO L187 NwaCegarLoop]: Found error trace [2022-07-22 20:47:41,037 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-22 20:47:41,054 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Forceful destruction successful, exit code 0 [2022-07-22 20:47:41,238 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable38 [2022-07-22 20:47:41,238 INFO L420 AbstractCegarLoop]: === Iteration 40 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-22 20:47:41,238 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 20:47:41,239 INFO L85 PathProgramCache]: Analyzing trace with hash -490424150, now seen corresponding path program 1 times [2022-07-22 20:47:41,239 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 20:47:41,239 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1317259582] [2022-07-22 20:47:41,239 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 20:47:41,239 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 20:47:41,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 20:47:41,249 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-07-22 20:47:41,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 20:47:41,256 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-07-22 20:47:41,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 20:47:41,264 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2022-07-22 20:47:41,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 20:47:41,286 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2022-07-22 20:47:41,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 20:47:41,287 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2022-07-22 20:47:41,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 20:47:41,288 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2022-07-22 20:47:41,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 20:47:41,289 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2022-07-22 20:47:41,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 20:47:41,291 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-07-22 20:47:41,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 20:47:41,293 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 120 [2022-07-22 20:47:41,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 20:47:41,295 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-07-22 20:47:41,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 20:47:41,296 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 150 [2022-07-22 20:47:41,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 20:47:41,297 INFO L134 CoverageAnalysis]: Checked inductivity of 104 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 94 trivial. 0 not checked. [2022-07-22 20:47:41,297 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-22 20:47:41,297 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1317259582] [2022-07-22 20:47:41,297 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1317259582] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-22 20:47:41,298 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [885556325] [2022-07-22 20:47:41,298 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 20:47:41,298 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-22 20:47:41,298 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 20:47:41,299 INFO L229 MonitoredProcess]: Starting monitored process 18 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-22 20:47:41,300 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Waiting until timeout for monitored process [2022-07-22 20:47:41,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 20:47:41,381 INFO L263 TraceCheckSpWp]: Trace formula consists of 557 conjuncts, 7 conjunts are in the unsatisfiable core [2022-07-22 20:47:41,383 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-22 20:47:41,403 INFO L134 CoverageAnalysis]: Checked inductivity of 104 backedges. 35 proven. 0 refuted. 0 times theorem prover too weak. 69 trivial. 0 not checked. [2022-07-22 20:47:41,403 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-22 20:47:41,403 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [885556325] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-22 20:47:41,403 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-07-22 20:47:41,403 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [7] total 7 [2022-07-22 20:47:41,403 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1120406011] [2022-07-22 20:47:41,403 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-22 20:47:41,403 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-07-22 20:47:41,404 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-22 20:47:41,404 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-22 20:47:41,404 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-07-22 20:47:41,404 INFO L87 Difference]: Start difference. First operand 11933 states and 14050 transitions. Second operand has 5 states, 5 states have (on average 19.8) internal successors, (99), 5 states have internal predecessors, (99), 2 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2022-07-22 20:47:42,261 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-22 20:47:42,261 INFO L93 Difference]: Finished difference Result 18276 states and 21782 transitions. [2022-07-22 20:47:42,261 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-07-22 20:47:42,262 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 19.8) internal successors, (99), 5 states have internal predecessors, (99), 2 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) Word has length 165 [2022-07-22 20:47:42,262 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-22 20:47:42,279 INFO L225 Difference]: With dead ends: 18276 [2022-07-22 20:47:42,279 INFO L226 Difference]: Without dead ends: 8543 [2022-07-22 20:47:42,292 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 194 GetRequests, 185 SyntacticMatches, 2 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2022-07-22 20:47:42,293 INFO L413 NwaCegarLoop]: 305 mSDtfsCounter, 10 mSDsluCounter, 914 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 1219 SdHoareTripleChecker+Invalid, 14 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-22 20:47:42,293 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [10 Valid, 1219 Invalid, 14 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-22 20:47:42,298 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8543 states. [2022-07-22 20:47:43,035 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8543 to 8507. [2022-07-22 20:47:43,040 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8507 states, 7210 states have (on average 1.1402219140083218) internal successors, (8221), 7284 states have internal predecessors, (8221), 664 states have call successors, (664), 502 states have call predecessors, (664), 631 states have return successors, (965), 721 states have call predecessors, (965), 661 states have call successors, (965) [2022-07-22 20:47:43,051 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8507 states to 8507 states and 9850 transitions. [2022-07-22 20:47:43,052 INFO L78 Accepts]: Start accepts. Automaton has 8507 states and 9850 transitions. Word has length 165 [2022-07-22 20:47:43,052 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-22 20:47:43,052 INFO L495 AbstractCegarLoop]: Abstraction has 8507 states and 9850 transitions. [2022-07-22 20:47:43,052 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 19.8) internal successors, (99), 5 states have internal predecessors, (99), 2 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2022-07-22 20:47:43,052 INFO L276 IsEmpty]: Start isEmpty. Operand 8507 states and 9850 transitions. [2022-07-22 20:47:43,056 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 201 [2022-07-22 20:47:43,056 INFO L187 NwaCegarLoop]: Found error trace [2022-07-22 20:47:43,057 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-22 20:47:43,074 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Forceful destruction successful, exit code 0 [2022-07-22 20:47:43,257 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 18 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable39 [2022-07-22 20:47:43,257 INFO L420 AbstractCegarLoop]: === Iteration 41 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-22 20:47:43,257 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 20:47:43,258 INFO L85 PathProgramCache]: Analyzing trace with hash 994864062, now seen corresponding path program 1 times [2022-07-22 20:47:43,258 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 20:47:43,258 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1293726847] [2022-07-22 20:47:43,258 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 20:47:43,258 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 20:47:43,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 20:47:43,282 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-07-22 20:47:43,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 20:47:43,291 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-07-22 20:47:43,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 20:47:43,298 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2022-07-22 20:47:43,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 20:47:43,300 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2022-07-22 20:47:43,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 20:47:43,301 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2022-07-22 20:47:43,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 20:47:43,302 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2022-07-22 20:47:43,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 20:47:43,304 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-07-22 20:47:43,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 20:47:43,305 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2022-07-22 20:47:43,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 20:47:43,310 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 121 [2022-07-22 20:47:43,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 20:47:43,313 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-07-22 20:47:43,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 20:47:43,315 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 155 [2022-07-22 20:47:43,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 20:47:43,318 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-07-22 20:47:43,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 20:47:43,319 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 185 [2022-07-22 20:47:43,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 20:47:43,321 INFO L134 CoverageAnalysis]: Checked inductivity of 169 backedges. 29 proven. 3 refuted. 0 times theorem prover too weak. 137 trivial. 0 not checked. [2022-07-22 20:47:43,321 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-22 20:47:43,321 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1293726847] [2022-07-22 20:47:43,321 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1293726847] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-22 20:47:43,321 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1601755552] [2022-07-22 20:47:43,321 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 20:47:43,321 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-22 20:47:43,321 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 20:47:43,323 INFO L229 MonitoredProcess]: Starting monitored process 19 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-22 20:47:43,324 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Waiting until timeout for monitored process [2022-07-22 20:47:43,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 20:47:43,411 INFO L263 TraceCheckSpWp]: Trace formula consists of 643 conjuncts, 2 conjunts are in the unsatisfiable core [2022-07-22 20:47:43,414 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-22 20:47:43,429 INFO L134 CoverageAnalysis]: Checked inductivity of 169 backedges. 120 proven. 0 refuted. 0 times theorem prover too weak. 49 trivial. 0 not checked. [2022-07-22 20:47:43,429 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-22 20:47:43,429 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1601755552] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-22 20:47:43,429 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-07-22 20:47:43,429 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [7] total 8 [2022-07-22 20:47:43,430 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1322007758] [2022-07-22 20:47:43,430 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-22 20:47:43,430 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-22 20:47:43,430 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-22 20:47:43,430 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-22 20:47:43,430 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2022-07-22 20:47:43,430 INFO L87 Difference]: Start difference. First operand 8507 states and 9850 transitions. Second operand has 3 states, 3 states have (on average 44.666666666666664) internal successors, (134), 3 states have internal predecessors, (134), 3 states have call successors, (13), 3 states have call predecessors, (13), 2 states have return successors, (12), 2 states have call predecessors, (12), 3 states have call successors, (12) [2022-07-22 20:47:43,802 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-22 20:47:43,802 INFO L93 Difference]: Finished difference Result 10600 states and 12240 transitions. [2022-07-22 20:47:43,802 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-22 20:47:43,803 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 44.666666666666664) internal successors, (134), 3 states have internal predecessors, (134), 3 states have call successors, (13), 3 states have call predecessors, (13), 2 states have return successors, (12), 2 states have call predecessors, (12), 3 states have call successors, (12) Word has length 200 [2022-07-22 20:47:43,803 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-22 20:47:43,809 INFO L225 Difference]: With dead ends: 10600 [2022-07-22 20:47:43,809 INFO L226 Difference]: Without dead ends: 4221 [2022-07-22 20:47:43,817 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 230 GetRequests, 224 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2022-07-22 20:47:43,818 INFO L413 NwaCegarLoop]: 394 mSDtfsCounter, 135 mSDsluCounter, 273 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 135 SdHoareTripleChecker+Valid, 667 SdHoareTripleChecker+Invalid, 9 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-22 20:47:43,818 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [135 Valid, 667 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-22 20:47:43,820 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4221 states. [2022-07-22 20:47:44,105 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4221 to 4221. [2022-07-22 20:47:44,107 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4221 states, 3526 states have (on average 1.136415201361316) internal successors, (4007), 3555 states have internal predecessors, (4007), 362 states have call successors, (362), 268 states have call predecessors, (362), 331 states have return successors, (464), 398 states have call predecessors, (464), 359 states have call successors, (464) [2022-07-22 20:47:44,111 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4221 states to 4221 states and 4833 transitions. [2022-07-22 20:47:44,112 INFO L78 Accepts]: Start accepts. Automaton has 4221 states and 4833 transitions. Word has length 200 [2022-07-22 20:47:44,112 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-22 20:47:44,112 INFO L495 AbstractCegarLoop]: Abstraction has 4221 states and 4833 transitions. [2022-07-22 20:47:44,112 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 44.666666666666664) internal successors, (134), 3 states have internal predecessors, (134), 3 states have call successors, (13), 3 states have call predecessors, (13), 2 states have return successors, (12), 2 states have call predecessors, (12), 3 states have call successors, (12) [2022-07-22 20:47:44,112 INFO L276 IsEmpty]: Start isEmpty. Operand 4221 states and 4833 transitions. [2022-07-22 20:47:44,114 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 202 [2022-07-22 20:47:44,114 INFO L187 NwaCegarLoop]: Found error trace [2022-07-22 20:47:44,115 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-22 20:47:44,132 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Forceful destruction successful, exit code 0 [2022-07-22 20:47:44,315 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable40,19 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-22 20:47:44,315 INFO L420 AbstractCegarLoop]: === Iteration 42 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-22 20:47:44,316 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 20:47:44,316 INFO L85 PathProgramCache]: Analyzing trace with hash 1498322473, now seen corresponding path program 1 times [2022-07-22 20:47:44,316 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 20:47:44,316 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2094392724] [2022-07-22 20:47:44,316 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 20:47:44,316 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 20:47:44,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 20:47:44,334 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-07-22 20:47:44,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 20:47:44,340 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-07-22 20:47:44,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 20:47:44,345 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2022-07-22 20:47:44,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 20:47:44,347 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2022-07-22 20:47:44,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 20:47:44,348 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2022-07-22 20:47:44,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 20:47:44,348 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2022-07-22 20:47:44,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 20:47:44,349 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2022-07-22 20:47:44,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 20:47:44,353 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-07-22 20:47:44,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 20:47:44,357 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2022-07-22 20:47:44,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 20:47:44,363 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-07-22 20:47:44,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 20:47:44,371 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 156 [2022-07-22 20:47:44,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 20:47:44,375 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-07-22 20:47:44,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 20:47:44,378 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 186 [2022-07-22 20:47:44,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 20:47:44,379 INFO L134 CoverageAnalysis]: Checked inductivity of 170 backedges. 53 proven. 41 refuted. 0 times theorem prover too weak. 76 trivial. 0 not checked. [2022-07-22 20:47:44,379 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-22 20:47:44,379 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2094392724] [2022-07-22 20:47:44,379 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2094392724] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-22 20:47:44,379 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1501448373] [2022-07-22 20:47:44,379 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 20:47:44,380 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-22 20:47:44,380 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 20:47:44,381 INFO L229 MonitoredProcess]: Starting monitored process 20 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-22 20:47:44,382 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Waiting until timeout for monitored process [2022-07-22 20:47:44,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 20:47:44,466 INFO L263 TraceCheckSpWp]: Trace formula consists of 655 conjuncts, 3 conjunts are in the unsatisfiable core [2022-07-22 20:47:44,468 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-22 20:47:44,530 INFO L134 CoverageAnalysis]: Checked inductivity of 170 backedges. 147 proven. 0 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2022-07-22 20:47:44,530 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-22 20:47:44,531 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1501448373] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-22 20:47:44,531 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-07-22 20:47:44,531 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [6] total 6 [2022-07-22 20:47:44,531 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2074120711] [2022-07-22 20:47:44,531 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-22 20:47:44,531 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-22 20:47:44,532 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-22 20:47:44,532 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-22 20:47:44,532 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-22 20:47:44,532 INFO L87 Difference]: Start difference. First operand 4221 states and 4833 transitions. Second operand has 3 states, 3 states have (on average 52.666666666666664) internal successors, (158), 3 states have internal predecessors, (158), 3 states have call successors, (13), 3 states have call predecessors, (13), 3 states have return successors, (13), 3 states have call predecessors, (13), 3 states have call successors, (13) [2022-07-22 20:47:44,842 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-22 20:47:44,842 INFO L93 Difference]: Finished difference Result 5724 states and 6542 transitions. [2022-07-22 20:47:44,842 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-22 20:47:44,843 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 52.666666666666664) internal successors, (158), 3 states have internal predecessors, (158), 3 states have call successors, (13), 3 states have call predecessors, (13), 3 states have return successors, (13), 3 states have call predecessors, (13), 3 states have call successors, (13) Word has length 201 [2022-07-22 20:47:44,843 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-22 20:47:44,849 INFO L225 Difference]: With dead ends: 5724 [2022-07-22 20:47:44,849 INFO L226 Difference]: Without dead ends: 4221 [2022-07-22 20:47:44,851 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 231 GetRequests, 225 SyntacticMatches, 2 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-22 20:47:44,851 INFO L413 NwaCegarLoop]: 376 mSDtfsCounter, 103 mSDsluCounter, 244 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 103 SdHoareTripleChecker+Valid, 620 SdHoareTripleChecker+Invalid, 8 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-22 20:47:44,851 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [103 Valid, 620 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-22 20:47:44,853 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4221 states. [2022-07-22 20:47:45,137 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4221 to 4221. [2022-07-22 20:47:45,140 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4221 states, 3526 states have (on average 1.131310266591038) internal successors, (3989), 3555 states have internal predecessors, (3989), 362 states have call successors, (362), 268 states have call predecessors, (362), 331 states have return successors, (464), 398 states have call predecessors, (464), 359 states have call successors, (464) [2022-07-22 20:47:45,144 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4221 states to 4221 states and 4815 transitions. [2022-07-22 20:47:45,145 INFO L78 Accepts]: Start accepts. Automaton has 4221 states and 4815 transitions. Word has length 201 [2022-07-22 20:47:45,145 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-22 20:47:45,145 INFO L495 AbstractCegarLoop]: Abstraction has 4221 states and 4815 transitions. [2022-07-22 20:47:45,145 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 52.666666666666664) internal successors, (158), 3 states have internal predecessors, (158), 3 states have call successors, (13), 3 states have call predecessors, (13), 3 states have return successors, (13), 3 states have call predecessors, (13), 3 states have call successors, (13) [2022-07-22 20:47:45,145 INFO L276 IsEmpty]: Start isEmpty. Operand 4221 states and 4815 transitions. [2022-07-22 20:47:45,147 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 204 [2022-07-22 20:47:45,147 INFO L187 NwaCegarLoop]: Found error trace [2022-07-22 20:47:45,147 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-22 20:47:45,164 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Forceful destruction successful, exit code 0 [2022-07-22 20:47:45,348 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable41,20 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-22 20:47:45,348 INFO L420 AbstractCegarLoop]: === Iteration 43 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-22 20:47:45,348 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 20:47:45,348 INFO L85 PathProgramCache]: Analyzing trace with hash -1332935587, now seen corresponding path program 1 times [2022-07-22 20:47:45,348 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 20:47:45,348 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1476075888] [2022-07-22 20:47:45,349 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 20:47:45,349 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 20:47:45,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 20:47:45,404 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-07-22 20:47:45,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 20:47:45,414 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-07-22 20:47:45,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 20:47:45,422 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2022-07-22 20:47:45,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 20:47:45,423 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2022-07-22 20:47:45,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 20:47:45,424 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2022-07-22 20:47:45,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 20:47:45,425 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2022-07-22 20:47:45,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 20:47:45,426 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2022-07-22 20:47:45,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 20:47:45,430 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-07-22 20:47:45,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 20:47:45,440 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2022-07-22 20:47:45,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 20:47:45,443 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-07-22 20:47:45,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 20:47:45,444 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 157 [2022-07-22 20:47:45,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 20:47:45,447 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-07-22 20:47:45,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 20:47:45,448 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 188 [2022-07-22 20:47:45,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 20:47:45,449 INFO L134 CoverageAnalysis]: Checked inductivity of 173 backedges. 25 proven. 0 refuted. 0 times theorem prover too weak. 148 trivial. 0 not checked. [2022-07-22 20:47:45,450 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-22 20:47:45,450 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1476075888] [2022-07-22 20:47:45,450 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1476075888] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-22 20:47:45,450 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-22 20:47:45,450 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-07-22 20:47:45,450 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [492779405] [2022-07-22 20:47:45,450 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-22 20:47:45,451 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-07-22 20:47:45,451 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-22 20:47:45,451 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-07-22 20:47:45,451 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-07-22 20:47:45,451 INFO L87 Difference]: Start difference. First operand 4221 states and 4815 transitions. Second operand has 7 states, 7 states have (on average 16.0) internal successors, (112), 5 states have internal predecessors, (112), 6 states have call successors, (11), 4 states have call predecessors, (11), 1 states have return successors, (10), 4 states have call predecessors, (10), 5 states have call successors, (10) [2022-07-22 20:47:46,378 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-22 20:47:46,378 INFO L93 Difference]: Finished difference Result 4499 states and 5108 transitions. [2022-07-22 20:47:46,378 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-07-22 20:47:46,379 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 16.0) internal successors, (112), 5 states have internal predecessors, (112), 6 states have call successors, (11), 4 states have call predecessors, (11), 1 states have return successors, (10), 4 states have call predecessors, (10), 5 states have call successors, (10) Word has length 203 [2022-07-22 20:47:46,379 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-22 20:47:46,384 INFO L225 Difference]: With dead ends: 4499 [2022-07-22 20:47:46,384 INFO L226 Difference]: Without dead ends: 4456 [2022-07-22 20:47:46,385 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 36 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=56, Invalid=184, Unknown=0, NotChecked=0, Total=240 [2022-07-22 20:47:46,386 INFO L413 NwaCegarLoop]: 454 mSDtfsCounter, 888 mSDsluCounter, 789 mSDsCounter, 0 mSdLazyCounter, 928 mSolverCounterSat, 117 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 931 SdHoareTripleChecker+Valid, 1243 SdHoareTripleChecker+Invalid, 1045 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 117 IncrementalHoareTripleChecker+Valid, 928 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-07-22 20:47:46,386 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [931 Valid, 1243 Invalid, 1045 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [117 Valid, 928 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-07-22 20:47:46,387 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4456 states. [2022-07-22 20:47:46,698 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4456 to 4152. [2022-07-22 20:47:46,700 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4152 states, 3468 states have (on average 1.130334486735871) internal successors, (3920), 3497 states have internal predecessors, (3920), 355 states have call successors, (355), 263 states have call predecessors, (355), 327 states have return successors, (459), 392 states have call predecessors, (459), 353 states have call successors, (459) [2022-07-22 20:47:46,704 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4152 states to 4152 states and 4734 transitions. [2022-07-22 20:47:46,705 INFO L78 Accepts]: Start accepts. Automaton has 4152 states and 4734 transitions. Word has length 203 [2022-07-22 20:47:46,706 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-22 20:47:46,707 INFO L495 AbstractCegarLoop]: Abstraction has 4152 states and 4734 transitions. [2022-07-22 20:47:46,707 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 16.0) internal successors, (112), 5 states have internal predecessors, (112), 6 states have call successors, (11), 4 states have call predecessors, (11), 1 states have return successors, (10), 4 states have call predecessors, (10), 5 states have call successors, (10) [2022-07-22 20:47:46,707 INFO L276 IsEmpty]: Start isEmpty. Operand 4152 states and 4734 transitions. [2022-07-22 20:47:46,709 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 208 [2022-07-22 20:47:46,709 INFO L187 NwaCegarLoop]: Found error trace [2022-07-22 20:47:46,709 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-22 20:47:46,709 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable42 [2022-07-22 20:47:46,709 INFO L420 AbstractCegarLoop]: === Iteration 44 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-22 20:47:46,710 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 20:47:46,710 INFO L85 PathProgramCache]: Analyzing trace with hash 424573701, now seen corresponding path program 1 times [2022-07-22 20:47:46,710 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 20:47:46,710 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [318330023] [2022-07-22 20:47:46,710 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 20:47:46,710 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 20:47:46,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 20:47:46,732 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-07-22 20:47:46,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 20:47:46,739 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-07-22 20:47:46,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 20:47:46,743 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2022-07-22 20:47:46,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 20:47:46,745 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2022-07-22 20:47:46,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 20:47:46,746 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2022-07-22 20:47:46,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 20:47:46,747 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2022-07-22 20:47:46,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 20:47:46,747 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2022-07-22 20:47:46,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 20:47:46,749 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-07-22 20:47:46,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 20:47:46,751 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2022-07-22 20:47:46,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 20:47:46,753 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-07-22 20:47:46,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 20:47:46,754 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 157 [2022-07-22 20:47:46,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 20:47:46,756 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-07-22 20:47:46,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 20:47:46,757 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 188 [2022-07-22 20:47:46,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 20:47:46,758 INFO L134 CoverageAnalysis]: Checked inductivity of 173 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 173 trivial. 0 not checked. [2022-07-22 20:47:46,759 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-22 20:47:46,759 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [318330023] [2022-07-22 20:47:46,759 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [318330023] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-22 20:47:46,759 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-22 20:47:46,759 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-07-22 20:47:46,759 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1394095185] [2022-07-22 20:47:46,759 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-22 20:47:46,760 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-07-22 20:47:46,760 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-22 20:47:46,760 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-22 20:47:46,760 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-07-22 20:47:46,760 INFO L87 Difference]: Start difference. First operand 4152 states and 4734 transitions. Second operand has 5 states, 5 states have (on average 20.2) internal successors, (101), 3 states have internal predecessors, (101), 3 states have call successors, (10), 4 states have call predecessors, (10), 1 states have return successors, (9), 1 states have call predecessors, (9), 2 states have call successors, (9) [2022-07-22 20:47:47,334 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-22 20:47:47,334 INFO L93 Difference]: Finished difference Result 5472 states and 6267 transitions. [2022-07-22 20:47:47,334 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-07-22 20:47:47,335 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 20.2) internal successors, (101), 3 states have internal predecessors, (101), 3 states have call successors, (10), 4 states have call predecessors, (10), 1 states have return successors, (9), 1 states have call predecessors, (9), 2 states have call successors, (9) Word has length 207 [2022-07-22 20:47:47,335 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-22 20:47:47,342 INFO L225 Difference]: With dead ends: 5472 [2022-07-22 20:47:47,342 INFO L226 Difference]: Without dead ends: 4531 [2022-07-22 20:47:47,343 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-07-22 20:47:47,346 INFO L413 NwaCegarLoop]: 356 mSDtfsCounter, 296 mSDsluCounter, 495 mSDsCounter, 0 mSdLazyCounter, 350 mSolverCounterSat, 61 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 309 SdHoareTripleChecker+Valid, 851 SdHoareTripleChecker+Invalid, 411 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 61 IncrementalHoareTripleChecker+Valid, 350 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-07-22 20:47:47,346 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [309 Valid, 851 Invalid, 411 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [61 Valid, 350 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-07-22 20:47:47,348 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4531 states. [2022-07-22 20:47:47,661 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4531 to 4154. [2022-07-22 20:47:47,663 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4154 states, 3470 states have (on average 1.1302593659942364) internal successors, (3922), 3499 states have internal predecessors, (3922), 355 states have call successors, (355), 263 states have call predecessors, (355), 327 states have return successors, (459), 392 states have call predecessors, (459), 353 states have call successors, (459) [2022-07-22 20:47:47,668 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4154 states to 4154 states and 4736 transitions. [2022-07-22 20:47:47,668 INFO L78 Accepts]: Start accepts. Automaton has 4154 states and 4736 transitions. Word has length 207 [2022-07-22 20:47:47,668 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-22 20:47:47,669 INFO L495 AbstractCegarLoop]: Abstraction has 4154 states and 4736 transitions. [2022-07-22 20:47:47,669 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 20.2) internal successors, (101), 3 states have internal predecessors, (101), 3 states have call successors, (10), 4 states have call predecessors, (10), 1 states have return successors, (9), 1 states have call predecessors, (9), 2 states have call successors, (9) [2022-07-22 20:47:47,669 INFO L276 IsEmpty]: Start isEmpty. Operand 4154 states and 4736 transitions. [2022-07-22 20:47:47,671 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 209 [2022-07-22 20:47:47,671 INFO L187 NwaCegarLoop]: Found error trace [2022-07-22 20:47:47,671 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-22 20:47:47,671 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable43 [2022-07-22 20:47:47,671 INFO L420 AbstractCegarLoop]: === Iteration 45 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-22 20:47:47,671 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 20:47:47,671 INFO L85 PathProgramCache]: Analyzing trace with hash 1505939270, now seen corresponding path program 1 times [2022-07-22 20:47:47,671 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 20:47:47,671 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1950932453] [2022-07-22 20:47:47,671 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 20:47:47,672 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 20:47:47,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 20:47:47,682 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-22 20:47:47,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 20:47:47,742 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-22 20:47:47,742 INFO L271 BasicCegarLoop]: Counterexample is feasible [2022-07-22 20:47:47,743 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location error2Err0ASSERT_VIOLATIONERROR_FUNCTION (1 of 2 remaining) [2022-07-22 20:47:47,744 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location error1Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 2 remaining) [2022-07-22 20:47:47,744 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable44 [2022-07-22 20:47:47,746 INFO L356 BasicCegarLoop]: Path program histogram: [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-22 20:47:47,749 INFO L176 ceAbstractionStarter]: Computing trace abstraction results [2022-07-22 20:47:47,874 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 22.07 08:47:47 BoogieIcfgContainer [2022-07-22 20:47:47,874 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-07-22 20:47:47,875 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-07-22 20:47:47,875 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-07-22 20:47:47,875 INFO L275 PluginConnector]: Witness Printer initialized [2022-07-22 20:47:47,875 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.07 08:46:40" (3/4) ... [2022-07-22 20:47:47,876 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2022-07-22 20:47:47,991 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2022-07-22 20:47:47,992 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-07-22 20:47:47,993 INFO L158 Benchmark]: Toolchain (without parser) took 68895.74ms. Allocated memory was 111.1MB in the beginning and 6.7GB in the end (delta: 6.5GB). Free memory was 84.9MB in the beginning and 4.1GB in the end (delta: -4.0GB). Peak memory consumption was 2.5GB. Max. memory is 16.1GB. [2022-07-22 20:47:47,993 INFO L158 Benchmark]: CDTParser took 0.17ms. Allocated memory is still 111.1MB. Free memory is still 68.8MB. There was no memory consumed. Max. memory is 16.1GB. [2022-07-22 20:47:47,994 INFO L158 Benchmark]: CACSL2BoogieTranslator took 290.94ms. Allocated memory is still 111.1MB. Free memory was 84.7MB in the beginning and 81.2MB in the end (delta: 3.5MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2022-07-22 20:47:47,994 INFO L158 Benchmark]: Boogie Procedure Inliner took 59.33ms. Allocated memory is still 111.1MB. Free memory was 81.1MB in the beginning and 78.3MB in the end (delta: 2.8MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-07-22 20:47:47,994 INFO L158 Benchmark]: Boogie Preprocessor took 44.35ms. Allocated memory is still 111.1MB. Free memory was 78.3MB in the beginning and 75.9MB in the end (delta: 2.4MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-07-22 20:47:47,994 INFO L158 Benchmark]: RCFGBuilder took 601.14ms. Allocated memory was 111.1MB in the beginning and 134.2MB in the end (delta: 23.1MB). Free memory was 75.7MB in the beginning and 106.9MB in the end (delta: -31.2MB). Peak memory consumption was 28.8MB. Max. memory is 16.1GB. [2022-07-22 20:47:47,994 INFO L158 Benchmark]: TraceAbstraction took 67778.65ms. Allocated memory was 134.2MB in the beginning and 6.7GB in the end (delta: 6.5GB). Free memory was 106.5MB in the beginning and 4.1GB in the end (delta: -4.0GB). Peak memory consumption was 2.5GB. Max. memory is 16.1GB. [2022-07-22 20:47:47,994 INFO L158 Benchmark]: Witness Printer took 117.04ms. Allocated memory is still 6.7GB. Free memory was 4.1GB in the beginning and 4.1GB in the end (delta: 26.2MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. [2022-07-22 20:47:48,000 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.17ms. Allocated memory is still 111.1MB. Free memory is still 68.8MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 290.94ms. Allocated memory is still 111.1MB. Free memory was 84.7MB in the beginning and 81.2MB in the end (delta: 3.5MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 59.33ms. Allocated memory is still 111.1MB. Free memory was 81.1MB in the beginning and 78.3MB in the end (delta: 2.8MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 44.35ms. Allocated memory is still 111.1MB. Free memory was 78.3MB in the beginning and 75.9MB in the end (delta: 2.4MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 601.14ms. Allocated memory was 111.1MB in the beginning and 134.2MB in the end (delta: 23.1MB). Free memory was 75.7MB in the beginning and 106.9MB in the end (delta: -31.2MB). Peak memory consumption was 28.8MB. Max. memory is 16.1GB. * TraceAbstraction took 67778.65ms. Allocated memory was 134.2MB in the beginning and 6.7GB in the end (delta: 6.5GB). Free memory was 106.5MB in the beginning and 4.1GB in the end (delta: -4.0GB). Peak memory consumption was 2.5GB. Max. memory is 16.1GB. * Witness Printer took 117.04ms. Allocated memory is still 6.7GB. Free memory was 4.1GB in the beginning and 4.1GB in the end (delta: 26.2MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - CounterExampleResult [Line: 496]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L33] int q_buf_0 ; [L34] int q_free ; [L35] int q_read_ev ; [L36] int q_write_ev ; [L37] int q_req_up ; [L38] int q_ev ; [L59] int p_num_write ; [L60] int p_last_write ; [L61] int p_dw_st ; [L62] int p_dw_pc ; [L63] int p_dw_i ; [L64] int c_num_read ; [L65] int c_last_read ; [L66] int c_dr_st ; [L67] int c_dr_pc ; [L68] int c_dr_i ; [L172] static int a_t ; [L500] int m_pc = 0; [L501] int t1_pc = 0; [L502] int t2_pc = 0; [L503] int m_st ; [L504] int t1_st ; [L505] int t2_st ; [L506] int m_i ; [L507] int t1_i ; [L508] int t2_i ; [L509] int M_E = 2; [L510] int T1_E = 2; [L511] int T2_E = 2; [L512] int E_M = 2; [L513] int E_1 = 2; [L514] int E_2 = 2; [L519] int token ; [L521] int local ; VAL [a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=2, E_M=2, local=0, M_E=2, m_i=0, m_pc=0, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, T1_E=2, t1_i=0, t1_pc=0, t1_st=0, T2_E=2, t2_i=0, t2_pc=0, t2_st=0, token=0] [L1099] COND FALSE !(__VERIFIER_nondet_int()) [L1102] CALL main2() [L1086] int __retres1 ; [L1090] CALL init_model2() [L1000] m_i = 1 [L1001] t1_i = 1 [L1002] t2_i = 1 VAL [a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, token=0] [L1090] RET init_model2() [L1091] CALL start_simulation2() [L1027] int kernel_st ; [L1028] int tmp ; [L1029] int tmp___0 ; [L1033] kernel_st = 0 VAL [a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=2, E_M=2, kernel_st=0, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, token=0] [L1034] FCALL update_channels2() VAL [a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=2, E_M=2, kernel_st=0, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, token=0] [L1035] CALL init_threads2() [L719] COND TRUE m_i == 1 [L720] m_st = 0 VAL [a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, token=0] [L724] COND TRUE t1_i == 1 [L725] t1_st = 0 VAL [a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, token=0] [L729] COND TRUE t2_i == 1 [L730] t2_st = 0 VAL [a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, token=0] [L1035] RET init_threads2() [L1036] CALL fire_delta_events2() VAL [\old(E_1)=2, \old(E_2)=2, \old(E_M)=2, \old(M_E)=2, \old(T1_E)=2, \old(T2_E)=2, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, token=0] [L832] COND FALSE !(M_E == 0) VAL [\old(E_1)=2, \old(E_2)=2, \old(E_M)=2, \old(M_E)=2, \old(T1_E)=2, \old(T2_E)=2, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, token=0] [L837] COND FALSE !(T1_E == 0) VAL [\old(E_1)=2, \old(E_2)=2, \old(E_M)=2, \old(M_E)=2, \old(T1_E)=2, \old(T2_E)=2, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, token=0] [L842] COND FALSE !(T2_E == 0) VAL [\old(E_1)=2, \old(E_2)=2, \old(E_M)=2, \old(M_E)=2, \old(T1_E)=2, \old(T2_E)=2, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, token=0] [L847] COND FALSE !(E_M == 0) VAL [\old(E_1)=2, \old(E_2)=2, \old(E_M)=2, \old(M_E)=2, \old(T1_E)=2, \old(T2_E)=2, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, token=0] [L852] COND FALSE !(E_1 == 0) VAL [\old(E_1)=2, \old(E_2)=2, \old(E_M)=2, \old(M_E)=2, \old(T1_E)=2, \old(T2_E)=2, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, token=0] [L857] COND FALSE !(E_2 == 0) VAL [\old(E_1)=2, \old(E_2)=2, \old(E_M)=2, \old(M_E)=2, \old(T1_E)=2, \old(T2_E)=2, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, token=0] [L1036] RET fire_delta_events2() VAL [a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=2, E_M=2, kernel_st=0, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, token=0] [L1037] CALL activate_threads2() VAL [\old(m_st)=0, \old(t1_st)=0, \old(t2_st)=0, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, token=0] [L905] int tmp ; [L906] int tmp___0 ; [L907] int tmp___1 ; [L911] CALL, EXPR is_master_triggered() [L651] int __retres1 ; VAL [\old(m_st)=0, \old(t1_st)=0, \old(t2_st)=0, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, token=0] [L654] COND FALSE !(m_pc == 1) VAL [\old(m_st)=0, \old(t1_st)=0, \old(t2_st)=0, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, token=0] [L664] __retres1 = 0 VAL [\old(m_st)=0, \old(t1_st)=0, \old(t2_st)=0, __retres1=0, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, token=0] [L666] return (__retres1); VAL [\old(m_st)=0, \old(t1_st)=0, \old(t2_st)=0, \result=0, __retres1=0, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, token=0] [L911] RET, EXPR is_master_triggered() [L911] tmp = is_master_triggered() [L913] COND FALSE !(\read(tmp)) VAL [\old(m_st)=0, \old(t1_st)=0, \old(t2_st)=0, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, tmp=0, token=0] [L919] CALL, EXPR is_transmit1_triggered() [L670] int __retres1 ; VAL [\old(m_st)=0, \old(t1_st)=0, \old(t2_st)=0, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, token=0] [L673] COND FALSE !(t1_pc == 1) VAL [\old(m_st)=0, \old(t1_st)=0, \old(t2_st)=0, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, token=0] [L683] __retres1 = 0 VAL [\old(m_st)=0, \old(t1_st)=0, \old(t2_st)=0, __retres1=0, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, token=0] [L685] return (__retres1); VAL [\old(m_st)=0, \old(t1_st)=0, \old(t2_st)=0, \result=0, __retres1=0, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, token=0] [L919] RET, EXPR is_transmit1_triggered() [L919] tmp___0 = is_transmit1_triggered() [L921] COND FALSE !(\read(tmp___0)) VAL [\old(m_st)=0, \old(t1_st)=0, \old(t2_st)=0, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, tmp=0, tmp___0=0, token=0] [L927] CALL, EXPR is_transmit2_triggered() [L689] int __retres1 ; VAL [\old(m_st)=0, \old(t1_st)=0, \old(t2_st)=0, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, token=0] [L692] COND FALSE !(t2_pc == 1) VAL [\old(m_st)=0, \old(t1_st)=0, \old(t2_st)=0, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, token=0] [L702] __retres1 = 0 VAL [\old(m_st)=0, \old(t1_st)=0, \old(t2_st)=0, __retres1=0, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, token=0] [L704] return (__retres1); VAL [\old(m_st)=0, \old(t1_st)=0, \old(t2_st)=0, \result=0, __retres1=0, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, token=0] [L927] RET, EXPR is_transmit2_triggered() [L927] tmp___1 = is_transmit2_triggered() [L929] COND FALSE !(\read(tmp___1)) VAL [\old(m_st)=0, \old(t1_st)=0, \old(t2_st)=0, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, tmp=0, tmp___0=0, tmp___1=0, token=0] [L1037] RET activate_threads2() VAL [a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=2, E_M=2, kernel_st=0, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, token=0] [L1038] CALL reset_delta_events2() VAL [\old(E_1)=2, \old(E_2)=2, \old(E_M)=2, \old(M_E)=2, \old(T1_E)=2, \old(T2_E)=2, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, token=0] [L870] COND FALSE !(M_E == 1) VAL [\old(E_1)=2, \old(E_2)=2, \old(E_M)=2, \old(M_E)=2, \old(T1_E)=2, \old(T2_E)=2, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, token=0] [L875] COND FALSE !(T1_E == 1) VAL [\old(E_1)=2, \old(E_2)=2, \old(E_M)=2, \old(M_E)=2, \old(T1_E)=2, \old(T2_E)=2, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, token=0] [L880] COND FALSE !(T2_E == 1) VAL [\old(E_1)=2, \old(E_2)=2, \old(E_M)=2, \old(M_E)=2, \old(T1_E)=2, \old(T2_E)=2, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, token=0] [L885] COND FALSE !(E_M == 1) VAL [\old(E_1)=2, \old(E_2)=2, \old(E_M)=2, \old(M_E)=2, \old(T1_E)=2, \old(T2_E)=2, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, token=0] [L890] COND FALSE !(E_1 == 1) VAL [\old(E_1)=2, \old(E_2)=2, \old(E_M)=2, \old(M_E)=2, \old(T1_E)=2, \old(T2_E)=2, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, token=0] [L895] COND FALSE !(E_2 == 1) VAL [\old(E_1)=2, \old(E_2)=2, \old(E_M)=2, \old(M_E)=2, \old(T1_E)=2, \old(T2_E)=2, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, token=0] [L1038] RET reset_delta_events2() VAL [a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=2, E_M=2, kernel_st=0, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, token=0] [L1041] COND TRUE 1 VAL [a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=2, E_M=2, kernel_st=0, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, token=0] [L1044] kernel_st = 1 [L1045] CALL eval2() [L765] int tmp ; VAL [a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, token=0] [L769] COND TRUE 1 VAL [a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, token=0] [L772] CALL, EXPR exists_runnable_thread2() VAL [a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, token=0] [L739] int __retres1 ; VAL [a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, token=0] [L742] COND TRUE m_st == 0 [L743] __retres1 = 1 VAL [__retres1=1, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, token=0] [L760] return (__retres1); VAL [\result=1, __retres1=1, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, token=0] [L772] RET, EXPR exists_runnable_thread2() VAL [a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=2, E_M=2, exists_runnable_thread2()=1, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, token=0] [L772] tmp = exists_runnable_thread2() [L774] COND TRUE \read(tmp) VAL [a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, tmp=1, token=0] [L779] COND TRUE m_st == 0 [L780] int tmp_ndt_1; [L781] tmp_ndt_1 = __VERIFIER_nondet_int() [L782] COND FALSE !(\read(tmp_ndt_1)) VAL [a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, tmp=1, tmp_ndt_1=0, token=0] [L793] COND TRUE t1_st == 0 [L794] int tmp_ndt_2; [L795] tmp_ndt_2 = __VERIFIER_nondet_int() [L796] COND TRUE \read(tmp_ndt_2) [L798] t1_st = 1 [L799] CALL transmit1() [L582] COND TRUE t1_pc == 0 VAL [a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=1, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, token=0] [L593] COND TRUE 1 VAL [a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=1, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, token=0] [L595] t1_pc = 1 [L596] t1_st = 2 VAL [a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, token=0] [L799] RET transmit1() [L807] COND TRUE t2_st == 0 [L808] int tmp_ndt_3; [L809] tmp_ndt_3 = __VERIFIER_nondet_int() [L810] COND TRUE \read(tmp_ndt_3) [L812] t2_st = 1 [L813] CALL transmit2() [L618] COND TRUE t2_pc == 0 VAL [a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=0, t2_st=1, token=0] [L629] COND TRUE 1 VAL [a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=0, t2_st=1, token=0] [L631] t2_pc = 1 [L632] t2_st = 2 VAL [a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, token=0] [L813] RET transmit2() [L769] COND TRUE 1 VAL [a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, tmp=1, tmp_ndt_1=0, tmp_ndt_2=1, tmp_ndt_3=1, token=0] [L772] CALL, EXPR exists_runnable_thread2() VAL [a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, token=0] [L739] int __retres1 ; VAL [a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, token=0] [L742] COND TRUE m_st == 0 [L743] __retres1 = 1 VAL [__retres1=1, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, token=0] [L760] return (__retres1); VAL [\result=1, __retres1=1, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, token=0] [L772] RET, EXPR exists_runnable_thread2() VAL [a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=2, E_M=2, exists_runnable_thread2()=1, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, tmp=1, tmp_ndt_1=0, tmp_ndt_2=1, tmp_ndt_3=1, token=0] [L772] tmp = exists_runnable_thread2() [L774] COND TRUE \read(tmp) VAL [a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, tmp=1, tmp_ndt_1=0, tmp_ndt_2=1, tmp_ndt_3=1, token=0] [L779] COND TRUE m_st == 0 [L780] int tmp_ndt_1; [L781] tmp_ndt_1 = __VERIFIER_nondet_int() [L782] COND TRUE \read(tmp_ndt_1) [L784] m_st = 1 [L785] CALL master() [L524] int tmp_var = __VERIFIER_nondet_int(); [L526] COND TRUE m_pc == 0 VAL [a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=1, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, tmp_var=0, token=0] [L537] COND TRUE 1 VAL [a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=1, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, tmp_var=0, token=0] [L540] token = __VERIFIER_nondet_int() [L541] local = token [L542] E_1 = 1 VAL [a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=1, E_2=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=1, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, tmp_var=0, token=0] [L543] CALL immediate_notify() VAL [\old(m_st)=1, \old(t1_st)=2, \old(t2_st)=2, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=1, E_2=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=1, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, token=0] [L943] CALL activate_threads2() VAL [\old(m_st)=1, \old(t1_st)=2, \old(t2_st)=2, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=1, E_2=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=1, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, token=0] [L905] int tmp ; [L906] int tmp___0 ; [L907] int tmp___1 ; [L911] CALL, EXPR is_master_triggered() [L651] int __retres1 ; VAL [\old(m_st)=1, \old(t1_st)=2, \old(t2_st)=2, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=1, E_2=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=1, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, token=0] [L654] COND FALSE !(m_pc == 1) VAL [\old(m_st)=1, \old(t1_st)=2, \old(t2_st)=2, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=1, E_2=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=1, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, token=0] [L664] __retres1 = 0 VAL [\old(m_st)=1, \old(t1_st)=2, \old(t2_st)=2, __retres1=0, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=1, E_2=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=1, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, token=0] [L666] return (__retres1); VAL [\old(m_st)=1, \old(t1_st)=2, \old(t2_st)=2, \result=0, __retres1=0, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=1, E_2=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=1, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, token=0] [L911] RET, EXPR is_master_triggered() [L911] tmp = is_master_triggered() [L913] COND FALSE !(\read(tmp)) VAL [\old(m_st)=1, \old(t1_st)=2, \old(t2_st)=2, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=1, E_2=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=1, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, tmp=0, token=0] [L919] CALL, EXPR is_transmit1_triggered() [L670] int __retres1 ; VAL [\old(m_st)=1, \old(t1_st)=2, \old(t2_st)=2, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=1, E_2=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=1, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, token=0] [L673] COND TRUE t1_pc == 1 VAL [\old(m_st)=1, \old(t1_st)=2, \old(t2_st)=2, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=1, E_2=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=1, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, token=0] [L674] COND TRUE E_1 == 1 [L675] __retres1 = 1 VAL [\old(m_st)=1, \old(t1_st)=2, \old(t2_st)=2, __retres1=1, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=1, E_2=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=1, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, token=0] [L685] return (__retres1); VAL [\old(m_st)=1, \old(t1_st)=2, \old(t2_st)=2, \result=1, __retres1=1, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=1, E_2=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=1, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, token=0] [L919] RET, EXPR is_transmit1_triggered() [L919] tmp___0 = is_transmit1_triggered() [L921] COND TRUE \read(tmp___0) [L922] t1_st = 0 VAL [\old(m_st)=1, \old(t1_st)=2, \old(t2_st)=2, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=1, E_2=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=1, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=0, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, tmp=0, tmp___0=1, token=0] [L927] CALL, EXPR is_transmit2_triggered() [L689] int __retres1 ; VAL [\old(m_st)=1, \old(t1_st)=2, \old(t2_st)=2, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=1, E_2=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=1, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=0, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, token=0] [L692] COND TRUE t2_pc == 1 VAL [\old(m_st)=1, \old(t1_st)=2, \old(t2_st)=2, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=1, E_2=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=1, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=0, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, token=0] [L693] COND FALSE !(E_2 == 1) VAL [\old(m_st)=1, \old(t1_st)=2, \old(t2_st)=2, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=1, E_2=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=1, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=0, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, token=0] [L702] __retres1 = 0 VAL [\old(m_st)=1, \old(t1_st)=2, \old(t2_st)=2, __retres1=0, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=1, E_2=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=1, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=0, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, token=0] [L704] return (__retres1); VAL [\old(m_st)=1, \old(t1_st)=2, \old(t2_st)=2, \result=0, __retres1=0, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=1, E_2=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=1, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=0, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, token=0] [L927] RET, EXPR is_transmit2_triggered() [L927] tmp___1 = is_transmit2_triggered() [L929] COND FALSE !(\read(tmp___1)) VAL [\old(m_st)=1, \old(t1_st)=2, \old(t2_st)=2, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=1, E_2=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=1, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=0, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, tmp=0, tmp___0=1, tmp___1=0, token=0] [L943] RET activate_threads2() VAL [\old(m_st)=1, \old(t1_st)=2, \old(t2_st)=2, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=1, E_2=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=1, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=0, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, token=0] [L543] RET immediate_notify() VAL [a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=1, E_2=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=1, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=0, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, tmp_var=0, token=0] [L544] E_1 = 2 [L545] m_pc = 1 [L546] m_st = 2 VAL [a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=0, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, tmp_var=0, token=0] [L785] RET master() [L793] COND TRUE t1_st == 0 [L794] int tmp_ndt_2; [L795] tmp_ndt_2 = __VERIFIER_nondet_int() [L796] COND TRUE \read(tmp_ndt_2) [L798] t1_st = 1 [L799] CALL transmit1() [L582] COND FALSE !(t1_pc == 0) VAL [a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, token=0] [L585] COND TRUE t1_pc == 1 VAL [a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, token=0] [L601] token += 1 [L602] E_2 = 1 VAL [a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=1, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, token=1] [L603] CALL immediate_notify() VAL [\old(m_st)=2, \old(t1_st)=1, \old(t2_st)=2, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=1, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, token=1] [L943] CALL activate_threads2() VAL [\old(m_st)=2, \old(t1_st)=1, \old(t2_st)=2, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=1, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, token=1] [L905] int tmp ; [L906] int tmp___0 ; [L907] int tmp___1 ; [L911] CALL, EXPR is_master_triggered() [L651] int __retres1 ; VAL [\old(m_st)=2, \old(t1_st)=1, \old(t2_st)=2, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=1, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, token=1] [L654] COND TRUE m_pc == 1 VAL [\old(m_st)=2, \old(t1_st)=1, \old(t2_st)=2, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=1, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, token=1] [L655] COND FALSE !(E_M == 1) VAL [\old(m_st)=2, \old(t1_st)=1, \old(t2_st)=2, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=1, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, token=1] [L664] __retres1 = 0 VAL [\old(m_st)=2, \old(t1_st)=1, \old(t2_st)=2, __retres1=0, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=1, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, token=1] [L666] return (__retres1); VAL [\old(m_st)=2, \old(t1_st)=1, \old(t2_st)=2, \result=0, __retres1=0, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=1, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, token=1] [L911] RET, EXPR is_master_triggered() [L911] tmp = is_master_triggered() [L913] COND FALSE !(\read(tmp)) VAL [\old(m_st)=2, \old(t1_st)=1, \old(t2_st)=2, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=1, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, tmp=0, token=1] [L919] CALL, EXPR is_transmit1_triggered() [L670] int __retres1 ; VAL [\old(m_st)=2, \old(t1_st)=1, \old(t2_st)=2, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=1, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, token=1] [L673] COND TRUE t1_pc == 1 VAL [\old(m_st)=2, \old(t1_st)=1, \old(t2_st)=2, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=1, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, token=1] [L674] COND FALSE !(E_1 == 1) VAL [\old(m_st)=2, \old(t1_st)=1, \old(t2_st)=2, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=1, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, token=1] [L683] __retres1 = 0 VAL [\old(m_st)=2, \old(t1_st)=1, \old(t2_st)=2, __retres1=0, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=1, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, token=1] [L685] return (__retres1); VAL [\old(m_st)=2, \old(t1_st)=1, \old(t2_st)=2, \result=0, __retres1=0, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=1, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, token=1] [L919] RET, EXPR is_transmit1_triggered() [L919] tmp___0 = is_transmit1_triggered() [L921] COND FALSE !(\read(tmp___0)) VAL [\old(m_st)=2, \old(t1_st)=1, \old(t2_st)=2, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=1, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, tmp=0, tmp___0=0, token=1] [L927] CALL, EXPR is_transmit2_triggered() [L689] int __retres1 ; VAL [\old(m_st)=2, \old(t1_st)=1, \old(t2_st)=2, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=1, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, token=1] [L692] COND TRUE t2_pc == 1 VAL [\old(m_st)=2, \old(t1_st)=1, \old(t2_st)=2, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=1, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, token=1] [L693] COND TRUE E_2 == 1 [L694] __retres1 = 1 VAL [\old(m_st)=2, \old(t1_st)=1, \old(t2_st)=2, __retres1=1, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=1, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, token=1] [L704] return (__retres1); VAL [\old(m_st)=2, \old(t1_st)=1, \old(t2_st)=2, \result=1, __retres1=1, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=1, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, token=1] [L927] RET, EXPR is_transmit2_triggered() [L927] tmp___1 = is_transmit2_triggered() [L929] COND TRUE \read(tmp___1) [L930] t2_st = 0 VAL [\old(m_st)=2, \old(t1_st)=1, \old(t2_st)=2, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=1, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, T2_E=2, t2_i=1, t2_pc=1, t2_st=0, tmp=0, tmp___0=0, tmp___1=1, token=1] [L943] RET activate_threads2() VAL [\old(m_st)=2, \old(t1_st)=1, \old(t2_st)=2, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=1, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, T2_E=2, t2_i=1, t2_pc=1, t2_st=0, token=1] [L603] RET immediate_notify() VAL [a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=1, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, T2_E=2, t2_i=1, t2_pc=1, t2_st=0, token=1] [L604] E_2 = 2 VAL [a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, T2_E=2, t2_i=1, t2_pc=1, t2_st=0, token=1] [L593] COND TRUE 1 VAL [a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, T2_E=2, t2_i=1, t2_pc=1, t2_st=0, token=1] [L595] t1_pc = 1 [L596] t1_st = 2 VAL [a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=0, token=1] [L799] RET transmit1() [L807] COND TRUE t2_st == 0 [L808] int tmp_ndt_3; [L809] tmp_ndt_3 = __VERIFIER_nondet_int() [L810] COND TRUE \read(tmp_ndt_3) [L812] t2_st = 1 [L813] CALL transmit2() [L618] COND FALSE !(t2_pc == 0) VAL [a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=1, token=1] [L621] COND TRUE t2_pc == 1 VAL [a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=1, token=1] [L637] token += 1 [L638] E_M = 1 VAL [a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=2, E_M=1, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=1, token=2] [L639] CALL immediate_notify() VAL [\old(m_st)=2, \old(t1_st)=2, \old(t2_st)=1, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=2, E_M=1, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=1, token=2] [L943] CALL activate_threads2() VAL [\old(m_st)=2, \old(t1_st)=2, \old(t2_st)=1, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=2, E_M=1, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=1, token=2] [L905] int tmp ; [L906] int tmp___0 ; [L907] int tmp___1 ; [L911] CALL, EXPR is_master_triggered() [L651] int __retres1 ; VAL [\old(m_st)=2, \old(t1_st)=2, \old(t2_st)=1, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=2, E_M=1, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=1, token=2] [L654] COND TRUE m_pc == 1 VAL [\old(m_st)=2, \old(t1_st)=2, \old(t2_st)=1, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=2, E_M=1, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=1, token=2] [L655] COND TRUE E_M == 1 [L656] __retres1 = 1 VAL [\old(m_st)=2, \old(t1_st)=2, \old(t2_st)=1, __retres1=1, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=2, E_M=1, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=1, token=2] [L666] return (__retres1); VAL [\old(m_st)=2, \old(t1_st)=2, \old(t2_st)=1, \result=1, __retres1=1, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=2, E_M=1, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=1, token=2] [L911] RET, EXPR is_master_triggered() [L911] tmp = is_master_triggered() [L913] COND TRUE \read(tmp) [L914] m_st = 0 VAL [\old(m_st)=2, \old(t1_st)=2, \old(t2_st)=1, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=2, E_M=1, local=0, M_E=2, m_i=1, m_pc=1, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=1, tmp=1, token=2] [L919] CALL, EXPR is_transmit1_triggered() [L670] int __retres1 ; VAL [\old(m_st)=2, \old(t1_st)=2, \old(t2_st)=1, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=2, E_M=1, local=0, M_E=2, m_i=1, m_pc=1, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=1, token=2] [L673] COND TRUE t1_pc == 1 VAL [\old(m_st)=2, \old(t1_st)=2, \old(t2_st)=1, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=2, E_M=1, local=0, M_E=2, m_i=1, m_pc=1, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=1, token=2] [L674] COND FALSE !(E_1 == 1) VAL [\old(m_st)=2, \old(t1_st)=2, \old(t2_st)=1, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=2, E_M=1, local=0, M_E=2, m_i=1, m_pc=1, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=1, token=2] [L683] __retres1 = 0 VAL [\old(m_st)=2, \old(t1_st)=2, \old(t2_st)=1, __retres1=0, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=2, E_M=1, local=0, M_E=2, m_i=1, m_pc=1, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=1, token=2] [L685] return (__retres1); VAL [\old(m_st)=2, \old(t1_st)=2, \old(t2_st)=1, \result=0, __retres1=0, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=2, E_M=1, local=0, M_E=2, m_i=1, m_pc=1, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=1, token=2] [L919] RET, EXPR is_transmit1_triggered() [L919] tmp___0 = is_transmit1_triggered() [L921] COND FALSE !(\read(tmp___0)) VAL [\old(m_st)=2, \old(t1_st)=2, \old(t2_st)=1, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=2, E_M=1, local=0, M_E=2, m_i=1, m_pc=1, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=1, tmp=1, tmp___0=0, token=2] [L927] CALL, EXPR is_transmit2_triggered() [L689] int __retres1 ; VAL [\old(m_st)=2, \old(t1_st)=2, \old(t2_st)=1, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=2, E_M=1, local=0, M_E=2, m_i=1, m_pc=1, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=1, token=2] [L692] COND TRUE t2_pc == 1 VAL [\old(m_st)=2, \old(t1_st)=2, \old(t2_st)=1, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=2, E_M=1, local=0, M_E=2, m_i=1, m_pc=1, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=1, token=2] [L693] COND FALSE !(E_2 == 1) VAL [\old(m_st)=2, \old(t1_st)=2, \old(t2_st)=1, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=2, E_M=1, local=0, M_E=2, m_i=1, m_pc=1, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=1, token=2] [L702] __retres1 = 0 VAL [\old(m_st)=2, \old(t1_st)=2, \old(t2_st)=1, __retres1=0, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=2, E_M=1, local=0, M_E=2, m_i=1, m_pc=1, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=1, token=2] [L704] return (__retres1); VAL [\old(m_st)=2, \old(t1_st)=2, \old(t2_st)=1, \result=0, __retres1=0, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=2, E_M=1, local=0, M_E=2, m_i=1, m_pc=1, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=1, token=2] [L927] RET, EXPR is_transmit2_triggered() [L927] tmp___1 = is_transmit2_triggered() [L929] COND FALSE !(\read(tmp___1)) VAL [\old(m_st)=2, \old(t1_st)=2, \old(t2_st)=1, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=2, E_M=1, local=0, M_E=2, m_i=1, m_pc=1, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=1, tmp=1, tmp___0=0, tmp___1=0, token=2] [L943] RET activate_threads2() VAL [\old(m_st)=2, \old(t1_st)=2, \old(t2_st)=1, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=2, E_M=1, local=0, M_E=2, m_i=1, m_pc=1, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=1, token=2] [L639] RET immediate_notify() VAL [a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=2, E_M=1, local=0, M_E=2, m_i=1, m_pc=1, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=1, token=2] [L640] E_M = 2 VAL [a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=1, token=2] [L629] COND TRUE 1 VAL [a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=1, token=2] [L631] t2_pc = 1 [L632] t2_st = 2 VAL [a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, token=2] [L813] RET transmit2() [L769] COND TRUE 1 VAL [a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, tmp=1, tmp_ndt_1=1, tmp_ndt_2=1, tmp_ndt_3=1, token=2] [L772] CALL, EXPR exists_runnable_thread2() VAL [a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, token=2] [L739] int __retres1 ; VAL [a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, token=2] [L742] COND TRUE m_st == 0 [L743] __retres1 = 1 VAL [__retres1=1, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, token=2] [L760] return (__retres1); VAL [\result=1, __retres1=1, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, token=2] [L772] RET, EXPR exists_runnable_thread2() VAL [a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=2, E_M=2, exists_runnable_thread2()=1, local=0, M_E=2, m_i=1, m_pc=1, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, tmp=1, tmp_ndt_1=1, tmp_ndt_2=1, tmp_ndt_3=1, token=2] [L772] tmp = exists_runnable_thread2() [L774] COND TRUE \read(tmp) VAL [a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, tmp=1, tmp_ndt_1=1, tmp_ndt_2=1, tmp_ndt_3=1, token=2] [L779] COND TRUE m_st == 0 [L780] int tmp_ndt_1; [L781] tmp_ndt_1 = __VERIFIER_nondet_int() [L782] COND TRUE \read(tmp_ndt_1) [L784] m_st = 1 [L785] CALL master() [L524] int tmp_var = __VERIFIER_nondet_int(); [L526] COND FALSE !(m_pc == 0) VAL [a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=1, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, tmp_var=5, token=2] [L529] COND TRUE m_pc == 1 VAL [a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=1, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, tmp_var=5, token=2] [L551] COND FALSE !(token != local + 2) VAL [a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=1, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, tmp_var=5, token=2] [L556] COND TRUE tmp_var <= 5 VAL [a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=1, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, tmp_var=5, token=2] [L557] COND TRUE tmp_var >= 5 VAL [a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=1, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, tmp_var=5, token=2] [L562] COND TRUE tmp_var <= 5 VAL [a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=1, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, tmp_var=5, token=2] [L563] COND TRUE tmp_var >= 5 VAL [a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=1, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, tmp_var=5, token=2] [L564] COND TRUE tmp_var == 5 VAL [a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=1, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, tmp_var=5, token=2] [L565] CALL error2() VAL [a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=1, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, token=2] [L496] reach_error() VAL [a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=1, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, token=2] - UnprovableResult [Line: 28]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data CFG has 16 procedures, 241 locations, 2 error locations. Started 1 CEGAR loops. OverallTime: 67.6s, OverallIterations: 45, TraceHistogramMax: 4, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.2s, AutomataDifference: 35.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 21782 SdHoareTripleChecker+Valid, 11.3s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 21286 mSDsluCounter, 40300 SdHoareTripleChecker+Invalid, 9.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 24650 mSDsCounter, 4271 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 18169 IncrementalHoareTripleChecker+Invalid, 22440 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 4271 mSolverCounterUnsat, 15650 mSDtfsCounter, 18169 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 4438 GetRequests, 3946 SyntacticMatches, 8 SemanticMatches, 484 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1307 ImplicationChecksByTransitivity, 3.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=32004occurred in iteration=33, InterpolantAutomatonStates: 414, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 21.7s AutomataMinimizationTime, 44 MinimizatonAttempts, 21983 StatesRemovedByMinimization, 39 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.3s SsaConstructionTime, 1.0s SatisfiabilityAnalysisTime, 3.9s InterpolantComputationTime, 8344 NumberOfCodeBlocks, 8344 NumberOfCodeBlocksAsserted, 64 NumberOfCheckSat, 8146 ConstructedInterpolants, 0 QuantifiedInterpolants, 15238 SizeOfPredicates, 9 NumberOfNonLiveVariables, 10191 ConjunctsInSsa, 81 ConjunctsInUnsatCore, 64 InterpolantComputations, 43 PerfectInterpolantSequences, 3836/4182 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! [2022-07-22 20:47:48,035 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE