./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 eb692b52 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-?-eb692b5 [2022-07-19 20:32:09,043 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-07-19 20:32:09,045 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-07-19 20:32:09,101 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-07-19 20:32:09,102 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-07-19 20:32:09,103 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-07-19 20:32:09,104 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-07-19 20:32:09,106 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-07-19 20:32:09,107 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-07-19 20:32:09,112 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-07-19 20:32:09,112 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-07-19 20:32:09,114 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-07-19 20:32:09,114 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-07-19 20:32:09,116 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-07-19 20:32:09,117 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-07-19 20:32:09,119 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-07-19 20:32:09,120 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-07-19 20:32:09,121 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-07-19 20:32:09,123 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-07-19 20:32:09,126 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-07-19 20:32:09,127 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-07-19 20:32:09,128 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-07-19 20:32:09,129 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-07-19 20:32:09,129 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-07-19 20:32:09,131 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-07-19 20:32:09,134 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-07-19 20:32:09,134 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-07-19 20:32:09,135 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-07-19 20:32:09,135 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-07-19 20:32:09,136 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-07-19 20:32:09,137 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-07-19 20:32:09,137 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-07-19 20:32:09,138 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-07-19 20:32:09,138 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-07-19 20:32:09,139 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-07-19 20:32:09,139 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-07-19 20:32:09,140 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-07-19 20:32:09,140 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-07-19 20:32:09,140 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-07-19 20:32:09,140 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-07-19 20:32:09,141 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-07-19 20:32:09,142 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-07-19 20:32:09,143 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2022-07-19 20:32:09,168 INFO L113 SettingsManager]: Loading preferences was successful [2022-07-19 20:32:09,169 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-07-19 20:32:09,169 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-07-19 20:32:09,169 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-07-19 20:32:09,170 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-07-19 20:32:09,170 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-07-19 20:32:09,170 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-07-19 20:32:09,170 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-07-19 20:32:09,171 INFO L138 SettingsManager]: * Use SBE=true [2022-07-19 20:32:09,171 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-07-19 20:32:09,171 INFO L138 SettingsManager]: * sizeof long=4 [2022-07-19 20:32:09,172 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-07-19 20:32:09,172 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-07-19 20:32:09,172 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-07-19 20:32:09,172 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-07-19 20:32:09,172 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-07-19 20:32:09,172 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-07-19 20:32:09,172 INFO L138 SettingsManager]: * sizeof long double=12 [2022-07-19 20:32:09,173 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-07-19 20:32:09,173 INFO L138 SettingsManager]: * Use constant arrays=true [2022-07-19 20:32:09,174 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-07-19 20:32:09,174 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-07-19 20:32:09,174 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-07-19 20:32:09,174 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-07-19 20:32:09,174 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-19 20:32:09,174 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-07-19 20:32:09,175 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-07-19 20:32:09,175 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-07-19 20:32:09,175 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-07-19 20:32:09,175 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-07-19 20:32:09,175 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-07-19 20:32:09,176 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-07-19 20:32:09,176 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-07-19 20:32:09,176 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-19 20:32:09,350 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-07-19 20:32:09,363 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-07-19 20:32:09,365 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-07-19 20:32:09,365 INFO L271 PluginConnector]: Initializing CDTParser... [2022-07-19 20:32:09,366 INFO L275 PluginConnector]: CDTParser initialized [2022-07-19 20:32:09,367 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-19 20:32:09,418 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/64e09733e/71a578f7d15b4b08b106bc3d79dbbd3a/FLAG2b2637f4d [2022-07-19 20:32:09,867 INFO L306 CDTParser]: Found 1 translation units. [2022-07-19 20:32:09,868 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-19 20:32:09,878 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/64e09733e/71a578f7d15b4b08b106bc3d79dbbd3a/FLAG2b2637f4d [2022-07-19 20:32:10,226 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/64e09733e/71a578f7d15b4b08b106bc3d79dbbd3a [2022-07-19 20:32:10,228 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-07-19 20:32:10,229 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-07-19 20:32:10,230 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-07-19 20:32:10,230 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-07-19 20:32:10,232 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-07-19 20:32:10,232 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.07 08:32:10" (1/1) ... [2022-07-19 20:32:10,233 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2cd92375 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 08:32:10, skipping insertion in model container [2022-07-19 20:32:10,233 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.07 08:32:10" (1/1) ... [2022-07-19 20:32:10,237 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-07-19 20:32:10,259 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-07-19 20:32:10,381 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-19 20:32:10,415 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-19 20:32:10,446 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-19 20:32:10,452 INFO L203 MainTranslator]: Completed pre-run [2022-07-19 20:32:10,459 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-19 20:32:10,475 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-19 20:32:10,501 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-19 20:32:10,526 INFO L208 MainTranslator]: Completed translation [2022-07-19 20:32:10,527 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 08:32:10 WrapperNode [2022-07-19 20:32:10,527 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-07-19 20:32:10,528 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-07-19 20:32:10,528 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-07-19 20:32:10,528 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-07-19 20:32:10,532 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 08:32:10" (1/1) ... [2022-07-19 20:32:10,539 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 08:32:10" (1/1) ... [2022-07-19 20:32:10,561 INFO L137 Inliner]: procedures = 57, calls = 64, calls flagged for inlining = 25, calls inlined = 25, statements flattened = 465 [2022-07-19 20:32:10,562 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-07-19 20:32:10,562 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-07-19 20:32:10,562 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-07-19 20:32:10,562 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-07-19 20:32:10,568 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 08:32:10" (1/1) ... [2022-07-19 20:32:10,577 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 08:32:10" (1/1) ... [2022-07-19 20:32:10,580 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 08:32:10" (1/1) ... [2022-07-19 20:32:10,581 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 08:32:10" (1/1) ... [2022-07-19 20:32:10,588 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 08:32:10" (1/1) ... [2022-07-19 20:32:10,610 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 08:32:10" (1/1) ... [2022-07-19 20:32:10,611 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 08:32:10" (1/1) ... [2022-07-19 20:32:10,613 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-07-19 20:32:10,614 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-07-19 20:32:10,614 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-07-19 20:32:10,614 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-07-19 20:32:10,624 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 08:32:10" (1/1) ... [2022-07-19 20:32:10,629 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-19 20:32:10,638 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-19 20:32:10,658 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-19 20:32:10,674 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-19 20:32:10,684 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-07-19 20:32:10,684 INFO L130 BoogieDeclarations]: Found specification of procedure immediate_notify [2022-07-19 20:32:10,684 INFO L138 BoogieDeclarations]: Found implementation of procedure immediate_notify [2022-07-19 20:32:10,684 INFO L130 BoogieDeclarations]: Found specification of procedure is_do_write_p_triggered [2022-07-19 20:32:10,685 INFO L138 BoogieDeclarations]: Found implementation of procedure is_do_write_p_triggered [2022-07-19 20:32:10,685 INFO L130 BoogieDeclarations]: Found specification of procedure exists_runnable_thread1 [2022-07-19 20:32:10,685 INFO L138 BoogieDeclarations]: Found implementation of procedure exists_runnable_thread1 [2022-07-19 20:32:10,685 INFO L130 BoogieDeclarations]: Found specification of procedure exists_runnable_thread2 [2022-07-19 20:32:10,685 INFO L138 BoogieDeclarations]: Found implementation of procedure exists_runnable_thread2 [2022-07-19 20:32:10,685 INFO L130 BoogieDeclarations]: Found specification of procedure reset_delta_events1 [2022-07-19 20:32:10,685 INFO L138 BoogieDeclarations]: Found implementation of procedure reset_delta_events1 [2022-07-19 20:32:10,685 INFO L130 BoogieDeclarations]: Found specification of procedure reset_delta_events2 [2022-07-19 20:32:10,685 INFO L138 BoogieDeclarations]: Found implementation of procedure reset_delta_events2 [2022-07-19 20:32:10,686 INFO L130 BoogieDeclarations]: Found specification of procedure activate_threads2 [2022-07-19 20:32:10,686 INFO L138 BoogieDeclarations]: Found implementation of procedure activate_threads2 [2022-07-19 20:32:10,686 INFO L130 BoogieDeclarations]: Found specification of procedure activate_threads1 [2022-07-19 20:32:10,686 INFO L138 BoogieDeclarations]: Found implementation of procedure activate_threads1 [2022-07-19 20:32:10,686 INFO L130 BoogieDeclarations]: Found specification of procedure is_do_read_c_triggered [2022-07-19 20:32:10,686 INFO L138 BoogieDeclarations]: Found implementation of procedure is_do_read_c_triggered [2022-07-19 20:32:10,686 INFO L130 BoogieDeclarations]: Found specification of procedure update_channels1 [2022-07-19 20:32:10,686 INFO L138 BoogieDeclarations]: Found implementation of procedure update_channels1 [2022-07-19 20:32:10,686 INFO L130 BoogieDeclarations]: Found specification of procedure update_channels2 [2022-07-19 20:32:10,686 INFO L138 BoogieDeclarations]: Found implementation of procedure update_channels2 [2022-07-19 20:32:10,686 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-07-19 20:32:10,686 INFO L130 BoogieDeclarations]: Found specification of procedure fire_delta_events2 [2022-07-19 20:32:10,686 INFO L138 BoogieDeclarations]: Found implementation of procedure fire_delta_events2 [2022-07-19 20:32:10,686 INFO L130 BoogieDeclarations]: Found specification of procedure fire_delta_events1 [2022-07-19 20:32:10,686 INFO L138 BoogieDeclarations]: Found implementation of procedure fire_delta_events1 [2022-07-19 20:32:10,686 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-07-19 20:32:10,686 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-07-19 20:32:10,687 INFO L130 BoogieDeclarations]: Found specification of procedure error1 [2022-07-19 20:32:10,687 INFO L138 BoogieDeclarations]: Found implementation of procedure error1 [2022-07-19 20:32:10,687 INFO L130 BoogieDeclarations]: Found specification of procedure error2 [2022-07-19 20:32:10,687 INFO L138 BoogieDeclarations]: Found implementation of procedure error2 [2022-07-19 20:32:10,760 INFO L234 CfgBuilder]: Building ICFG [2022-07-19 20:32:10,761 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-07-19 20:32:11,112 INFO L275 CfgBuilder]: Performing block encoding [2022-07-19 20:32:11,118 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-07-19 20:32:11,119 INFO L299 CfgBuilder]: Removed 9 assume(true) statements. [2022-07-19 20:32:11,121 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.07 08:32:11 BoogieIcfgContainer [2022-07-19 20:32:11,121 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-07-19 20:32:11,122 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-07-19 20:32:11,122 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-07-19 20:32:11,125 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-07-19 20:32:11,125 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 19.07 08:32:10" (1/3) ... [2022-07-19 20:32:11,126 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3390b612 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.07 08:32:11, skipping insertion in model container [2022-07-19 20:32:11,126 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 08:32:10" (2/3) ... [2022-07-19 20:32:11,126 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3390b612 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.07 08:32:11, skipping insertion in model container [2022-07-19 20:32:11,126 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.07 08:32:11" (3/3) ... [2022-07-19 20:32:11,127 INFO L111 eAbstractionObserver]: Analyzing ICFG pc_sfifo_2.cil-1+token_ring.02.cil-2.c [2022-07-19 20:32:11,136 INFO L201 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-07-19 20:32:11,137 INFO L160 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2022-07-19 20:32:11,172 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-07-19 20:32:11,176 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@6b38280a, mLbeIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@29964bb3 [2022-07-19 20:32:11,177 INFO L358 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2022-07-19 20:32:11,180 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-19 20:32:11,188 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2022-07-19 20:32:11,189 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 20:32:11,189 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-19 20:32:11,190 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 20:32:11,193 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 20:32:11,193 INFO L85 PathProgramCache]: Analyzing trace with hash -448089429, now seen corresponding path program 1 times [2022-07-19 20:32:11,199 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 20:32:11,199 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1858883950] [2022-07-19 20:32:11,200 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 20:32:11,200 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 20:32:11,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 20:32:11,318 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-07-19 20:32:11,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 20:32:11,333 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-07-19 20:32:11,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 20:32:11,344 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-07-19 20:32:11,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 20:32:11,356 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-19 20:32:11,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 20:32:11,359 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-19 20:32:11,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 20:32:11,363 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2022-07-19 20:32:11,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 20:32:11,377 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2022-07-19 20:32:11,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 20:32:11,383 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-19 20:32:11,384 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 20:32:11,384 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1858883950] [2022-07-19 20:32:11,384 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1858883950] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-19 20:32:11,384 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-19 20:32:11,385 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-19 20:32:11,386 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [114177095] [2022-07-19 20:32:11,386 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-19 20:32:11,389 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-19 20:32:11,389 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 20:32:11,413 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-19 20:32:11,414 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-07-19 20:32:11,418 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-19 20:32:11,851 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 20:32:11,851 INFO L93 Difference]: Finished difference Result 482 states and 727 transitions. [2022-07-19 20:32:11,852 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-07-19 20:32:11,853 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-19 20:32:11,853 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 20:32:11,866 INFO L225 Difference]: With dead ends: 482 [2022-07-19 20:32:11,867 INFO L226 Difference]: Without dead ends: 248 [2022-07-19 20:32:11,874 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-19 20:32:11,876 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-19 20:32:11,877 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-19 20:32:11,888 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 248 states. [2022-07-19 20:32:11,913 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 248 to 230. [2022-07-19 20:32:11,914 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-19 20:32:11,915 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 230 states to 230 states and 328 transitions. [2022-07-19 20:32:11,916 INFO L78 Accepts]: Start accepts. Automaton has 230 states and 328 transitions. Word has length 65 [2022-07-19 20:32:11,916 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 20:32:11,917 INFO L495 AbstractCegarLoop]: Abstraction has 230 states and 328 transitions. [2022-07-19 20:32:11,917 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-19 20:32:11,917 INFO L276 IsEmpty]: Start isEmpty. Operand 230 states and 328 transitions. [2022-07-19 20:32:11,919 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2022-07-19 20:32:11,919 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 20:32:11,919 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-19 20:32:11,920 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-07-19 20:32:11,920 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 20:32:11,920 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 20:32:11,921 INFO L85 PathProgramCache]: Analyzing trace with hash -488764179, now seen corresponding path program 1 times [2022-07-19 20:32:11,921 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 20:32:11,921 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1309953238] [2022-07-19 20:32:11,921 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 20:32:11,921 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 20:32:11,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 20:32:11,964 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-07-19 20:32:11,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 20:32:11,977 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-07-19 20:32:11,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 20:32:11,992 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-07-19 20:32:11,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 20:32:12,000 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-19 20:32:12,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 20:32:12,002 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-19 20:32:12,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 20:32:12,004 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2022-07-19 20:32:12,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 20:32:12,006 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2022-07-19 20:32:12,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 20:32:12,009 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-19 20:32:12,009 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 20:32:12,009 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1309953238] [2022-07-19 20:32:12,009 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1309953238] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-19 20:32:12,009 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-19 20:32:12,010 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-07-19 20:32:12,010 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2059548901] [2022-07-19 20:32:12,010 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-19 20:32:12,011 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-07-19 20:32:12,011 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 20:32:12,011 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-07-19 20:32:12,012 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2022-07-19 20:32:12,012 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-19 20:32:12,518 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 20:32:12,518 INFO L93 Difference]: Finished difference Result 453 states and 642 transitions. [2022-07-19 20:32:12,518 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-07-19 20:32:12,518 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-19 20:32:12,518 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 20:32:12,521 INFO L225 Difference]: With dead ends: 453 [2022-07-19 20:32:12,521 INFO L226 Difference]: Without dead ends: 365 [2022-07-19 20:32:12,522 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-19 20:32:12,523 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-19 20:32:12,523 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-19 20:32:12,524 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 365 states. [2022-07-19 20:32:12,584 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 365 to 326. [2022-07-19 20:32:12,585 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-19 20:32:12,586 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 326 states to 326 states and 459 transitions. [2022-07-19 20:32:12,586 INFO L78 Accepts]: Start accepts. Automaton has 326 states and 459 transitions. Word has length 65 [2022-07-19 20:32:12,587 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 20:32:12,587 INFO L495 AbstractCegarLoop]: Abstraction has 326 states and 459 transitions. [2022-07-19 20:32:12,587 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-19 20:32:12,587 INFO L276 IsEmpty]: Start isEmpty. Operand 326 states and 459 transitions. [2022-07-19 20:32:12,594 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2022-07-19 20:32:12,594 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 20:32:12,594 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-19 20:32:12,594 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-07-19 20:32:12,594 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 20:32:12,595 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 20:32:12,595 INFO L85 PathProgramCache]: Analyzing trace with hash 1049575851, now seen corresponding path program 1 times [2022-07-19 20:32:12,595 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 20:32:12,595 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1301469061] [2022-07-19 20:32:12,595 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 20:32:12,595 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 20:32:12,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 20:32:12,642 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-07-19 20:32:12,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 20:32:12,656 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-07-19 20:32:12,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 20:32:12,667 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-07-19 20:32:12,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 20:32:12,708 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-19 20:32:12,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 20:32:12,735 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-19 20:32:12,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 20:32:12,738 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2022-07-19 20:32:12,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 20:32:12,739 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2022-07-19 20:32:12,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 20:32:12,741 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-19 20:32:12,742 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 20:32:12,742 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1301469061] [2022-07-19 20:32:12,742 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1301469061] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-19 20:32:12,742 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-19 20:32:12,742 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-07-19 20:32:12,742 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [500765316] [2022-07-19 20:32:12,742 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-19 20:32:12,743 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-07-19 20:32:12,743 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 20:32:12,743 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-07-19 20:32:12,743 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2022-07-19 20:32:12,743 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-19 20:32:13,269 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 20:32:13,270 INFO L93 Difference]: Finished difference Result 540 states and 753 transitions. [2022-07-19 20:32:13,270 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-07-19 20:32:13,270 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-19 20:32:13,270 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 20:32:13,272 INFO L225 Difference]: With dead ends: 540 [2022-07-19 20:32:13,272 INFO L226 Difference]: Without dead ends: 363 [2022-07-19 20:32:13,273 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-19 20:32:13,274 INFO L413 NwaCegarLoop]: 315 mSDtfsCounter, 252 mSDsluCounter, 1134 mSDsCounter, 0 mSdLazyCounter, 820 mSolverCounterSat, 81 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s 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-19 20:32:13,274 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-19 20:32:13,275 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 363 states. [2022-07-19 20:32:13,287 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 363 to 331. [2022-07-19 20:32:13,288 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-19 20:32:13,289 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 331 states to 331 states and 463 transitions. [2022-07-19 20:32:13,289 INFO L78 Accepts]: Start accepts. Automaton has 331 states and 463 transitions. Word has length 65 [2022-07-19 20:32:13,289 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 20:32:13,289 INFO L495 AbstractCegarLoop]: Abstraction has 331 states and 463 transitions. [2022-07-19 20:32:13,289 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-19 20:32:13,289 INFO L276 IsEmpty]: Start isEmpty. Operand 331 states and 463 transitions. [2022-07-19 20:32:13,303 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2022-07-19 20:32:13,303 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 20:32:13,304 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-19 20:32:13,304 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-07-19 20:32:13,304 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 20:32:13,304 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 20:32:13,304 INFO L85 PathProgramCache]: Analyzing trace with hash 20216553, now seen corresponding path program 1 times [2022-07-19 20:32:13,304 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 20:32:13,304 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1822414594] [2022-07-19 20:32:13,304 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 20:32:13,305 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 20:32:13,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 20:32:13,365 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-07-19 20:32:13,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 20:32:13,384 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-07-19 20:32:13,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 20:32:13,393 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-07-19 20:32:13,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 20:32:13,408 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-19 20:32:13,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 20:32:13,410 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-19 20:32:13,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 20:32:13,413 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2022-07-19 20:32:13,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 20:32:13,415 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2022-07-19 20:32:13,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 20:32:13,416 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-19 20:32:13,417 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 20:32:13,417 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1822414594] [2022-07-19 20:32:13,417 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1822414594] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-19 20:32:13,417 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-19 20:32:13,417 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-07-19 20:32:13,417 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [437758583] [2022-07-19 20:32:13,417 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-19 20:32:13,417 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-07-19 20:32:13,418 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 20:32:13,418 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-07-19 20:32:13,418 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2022-07-19 20:32:13,418 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-19 20:32:14,620 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 20:32:14,620 INFO L93 Difference]: Finished difference Result 1231 states and 1681 transitions. [2022-07-19 20:32:14,620 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2022-07-19 20:32:14,621 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-19 20:32:14,621 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 20:32:14,625 INFO L225 Difference]: With dead ends: 1231 [2022-07-19 20:32:14,625 INFO L226 Difference]: Without dead ends: 1037 [2022-07-19 20:32:14,626 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-19 20:32:14,627 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-19 20:32:14,627 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-19 20:32:14,629 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1037 states. [2022-07-19 20:32:14,659 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1037 to 912. [2022-07-19 20:32:14,660 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-19 20:32:14,663 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 912 states to 912 states and 1204 transitions. [2022-07-19 20:32:14,663 INFO L78 Accepts]: Start accepts. Automaton has 912 states and 1204 transitions. Word has length 65 [2022-07-19 20:32:14,663 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 20:32:14,664 INFO L495 AbstractCegarLoop]: Abstraction has 912 states and 1204 transitions. [2022-07-19 20:32:14,664 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-19 20:32:14,664 INFO L276 IsEmpty]: Start isEmpty. Operand 912 states and 1204 transitions. [2022-07-19 20:32:14,664 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2022-07-19 20:32:14,664 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 20:32:14,665 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-19 20:32:14,665 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-07-19 20:32:14,665 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 20:32:14,665 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 20:32:14,665 INFO L85 PathProgramCache]: Analyzing trace with hash 1071665642, now seen corresponding path program 1 times [2022-07-19 20:32:14,665 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 20:32:14,665 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1646327085] [2022-07-19 20:32:14,666 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 20:32:14,666 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 20:32:14,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 20:32:14,688 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-07-19 20:32:14,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 20:32:14,693 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-07-19 20:32:14,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 20:32:14,698 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-07-19 20:32:14,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 20:32:14,722 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-19 20:32:14,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 20:32:14,724 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-19 20:32:14,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 20:32:14,754 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2022-07-19 20:32:14,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 20:32:14,757 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2022-07-19 20:32:14,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 20:32:14,758 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-19 20:32:14,759 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 20:32:14,759 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1646327085] [2022-07-19 20:32:14,759 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1646327085] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-19 20:32:14,759 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-19 20:32:14,759 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-07-19 20:32:14,759 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [640622524] [2022-07-19 20:32:14,760 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-19 20:32:14,760 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-07-19 20:32:14,760 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 20:32:14,760 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-07-19 20:32:14,761 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2022-07-19 20:32:14,761 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-19 20:32:15,252 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 20:32:15,253 INFO L93 Difference]: Finished difference Result 1793 states and 2347 transitions. [2022-07-19 20:32:15,253 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-07-19 20:32:15,253 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-19 20:32:15,253 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 20:32:15,257 INFO L225 Difference]: With dead ends: 1793 [2022-07-19 20:32:15,257 INFO L226 Difference]: Without dead ends: 1024 [2022-07-19 20:32:15,258 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-19 20:32:15,259 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-19 20:32:15,259 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-19 20:32:15,260 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1024 states. [2022-07-19 20:32:15,283 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1024 to 932. [2022-07-19 20:32:15,284 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-19 20:32:15,287 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 932 states to 932 states and 1219 transitions. [2022-07-19 20:32:15,287 INFO L78 Accepts]: Start accepts. Automaton has 932 states and 1219 transitions. Word has length 65 [2022-07-19 20:32:15,287 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 20:32:15,287 INFO L495 AbstractCegarLoop]: Abstraction has 932 states and 1219 transitions. [2022-07-19 20:32:15,288 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-19 20:32:15,288 INFO L276 IsEmpty]: Start isEmpty. Operand 932 states and 1219 transitions. [2022-07-19 20:32:15,288 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2022-07-19 20:32:15,288 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 20:32:15,289 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-19 20:32:15,289 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-07-19 20:32:15,289 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 20:32:15,289 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 20:32:15,289 INFO L85 PathProgramCache]: Analyzing trace with hash -1837098260, now seen corresponding path program 1 times [2022-07-19 20:32:15,289 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 20:32:15,290 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1570657346] [2022-07-19 20:32:15,290 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 20:32:15,290 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 20:32:15,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 20:32:15,312 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-07-19 20:32:15,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 20:32:15,323 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-07-19 20:32:15,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 20:32:15,331 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-07-19 20:32:15,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 20:32:15,334 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-19 20:32:15,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 20:32:15,335 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-19 20:32:15,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 20:32:15,336 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2022-07-19 20:32:15,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 20:32:15,357 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2022-07-19 20:32:15,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 20:32:15,358 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-19 20:32:15,358 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 20:32:15,359 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1570657346] [2022-07-19 20:32:15,359 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1570657346] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-19 20:32:15,359 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-19 20:32:15,359 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-07-19 20:32:15,359 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1333540901] [2022-07-19 20:32:15,359 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-19 20:32:15,360 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-07-19 20:32:15,360 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 20:32:15,360 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-07-19 20:32:15,360 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2022-07-19 20:32:15,360 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-19 20:32:15,963 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 20:32:15,963 INFO L93 Difference]: Finished difference Result 2500 states and 3166 transitions. [2022-07-19 20:32:15,963 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-07-19 20:32:15,964 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-19 20:32:15,964 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 20:32:15,969 INFO L225 Difference]: With dead ends: 2500 [2022-07-19 20:32:15,969 INFO L226 Difference]: Without dead ends: 1712 [2022-07-19 20:32:15,971 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-19 20:32:15,972 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.5s IncrementalHoareTripleChecker+Time [2022-07-19 20:32:15,972 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.5s Time] [2022-07-19 20:32:15,973 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1712 states. [2022-07-19 20:32:16,008 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1712 to 1380. [2022-07-19 20:32:16,010 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-19 20:32:16,014 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1380 states to 1380 states and 1786 transitions. [2022-07-19 20:32:16,014 INFO L78 Accepts]: Start accepts. Automaton has 1380 states and 1786 transitions. Word has length 65 [2022-07-19 20:32:16,014 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 20:32:16,015 INFO L495 AbstractCegarLoop]: Abstraction has 1380 states and 1786 transitions. [2022-07-19 20:32:16,015 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-19 20:32:16,015 INFO L276 IsEmpty]: Start isEmpty. Operand 1380 states and 1786 transitions. [2022-07-19 20:32:16,016 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2022-07-19 20:32:16,016 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 20:32:16,016 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-19 20:32:16,016 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-07-19 20:32:16,016 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 20:32:16,017 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 20:32:16,017 INFO L85 PathProgramCache]: Analyzing trace with hash -1971111766, now seen corresponding path program 1 times [2022-07-19 20:32:16,017 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 20:32:16,017 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1743518047] [2022-07-19 20:32:16,017 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 20:32:16,017 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 20:32:16,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 20:32:16,045 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-07-19 20:32:16,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 20:32:16,050 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-07-19 20:32:16,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 20:32:16,071 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-07-19 20:32:16,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 20:32:16,080 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-19 20:32:16,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 20:32:16,081 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-19 20:32:16,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 20:32:16,083 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2022-07-19 20:32:16,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 20:32:16,084 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2022-07-19 20:32:16,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 20:32:16,086 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-19 20:32:16,087 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 20:32:16,087 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1743518047] [2022-07-19 20:32:16,087 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1743518047] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-19 20:32:16,087 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-19 20:32:16,087 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-07-19 20:32:16,087 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1844233568] [2022-07-19 20:32:16,087 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-19 20:32:16,088 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-07-19 20:32:16,088 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 20:32:16,088 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-07-19 20:32:16,088 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2022-07-19 20:32:16,094 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-19 20:32:16,466 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 20:32:16,466 INFO L93 Difference]: Finished difference Result 3851 states and 4925 transitions. [2022-07-19 20:32:16,467 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-07-19 20:32:16,467 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-19 20:32:16,467 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 20:32:16,476 INFO L225 Difference]: With dead ends: 3851 [2022-07-19 20:32:16,476 INFO L226 Difference]: Without dead ends: 2617 [2022-07-19 20:32:16,479 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-19 20:32:16,480 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.3s IncrementalHoareTripleChecker+Time [2022-07-19 20:32:16,480 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.3s Time] [2022-07-19 20:32:16,482 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2617 states. [2022-07-19 20:32:16,570 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2617 to 2509. [2022-07-19 20:32:16,573 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-19 20:32:16,580 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2509 states to 2509 states and 3170 transitions. [2022-07-19 20:32:16,581 INFO L78 Accepts]: Start accepts. Automaton has 2509 states and 3170 transitions. Word has length 65 [2022-07-19 20:32:16,582 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 20:32:16,582 INFO L495 AbstractCegarLoop]: Abstraction has 2509 states and 3170 transitions. [2022-07-19 20:32:16,582 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-19 20:32:16,582 INFO L276 IsEmpty]: Start isEmpty. Operand 2509 states and 3170 transitions. [2022-07-19 20:32:16,583 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2022-07-19 20:32:16,583 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 20:32:16,583 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-19 20:32:16,583 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-07-19 20:32:16,584 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 20:32:16,584 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 20:32:16,584 INFO L85 PathProgramCache]: Analyzing trace with hash -291684510, now seen corresponding path program 1 times [2022-07-19 20:32:16,584 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 20:32:16,585 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [348151866] [2022-07-19 20:32:16,585 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 20:32:16,585 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 20:32:16,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 20:32:16,614 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-07-19 20:32:16,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 20:32:16,621 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-07-19 20:32:16,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 20:32:16,628 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-07-19 20:32:16,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 20:32:16,632 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-19 20:32:16,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 20:32:16,635 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-19 20:32:16,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 20:32:16,636 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2022-07-19 20:32:16,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 20:32:16,641 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2022-07-19 20:32:16,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 20:32:16,643 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-19 20:32:16,643 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 20:32:16,643 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [348151866] [2022-07-19 20:32:16,644 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [348151866] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-19 20:32:16,644 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-19 20:32:16,644 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-19 20:32:16,644 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1312905413] [2022-07-19 20:32:16,644 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-19 20:32:16,645 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-19 20:32:16,645 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 20:32:16,646 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-19 20:32:16,646 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-07-19 20:32:16,646 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-19 20:32:17,078 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 20:32:17,078 INFO L93 Difference]: Finished difference Result 5831 states and 7344 transitions. [2022-07-19 20:32:17,078 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-07-19 20:32:17,079 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-19 20:32:17,080 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 20:32:17,091 INFO L225 Difference]: With dead ends: 5831 [2022-07-19 20:32:17,091 INFO L226 Difference]: Without dead ends: 3468 [2022-07-19 20:32:17,094 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-19 20:32:17,096 INFO L413 NwaCegarLoop]: 321 mSDtfsCounter, 421 mSDsluCounter, 583 mSDsCounter, 0 mSdLazyCounter, 353 mSolverCounterSat, 119 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s 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-19 20:32:17,098 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-19 20:32:17,101 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3468 states. [2022-07-19 20:32:17,188 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3468 to 3214. [2022-07-19 20:32:17,191 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-19 20:32:17,199 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3214 states to 3214 states and 4017 transitions. [2022-07-19 20:32:17,200 INFO L78 Accepts]: Start accepts. Automaton has 3214 states and 4017 transitions. Word has length 66 [2022-07-19 20:32:17,200 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 20:32:17,200 INFO L495 AbstractCegarLoop]: Abstraction has 3214 states and 4017 transitions. [2022-07-19 20:32:17,200 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-19 20:32:17,200 INFO L276 IsEmpty]: Start isEmpty. Operand 3214 states and 4017 transitions. [2022-07-19 20:32:17,201 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2022-07-19 20:32:17,201 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 20:32:17,201 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-19 20:32:17,201 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-07-19 20:32:17,202 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 20:32:17,202 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 20:32:17,202 INFO L85 PathProgramCache]: Analyzing trace with hash 342944188, now seen corresponding path program 1 times [2022-07-19 20:32:17,202 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 20:32:17,202 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [306071882] [2022-07-19 20:32:17,202 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 20:32:17,202 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 20:32:17,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 20:32:17,218 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-07-19 20:32:17,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 20:32:17,226 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-07-19 20:32:17,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 20:32:17,233 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2022-07-19 20:32:17,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 20:32:17,237 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2022-07-19 20:32:17,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 20:32:17,239 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2022-07-19 20:32:17,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 20:32:17,240 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-19 20:32:17,240 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 20:32:17,241 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [306071882] [2022-07-19 20:32:17,241 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [306071882] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-19 20:32:17,241 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-19 20:32:17,241 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-07-19 20:32:17,241 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1312105560] [2022-07-19 20:32:17,241 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-19 20:32:17,242 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-07-19 20:32:17,242 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 20:32:17,242 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-19 20:32:17,242 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-07-19 20:32:17,242 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-19 20:32:17,655 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 20:32:17,655 INFO L93 Difference]: Finished difference Result 3374 states and 4261 transitions. [2022-07-19 20:32:17,655 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-19 20:32:17,656 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-19 20:32:17,656 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 20:32:17,665 INFO L225 Difference]: With dead ends: 3374 [2022-07-19 20:32:17,666 INFO L226 Difference]: Without dead ends: 3246 [2022-07-19 20:32:17,667 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 13 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-19 20:32:17,667 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-19 20:32:17,667 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-19 20:32:17,669 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3246 states. [2022-07-19 20:32:17,783 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3246 to 3214. [2022-07-19 20:32:17,787 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-19 20:32:17,792 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3214 states to 3214 states and 4016 transitions. [2022-07-19 20:32:17,793 INFO L78 Accepts]: Start accepts. Automaton has 3214 states and 4016 transitions. Word has length 69 [2022-07-19 20:32:17,793 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 20:32:17,793 INFO L495 AbstractCegarLoop]: Abstraction has 3214 states and 4016 transitions. [2022-07-19 20:32:17,793 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-19 20:32:17,794 INFO L276 IsEmpty]: Start isEmpty. Operand 3214 states and 4016 transitions. [2022-07-19 20:32:17,794 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2022-07-19 20:32:17,794 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 20:32:17,795 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-19 20:32:17,795 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-07-19 20:32:17,795 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 20:32:17,795 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 20:32:17,795 INFO L85 PathProgramCache]: Analyzing trace with hash -1618630470, now seen corresponding path program 1 times [2022-07-19 20:32:17,795 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 20:32:17,796 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [799856919] [2022-07-19 20:32:17,796 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 20:32:17,796 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 20:32:17,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 20:32:17,810 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-07-19 20:32:17,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 20:32:17,819 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-07-19 20:32:17,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 20:32:17,834 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2022-07-19 20:32:17,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 20:32:17,838 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2022-07-19 20:32:17,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 20:32:17,840 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2022-07-19 20:32:17,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 20:32:17,842 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-19 20:32:17,842 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 20:32:17,842 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [799856919] [2022-07-19 20:32:17,842 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [799856919] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-19 20:32:17,842 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-19 20:32:17,842 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-19 20:32:17,842 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [853056505] [2022-07-19 20:32:17,843 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-19 20:32:17,843 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-19 20:32:17,843 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 20:32:17,843 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-19 20:32:17,843 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-19 20:32:17,844 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-19 20:32:18,440 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 20:32:18,441 INFO L93 Difference]: Finished difference Result 3524 states and 4487 transitions. [2022-07-19 20:32:18,441 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-07-19 20:32:18,442 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-19 20:32:18,442 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 20:32:18,451 INFO L225 Difference]: With dead ends: 3524 [2022-07-19 20:32:18,451 INFO L226 Difference]: Without dead ends: 3400 [2022-07-19 20:32:18,452 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-19 20:32:18,453 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.5s IncrementalHoareTripleChecker+Time [2022-07-19 20:32:18,453 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.5s Time] [2022-07-19 20:32:18,455 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3400 states. [2022-07-19 20:32:18,549 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3400 to 3335. [2022-07-19 20:32:18,553 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-19 20:32:18,562 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3335 states to 3335 states and 4197 transitions. [2022-07-19 20:32:18,562 INFO L78 Accepts]: Start accepts. Automaton has 3335 states and 4197 transitions. Word has length 69 [2022-07-19 20:32:18,562 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 20:32:18,563 INFO L495 AbstractCegarLoop]: Abstraction has 3335 states and 4197 transitions. [2022-07-19 20:32:18,563 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-19 20:32:18,563 INFO L276 IsEmpty]: Start isEmpty. Operand 3335 states and 4197 transitions. [2022-07-19 20:32:18,564 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2022-07-19 20:32:18,564 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 20:32:18,564 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-19 20:32:18,564 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-07-19 20:32:18,564 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 20:32:18,565 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 20:32:18,565 INFO L85 PathProgramCache]: Analyzing trace with hash -1515916106, now seen corresponding path program 1 times [2022-07-19 20:32:18,565 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 20:32:18,565 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1742884596] [2022-07-19 20:32:18,565 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 20:32:18,566 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 20:32:18,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 20:32:18,578 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-07-19 20:32:18,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 20:32:18,587 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-07-19 20:32:18,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 20:32:18,605 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2022-07-19 20:32:18,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 20:32:18,611 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2022-07-19 20:32:18,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 20:32:18,613 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2022-07-19 20:32:18,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 20:32:18,614 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-19 20:32:18,614 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 20:32:18,614 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1742884596] [2022-07-19 20:32:18,615 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1742884596] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-19 20:32:18,615 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-19 20:32:18,615 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-07-19 20:32:18,615 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [530500684] [2022-07-19 20:32:18,615 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-19 20:32:18,615 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-07-19 20:32:18,615 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 20:32:18,616 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-07-19 20:32:18,616 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-07-19 20:32:18,616 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-19 20:32:19,365 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 20:32:19,366 INFO L93 Difference]: Finished difference Result 3797 states and 4891 transitions. [2022-07-19 20:32:19,366 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-07-19 20:32:19,366 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-19 20:32:19,366 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 20:32:19,378 INFO L225 Difference]: With dead ends: 3797 [2022-07-19 20:32:19,378 INFO L226 Difference]: Without dead ends: 3552 [2022-07-19 20:32:19,380 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-19 20:32:19,381 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-19 20:32:19,381 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-19 20:32:19,384 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3552 states. [2022-07-19 20:32:19,526 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3552 to 3449. [2022-07-19 20:32:19,531 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-19 20:32:19,539 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3449 states to 3449 states and 4363 transitions. [2022-07-19 20:32:19,540 INFO L78 Accepts]: Start accepts. Automaton has 3449 states and 4363 transitions. Word has length 69 [2022-07-19 20:32:19,540 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 20:32:19,540 INFO L495 AbstractCegarLoop]: Abstraction has 3449 states and 4363 transitions. [2022-07-19 20:32:19,541 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-19 20:32:19,541 INFO L276 IsEmpty]: Start isEmpty. Operand 3449 states and 4363 transitions. [2022-07-19 20:32:19,542 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2022-07-19 20:32:19,543 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 20:32:19,543 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-19 20:32:19,543 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-07-19 20:32:19,543 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 20:32:19,543 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 20:32:19,543 INFO L85 PathProgramCache]: Analyzing trace with hash -129130696, now seen corresponding path program 1 times [2022-07-19 20:32:19,544 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 20:32:19,544 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1225950223] [2022-07-19 20:32:19,544 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 20:32:19,544 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 20:32:19,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 20:32:19,571 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-07-19 20:32:19,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 20:32:19,581 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-07-19 20:32:19,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 20:32:19,598 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2022-07-19 20:32:19,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 20:32:19,602 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2022-07-19 20:32:19,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 20:32:19,604 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2022-07-19 20:32:19,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 20:32:19,606 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-19 20:32:19,606 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 20:32:19,606 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1225950223] [2022-07-19 20:32:19,606 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1225950223] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-19 20:32:19,606 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-19 20:32:19,606 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-07-19 20:32:19,607 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1677866461] [2022-07-19 20:32:19,607 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-19 20:32:19,607 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-07-19 20:32:19,607 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 20:32:19,607 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-07-19 20:32:19,608 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2022-07-19 20:32:19,608 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-19 20:32:20,068 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 20:32:20,068 INFO L93 Difference]: Finished difference Result 3907 states and 5057 transitions. [2022-07-19 20:32:20,068 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-19 20:32:20,068 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-19 20:32:20,069 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 20:32:20,078 INFO L225 Difference]: With dead ends: 3907 [2022-07-19 20:32:20,079 INFO L226 Difference]: Without dead ends: 3548 [2022-07-19 20:32:20,080 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-19 20:32:20,081 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-19 20:32:20,081 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-19 20:32:20,083 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3548 states. [2022-07-19 20:32:20,189 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3548 to 3449. [2022-07-19 20:32:20,204 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-19 20:32:20,211 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3449 states to 3449 states and 4360 transitions. [2022-07-19 20:32:20,212 INFO L78 Accepts]: Start accepts. Automaton has 3449 states and 4360 transitions. Word has length 69 [2022-07-19 20:32:20,212 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 20:32:20,212 INFO L495 AbstractCegarLoop]: Abstraction has 3449 states and 4360 transitions. [2022-07-19 20:32:20,213 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-19 20:32:20,213 INFO L276 IsEmpty]: Start isEmpty. Operand 3449 states and 4360 transitions. [2022-07-19 20:32:20,214 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2022-07-19 20:32:20,214 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 20:32:20,214 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-19 20:32:20,214 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-07-19 20:32:20,214 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 20:32:20,214 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 20:32:20,215 INFO L85 PathProgramCache]: Analyzing trace with hash 314769978, now seen corresponding path program 1 times [2022-07-19 20:32:20,215 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 20:32:20,215 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1554782489] [2022-07-19 20:32:20,215 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 20:32:20,215 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 20:32:20,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 20:32:20,245 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-07-19 20:32:20,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 20:32:20,254 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-07-19 20:32:20,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 20:32:20,272 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2022-07-19 20:32:20,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 20:32:20,275 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2022-07-19 20:32:20,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 20:32:20,277 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2022-07-19 20:32:20,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 20:32:20,278 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-19 20:32:20,279 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 20:32:20,279 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1554782489] [2022-07-19 20:32:20,279 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1554782489] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-19 20:32:20,279 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-19 20:32:20,279 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-07-19 20:32:20,279 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [830263963] [2022-07-19 20:32:20,279 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-19 20:32:20,280 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-07-19 20:32:20,280 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 20:32:20,280 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-07-19 20:32:20,280 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-07-19 20:32:20,280 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-19 20:32:21,071 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 20:32:21,071 INFO L93 Difference]: Finished difference Result 4243 states and 5535 transitions. [2022-07-19 20:32:21,072 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-07-19 20:32:21,072 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-19 20:32:21,072 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 20:32:21,094 INFO L225 Difference]: With dead ends: 4243 [2022-07-19 20:32:21,094 INFO L226 Difference]: Without dead ends: 3884 [2022-07-19 20:32:21,097 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-19 20:32:21,098 INFO L413 NwaCegarLoop]: 409 mSDtfsCounter, 672 mSDsluCounter, 880 mSDsCounter, 0 mSdLazyCounter, 1018 mSolverCounterSat, 107 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s 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.6s IncrementalHoareTripleChecker+Time [2022-07-19 20:32:21,099 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.6s Time] [2022-07-19 20:32:21,102 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3884 states. [2022-07-19 20:32:21,256 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3884 to 3658. [2022-07-19 20:32:21,260 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-19 20:32:21,267 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3658 states to 3658 states and 4661 transitions. [2022-07-19 20:32:21,268 INFO L78 Accepts]: Start accepts. Automaton has 3658 states and 4661 transitions. Word has length 69 [2022-07-19 20:32:21,268 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 20:32:21,268 INFO L495 AbstractCegarLoop]: Abstraction has 3658 states and 4661 transitions. [2022-07-19 20:32:21,268 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-19 20:32:21,269 INFO L276 IsEmpty]: Start isEmpty. Operand 3658 states and 4661 transitions. [2022-07-19 20:32:21,270 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2022-07-19 20:32:21,270 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 20:32:21,270 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-19 20:32:21,270 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-07-19 20:32:21,270 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 20:32:21,271 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 20:32:21,271 INFO L85 PathProgramCache]: Analyzing trace with hash 1853110008, now seen corresponding path program 1 times [2022-07-19 20:32:21,271 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 20:32:21,271 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1231954176] [2022-07-19 20:32:21,271 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 20:32:21,271 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 20:32:21,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 20:32:21,285 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-07-19 20:32:21,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 20:32:21,293 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-07-19 20:32:21,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 20:32:21,312 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2022-07-19 20:32:21,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 20:32:21,317 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2022-07-19 20:32:21,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 20:32:21,318 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2022-07-19 20:32:21,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 20:32:21,320 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-19 20:32:21,320 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 20:32:21,320 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1231954176] [2022-07-19 20:32:21,320 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1231954176] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-19 20:32:21,320 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-19 20:32:21,320 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-07-19 20:32:21,320 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2061023919] [2022-07-19 20:32:21,321 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-19 20:32:21,321 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-07-19 20:32:21,321 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 20:32:21,322 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-07-19 20:32:21,322 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-07-19 20:32:21,322 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-19 20:32:22,227 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 20:32:22,228 INFO L93 Difference]: Finished difference Result 4946 states and 6542 transitions. [2022-07-19 20:32:22,228 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-07-19 20:32:22,228 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-19 20:32:22,228 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 20:32:22,239 INFO L225 Difference]: With dead ends: 4946 [2022-07-19 20:32:22,239 INFO L226 Difference]: Without dead ends: 4378 [2022-07-19 20:32:22,242 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-19 20:32:22,242 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-19 20:32:22,244 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-19 20:32:22,248 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4378 states. [2022-07-19 20:32:22,397 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4378 to 4089. [2022-07-19 20:32:22,400 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-19 20:32:22,409 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4089 states to 4089 states and 5293 transitions. [2022-07-19 20:32:22,410 INFO L78 Accepts]: Start accepts. Automaton has 4089 states and 5293 transitions. Word has length 69 [2022-07-19 20:32:22,410 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 20:32:22,410 INFO L495 AbstractCegarLoop]: Abstraction has 4089 states and 5293 transitions. [2022-07-19 20:32:22,410 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-19 20:32:22,411 INFO L276 IsEmpty]: Start isEmpty. Operand 4089 states and 5293 transitions. [2022-07-19 20:32:22,412 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2022-07-19 20:32:22,412 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 20:32:22,412 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-19 20:32:22,412 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2022-07-19 20:32:22,412 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 20:32:22,413 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 20:32:22,413 INFO L85 PathProgramCache]: Analyzing trace with hash -175476102, now seen corresponding path program 1 times [2022-07-19 20:32:22,413 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 20:32:22,413 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1236925611] [2022-07-19 20:32:22,413 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 20:32:22,413 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 20:32:22,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 20:32:22,430 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-07-19 20:32:22,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 20:32:22,437 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-07-19 20:32:22,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 20:32:22,443 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2022-07-19 20:32:22,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 20:32:22,471 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2022-07-19 20:32:22,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 20:32:22,474 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2022-07-19 20:32:22,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 20:32:22,476 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-19 20:32:22,476 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 20:32:22,476 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1236925611] [2022-07-19 20:32:22,476 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1236925611] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-19 20:32:22,477 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-19 20:32:22,477 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-07-19 20:32:22,477 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [883025558] [2022-07-19 20:32:22,477 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-19 20:32:22,477 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-07-19 20:32:22,477 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 20:32:22,478 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-07-19 20:32:22,478 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-07-19 20:32:22,478 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-19 20:32:23,181 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 20:32:23,181 INFO L93 Difference]: Finished difference Result 5625 states and 7572 transitions. [2022-07-19 20:32:23,181 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-07-19 20:32:23,182 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-19 20:32:23,182 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 20:32:23,199 INFO L225 Difference]: With dead ends: 5625 [2022-07-19 20:32:23,199 INFO L226 Difference]: Without dead ends: 4627 [2022-07-19 20:32:23,204 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-19 20:32:23,205 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-19 20:32:23,205 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-19 20:32:23,208 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4627 states. [2022-07-19 20:32:23,341 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4627 to 4116. [2022-07-19 20:32:23,344 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-19 20:32:23,352 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4116 states to 4116 states and 5320 transitions. [2022-07-19 20:32:23,353 INFO L78 Accepts]: Start accepts. Automaton has 4116 states and 5320 transitions. Word has length 69 [2022-07-19 20:32:23,353 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 20:32:23,353 INFO L495 AbstractCegarLoop]: Abstraction has 4116 states and 5320 transitions. [2022-07-19 20:32:23,353 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-19 20:32:23,354 INFO L276 IsEmpty]: Start isEmpty. Operand 4116 states and 5320 transitions. [2022-07-19 20:32:23,355 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2022-07-19 20:32:23,355 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 20:32:23,355 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-19 20:32:23,355 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2022-07-19 20:32:23,355 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 20:32:23,356 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 20:32:23,356 INFO L85 PathProgramCache]: Analyzing trace with hash 72670392, now seen corresponding path program 1 times [2022-07-19 20:32:23,356 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 20:32:23,356 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1842388424] [2022-07-19 20:32:23,356 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 20:32:23,356 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 20:32:23,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 20:32:23,373 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-07-19 20:32:23,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 20:32:23,383 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-07-19 20:32:23,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 20:32:23,389 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2022-07-19 20:32:23,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 20:32:23,438 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2022-07-19 20:32:23,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 20:32:23,445 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2022-07-19 20:32:23,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 20:32:23,447 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-19 20:32:23,447 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 20:32:23,447 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1842388424] [2022-07-19 20:32:23,449 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1842388424] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-19 20:32:23,449 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-19 20:32:23,449 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-07-19 20:32:23,449 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1596773303] [2022-07-19 20:32:23,449 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-19 20:32:23,450 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-07-19 20:32:23,450 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 20:32:23,450 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-07-19 20:32:23,450 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2022-07-19 20:32:23,450 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-19 20:32:24,695 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 20:32:24,696 INFO L93 Difference]: Finished difference Result 7610 states and 10576 transitions. [2022-07-19 20:32:24,696 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2022-07-19 20:32:24,696 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-19 20:32:24,696 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 20:32:24,711 INFO L225 Difference]: With dead ends: 7610 [2022-07-19 20:32:24,712 INFO L226 Difference]: Without dead ends: 6585 [2022-07-19 20:32:24,715 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 52 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=87, Invalid=219, Unknown=0, NotChecked=0, Total=306 [2022-07-19 20:32:24,715 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-19 20:32:24,715 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-19 20:32:24,719 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6585 states. [2022-07-19 20:32:24,928 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6585 to 6034. [2022-07-19 20:32:24,933 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-19 20:32:24,941 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6034 states to 6034 states and 8083 transitions. [2022-07-19 20:32:24,942 INFO L78 Accepts]: Start accepts. Automaton has 6034 states and 8083 transitions. Word has length 69 [2022-07-19 20:32:24,942 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 20:32:24,942 INFO L495 AbstractCegarLoop]: Abstraction has 6034 states and 8083 transitions. [2022-07-19 20:32:24,942 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-19 20:32:24,942 INFO L276 IsEmpty]: Start isEmpty. Operand 6034 states and 8083 transitions. [2022-07-19 20:32:24,944 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2022-07-19 20:32:24,944 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 20:32:24,944 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-19 20:32:24,944 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2022-07-19 20:32:24,944 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 20:32:24,944 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 20:32:24,945 INFO L85 PathProgramCache]: Analyzing trace with hash 867157537, now seen corresponding path program 1 times [2022-07-19 20:32:24,945 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 20:32:24,945 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2103301069] [2022-07-19 20:32:24,945 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 20:32:24,945 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 20:32:24,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 20:32:24,961 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-07-19 20:32:24,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 20:32:24,984 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-07-19 20:32:24,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 20:32:24,990 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-07-19 20:32:24,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 20:32:24,992 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-19 20:32:24,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 20:32:24,993 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-19 20:32:24,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 20:32:24,994 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2022-07-19 20:32:24,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 20:32:24,995 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2022-07-19 20:32:24,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 20:32:24,997 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-19 20:32:24,997 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 20:32:24,998 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2103301069] [2022-07-19 20:32:24,998 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2103301069] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-19 20:32:24,998 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-19 20:32:24,998 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-19 20:32:24,998 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [148667407] [2022-07-19 20:32:24,998 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-19 20:32:24,999 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-19 20:32:24,999 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 20:32:24,999 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-19 20:32:24,999 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-07-19 20:32:24,999 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-19 20:32:25,493 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 20:32:25,494 INFO L93 Difference]: Finished difference Result 9620 states and 12513 transitions. [2022-07-19 20:32:25,494 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-07-19 20:32:25,494 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-19 20:32:25,494 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 20:32:25,512 INFO L225 Difference]: With dead ends: 9620 [2022-07-19 20:32:25,512 INFO L226 Difference]: Without dead ends: 6550 [2022-07-19 20:32:25,518 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=39, Invalid=71, Unknown=0, NotChecked=0, Total=110 [2022-07-19 20:32:25,518 INFO L413 NwaCegarLoop]: 333 mSDtfsCounter, 572 mSDsluCounter, 504 mSDsCounter, 0 mSdLazyCounter, 272 mSolverCounterSat, 110 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s 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-19 20:32:25,519 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-19 20:32:25,523 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6550 states. [2022-07-19 20:32:25,759 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6550 to 6317. [2022-07-19 20:32:25,764 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-19 20:32:25,773 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6317 states to 6317 states and 8413 transitions. [2022-07-19 20:32:25,774 INFO L78 Accepts]: Start accepts. Automaton has 6317 states and 8413 transitions. Word has length 72 [2022-07-19 20:32:25,774 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 20:32:25,774 INFO L495 AbstractCegarLoop]: Abstraction has 6317 states and 8413 transitions. [2022-07-19 20:32:25,775 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-19 20:32:25,775 INFO L276 IsEmpty]: Start isEmpty. Operand 6317 states and 8413 transitions. [2022-07-19 20:32:25,776 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2022-07-19 20:32:25,776 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 20:32:25,776 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-19 20:32:25,776 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2022-07-19 20:32:25,777 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 20:32:25,777 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 20:32:25,777 INFO L85 PathProgramCache]: Analyzing trace with hash 595856072, now seen corresponding path program 1 times [2022-07-19 20:32:25,777 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 20:32:25,777 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [708928289] [2022-07-19 20:32:25,777 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 20:32:25,778 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 20:32:25,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 20:32:25,799 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-07-19 20:32:25,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 20:32:25,804 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-07-19 20:32:25,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 20:32:25,809 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-07-19 20:32:25,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 20:32:25,811 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-19 20:32:25,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 20:32:25,812 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-19 20:32:25,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 20:32:25,812 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2022-07-19 20:32:25,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 20:32:25,813 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2022-07-19 20:32:25,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 20:32:25,815 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-19 20:32:25,815 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 20:32:25,815 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [708928289] [2022-07-19 20:32:25,815 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [708928289] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-19 20:32:25,815 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-19 20:32:25,815 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-07-19 20:32:25,815 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1407311780] [2022-07-19 20:32:25,815 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-19 20:32:25,816 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-07-19 20:32:25,816 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 20:32:25,816 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-07-19 20:32:25,816 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2022-07-19 20:32:25,816 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-19 20:32:26,406 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 20:32:26,407 INFO L93 Difference]: Finished difference Result 7371 states and 9680 transitions. [2022-07-19 20:32:26,407 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-07-19 20:32:26,407 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-19 20:32:26,407 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 20:32:26,454 INFO L225 Difference]: With dead ends: 7371 [2022-07-19 20:32:26,454 INFO L226 Difference]: Without dead ends: 7368 [2022-07-19 20:32:26,456 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-19 20:32:26,457 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.3s IncrementalHoareTripleChecker+Time [2022-07-19 20:32:26,457 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.3s Time] [2022-07-19 20:32:26,466 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7368 states. [2022-07-19 20:32:26,714 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7368 to 7074. [2022-07-19 20:32:26,719 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-19 20:32:26,769 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7074 states to 7074 states and 9323 transitions. [2022-07-19 20:32:26,770 INFO L78 Accepts]: Start accepts. Automaton has 7074 states and 9323 transitions. Word has length 73 [2022-07-19 20:32:26,770 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 20:32:26,770 INFO L495 AbstractCegarLoop]: Abstraction has 7074 states and 9323 transitions. [2022-07-19 20:32:26,770 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-19 20:32:26,770 INFO L276 IsEmpty]: Start isEmpty. Operand 7074 states and 9323 transitions. [2022-07-19 20:32:26,772 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2022-07-19 20:32:26,772 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 20:32:26,772 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-19 20:32:26,772 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2022-07-19 20:32:26,772 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 20:32:26,773 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 20:32:26,773 INFO L85 PathProgramCache]: Analyzing trace with hash 1290941259, now seen corresponding path program 1 times [2022-07-19 20:32:26,773 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 20:32:26,773 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1151618438] [2022-07-19 20:32:26,773 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 20:32:26,773 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 20:32:26,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 20:32:26,819 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-07-19 20:32:26,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 20:32:26,825 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-07-19 20:32:26,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 20:32:26,832 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-07-19 20:32:26,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 20:32:26,836 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-19 20:32:26,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 20:32:26,837 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-19 20:32:26,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 20:32:26,837 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2022-07-19 20:32:26,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 20:32:26,838 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2022-07-19 20:32:26,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 20:32:26,840 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-19 20:32:26,840 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 20:32:26,840 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1151618438] [2022-07-19 20:32:26,840 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1151618438] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-19 20:32:26,841 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [125204033] [2022-07-19 20:32:26,841 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 20:32:26,841 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-19 20:32:26,841 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-19 20:32:26,843 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-19 20:32:26,861 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-19 20:32:26,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 20:32:26,944 INFO L263 TraceCheckSpWp]: Trace formula consists of 305 conjuncts, 9 conjunts are in the unsatisfiable core [2022-07-19 20:32:26,949 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-19 20:32:27,204 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-19 20:32:27,204 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-19 20:32:27,314 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-19 20:32:27,315 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [125204033] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-19 20:32:27,315 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-19 20:32:27,315 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 5, 4] total 10 [2022-07-19 20:32:27,315 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1489676916] [2022-07-19 20:32:27,315 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-19 20:32:27,316 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-07-19 20:32:27,316 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 20:32:27,316 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-07-19 20:32:27,317 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2022-07-19 20:32:27,317 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-19 20:32:28,910 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 20:32:28,911 INFO L93 Difference]: Finished difference Result 11493 states and 14697 transitions. [2022-07-19 20:32:28,911 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2022-07-19 20:32:28,911 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-19 20:32:28,911 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 20:32:28,934 INFO L225 Difference]: With dead ends: 11493 [2022-07-19 20:32:28,934 INFO L226 Difference]: Without dead ends: 11490 [2022-07-19 20:32:28,937 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-19 20:32:28,937 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.8s IncrementalHoareTripleChecker+Time [2022-07-19 20:32:28,937 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.8s Time] [2022-07-19 20:32:28,943 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11490 states. [2022-07-19 20:32:29,446 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11490 to 10633. [2022-07-19 20:32:29,454 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-19 20:32:29,469 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10633 states to 10633 states and 13672 transitions. [2022-07-19 20:32:29,471 INFO L78 Accepts]: Start accepts. Automaton has 10633 states and 13672 transitions. Word has length 74 [2022-07-19 20:32:29,471 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 20:32:29,471 INFO L495 AbstractCegarLoop]: Abstraction has 10633 states and 13672 transitions. [2022-07-19 20:32:29,471 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-19 20:32:29,471 INFO L276 IsEmpty]: Start isEmpty. Operand 10633 states and 13672 transitions. [2022-07-19 20:32:29,473 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2022-07-19 20:32:29,474 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 20:32:29,474 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-19 20:32:29,505 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-19 20:32:29,706 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-19 20:32:29,707 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 20:32:29,707 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 20:32:29,707 INFO L85 PathProgramCache]: Analyzing trace with hash 372887048, now seen corresponding path program 2 times [2022-07-19 20:32:29,707 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 20:32:29,707 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [322831024] [2022-07-19 20:32:29,707 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 20:32:29,708 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 20:32:29,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 20:32:29,742 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-07-19 20:32:29,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 20:32:29,749 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-07-19 20:32:29,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 20:32:29,755 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-07-19 20:32:29,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 20:32:29,758 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-19 20:32:29,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 20:32:29,759 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-19 20:32:29,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 20:32:29,760 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2022-07-19 20:32:29,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 20:32:29,761 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2022-07-19 20:32:29,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 20:32:29,762 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-19 20:32:29,762 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 20:32:29,762 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [322831024] [2022-07-19 20:32:29,762 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [322831024] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-19 20:32:29,762 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-19 20:32:29,762 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-19 20:32:29,763 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [803088709] [2022-07-19 20:32:29,763 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-19 20:32:29,763 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-19 20:32:29,763 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 20:32:29,763 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-19 20:32:29,764 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-07-19 20:32:29,764 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-19 20:32:30,370 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 20:32:30,370 INFO L93 Difference]: Finished difference Result 13642 states and 17396 transitions. [2022-07-19 20:32:30,370 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-07-19 20:32:30,371 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-19 20:32:30,371 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 20:32:30,384 INFO L225 Difference]: With dead ends: 13642 [2022-07-19 20:32:30,384 INFO L226 Difference]: Without dead ends: 6844 [2022-07-19 20:32:30,393 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-19 20:32:30,394 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-19 20:32:30,394 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-19 20:32:30,397 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6844 states. [2022-07-19 20:32:30,644 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6844 to 5818. [2022-07-19 20:32:30,649 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-19 20:32:30,660 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5818 states to 5818 states and 7719 transitions. [2022-07-19 20:32:30,662 INFO L78 Accepts]: Start accepts. Automaton has 5818 states and 7719 transitions. Word has length 77 [2022-07-19 20:32:30,662 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 20:32:30,662 INFO L495 AbstractCegarLoop]: Abstraction has 5818 states and 7719 transitions. [2022-07-19 20:32:30,662 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-19 20:32:30,663 INFO L276 IsEmpty]: Start isEmpty. Operand 5818 states and 7719 transitions. [2022-07-19 20:32:30,666 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2022-07-19 20:32:30,666 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 20:32:30,666 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-19 20:32:30,666 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2022-07-19 20:32:30,667 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 20:32:30,667 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 20:32:30,667 INFO L85 PathProgramCache]: Analyzing trace with hash -1502182211, now seen corresponding path program 1 times [2022-07-19 20:32:30,667 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 20:32:30,668 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [971167267] [2022-07-19 20:32:30,668 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 20:32:30,668 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 20:32:30,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 20:32:30,697 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-07-19 20:32:30,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 20:32:30,717 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-07-19 20:32:30,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 20:32:30,723 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-07-19 20:32:30,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 20:32:30,725 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-19 20:32:30,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 20:32:30,726 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-19 20:32:30,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 20:32:30,727 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2022-07-19 20:32:30,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 20:32:30,728 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2022-07-19 20:32:30,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 20:32:30,729 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2022-07-19 20:32:30,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 20:32:30,731 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-19 20:32:30,731 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 20:32:30,731 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [971167267] [2022-07-19 20:32:30,731 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [971167267] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-19 20:32:30,731 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-19 20:32:30,731 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-07-19 20:32:30,732 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1438465515] [2022-07-19 20:32:30,732 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-19 20:32:30,732 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-07-19 20:32:30,732 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 20:32:30,732 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-07-19 20:32:30,733 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2022-07-19 20:32:30,733 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-19 20:32:31,735 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 20:32:31,735 INFO L93 Difference]: Finished difference Result 11542 states and 14643 transitions. [2022-07-19 20:32:31,736 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2022-07-19 20:32:31,736 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-19 20:32:31,736 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 20:32:31,754 INFO L225 Difference]: With dead ends: 11542 [2022-07-19 20:32:31,754 INFO L226 Difference]: Without dead ends: 7746 [2022-07-19 20:32:31,762 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-19 20:32:31,762 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-19 20:32:31,762 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-19 20:32:31,767 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7746 states. [2022-07-19 20:32:32,189 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7746 to 7515. [2022-07-19 20:32:32,195 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-19 20:32:32,207 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7515 states to 7515 states and 9727 transitions. [2022-07-19 20:32:32,209 INFO L78 Accepts]: Start accepts. Automaton has 7515 states and 9727 transitions. Word has length 84 [2022-07-19 20:32:32,209 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 20:32:32,209 INFO L495 AbstractCegarLoop]: Abstraction has 7515 states and 9727 transitions. [2022-07-19 20:32:32,209 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-19 20:32:32,209 INFO L276 IsEmpty]: Start isEmpty. Operand 7515 states and 9727 transitions. [2022-07-19 20:32:32,213 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2022-07-19 20:32:32,213 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 20:32:32,214 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-19 20:32:32,214 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2022-07-19 20:32:32,214 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 20:32:32,214 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 20:32:32,214 INFO L85 PathProgramCache]: Analyzing trace with hash 905485990, now seen corresponding path program 1 times [2022-07-19 20:32:32,215 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 20:32:32,215 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [472770638] [2022-07-19 20:32:32,215 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 20:32:32,215 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 20:32:32,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 20:32:32,238 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-07-19 20:32:32,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 20:32:32,248 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-07-19 20:32:32,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 20:32:32,255 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-07-19 20:32:32,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 20:32:32,257 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-19 20:32:32,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 20:32:32,258 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-19 20:32:32,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 20:32:32,259 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2022-07-19 20:32:32,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 20:32:32,260 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2022-07-19 20:32:32,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 20:32:32,261 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2022-07-19 20:32:32,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 20:32:32,267 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-19 20:32:32,267 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 20:32:32,267 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [472770638] [2022-07-19 20:32:32,267 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [472770638] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-19 20:32:32,267 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-19 20:32:32,268 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-07-19 20:32:32,268 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [210579434] [2022-07-19 20:32:32,268 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-19 20:32:32,268 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-07-19 20:32:32,268 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 20:32:32,269 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-07-19 20:32:32,269 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2022-07-19 20:32:32,269 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-19 20:32:33,232 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 20:32:33,233 INFO L93 Difference]: Finished difference Result 10394 states and 13211 transitions. [2022-07-19 20:32:33,233 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2022-07-19 20:32:33,233 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-19 20:32:33,234 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 20:32:33,248 INFO L225 Difference]: With dead ends: 10394 [2022-07-19 20:32:33,248 INFO L226 Difference]: Without dead ends: 6580 [2022-07-19 20:32:33,254 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-19 20:32:33,255 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-19 20:32:33,255 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-19 20:32:33,258 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6580 states. [2022-07-19 20:32:33,581 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6580 to 6203. [2022-07-19 20:32:33,585 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-19 20:32:33,592 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6203 states to 6203 states and 8073 transitions. [2022-07-19 20:32:33,593 INFO L78 Accepts]: Start accepts. Automaton has 6203 states and 8073 transitions. Word has length 93 [2022-07-19 20:32:33,594 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 20:32:33,594 INFO L495 AbstractCegarLoop]: Abstraction has 6203 states and 8073 transitions. [2022-07-19 20:32:33,594 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-19 20:32:33,594 INFO L276 IsEmpty]: Start isEmpty. Operand 6203 states and 8073 transitions. [2022-07-19 20:32:33,598 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2022-07-19 20:32:33,598 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 20:32:33,598 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-19 20:32:33,599 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2022-07-19 20:32:33,599 INFO L420 AbstractCegarLoop]: === Iteration 23 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 20:32:33,599 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 20:32:33,599 INFO L85 PathProgramCache]: Analyzing trace with hash -33791116, now seen corresponding path program 1 times [2022-07-19 20:32:33,599 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 20:32:33,599 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [519361227] [2022-07-19 20:32:33,599 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 20:32:33,600 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 20:32:33,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 20:32:33,612 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-07-19 20:32:33,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 20:32:33,619 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-07-19 20:32:33,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 20:32:33,624 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2022-07-19 20:32:33,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 20:32:33,647 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2022-07-19 20:32:33,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 20:32:33,649 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2022-07-19 20:32:33,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 20:32:33,650 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2022-07-19 20:32:33,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 20:32:33,653 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-07-19 20:32:33,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 20:32:33,654 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2022-07-19 20:32:33,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 20:32:33,655 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-19 20:32:33,656 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 20:32:33,656 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [519361227] [2022-07-19 20:32:33,656 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [519361227] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-19 20:32:33,656 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1895662156] [2022-07-19 20:32:33,656 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 20:32:33,656 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-19 20:32:33,656 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-19 20:32:33,658 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-19 20:32:33,683 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-19 20:32:33,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 20:32:33,732 INFO L263 TraceCheckSpWp]: Trace formula consists of 414 conjuncts, 2 conjunts are in the unsatisfiable core [2022-07-19 20:32:33,734 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-19 20:32:33,747 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-19 20:32:33,747 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-19 20:32:33,747 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1895662156] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-19 20:32:33,747 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-07-19 20:32:33,747 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [7] total 8 [2022-07-19 20:32:33,747 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [564757240] [2022-07-19 20:32:33,748 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-19 20:32:33,748 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-19 20:32:33,748 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 20:32:33,748 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-19 20:32:33,748 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2022-07-19 20:32:33,748 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-19 20:32:34,048 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 20:32:34,048 INFO L93 Difference]: Finished difference Result 9369 states and 12759 transitions. [2022-07-19 20:32:34,049 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-19 20:32:34,049 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-19 20:32:34,049 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 20:32:34,062 INFO L225 Difference]: With dead ends: 9369 [2022-07-19 20:32:34,062 INFO L226 Difference]: Without dead ends: 6733 [2022-07-19 20:32:34,068 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-19 20:32:34,069 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-19 20:32:34,069 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-19 20:32:34,072 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6733 states. [2022-07-19 20:32:34,438 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6733 to 6733. [2022-07-19 20:32:34,445 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-19 20:32:34,454 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6733 states to 6733 states and 8831 transitions. [2022-07-19 20:32:34,456 INFO L78 Accepts]: Start accepts. Automaton has 6733 states and 8831 transitions. Word has length 111 [2022-07-19 20:32:34,456 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 20:32:34,456 INFO L495 AbstractCegarLoop]: Abstraction has 6733 states and 8831 transitions. [2022-07-19 20:32:34,456 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-19 20:32:34,456 INFO L276 IsEmpty]: Start isEmpty. Operand 6733 states and 8831 transitions. [2022-07-19 20:32:34,463 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 146 [2022-07-19 20:32:34,463 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 20:32:34,463 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-19 20:32:34,480 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-19 20:32:34,679 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-19 20:32:34,680 INFO L420 AbstractCegarLoop]: === Iteration 24 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 20:32:34,680 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 20:32:34,680 INFO L85 PathProgramCache]: Analyzing trace with hash -878802759, now seen corresponding path program 1 times [2022-07-19 20:32:34,680 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 20:32:34,680 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1167710967] [2022-07-19 20:32:34,680 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 20:32:34,681 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 20:32:34,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 20:32:34,711 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-07-19 20:32:34,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 20:32:34,718 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-07-19 20:32:34,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 20:32:34,724 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-07-19 20:32:34,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 20:32:34,726 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-19 20:32:34,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 20:32:34,726 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-19 20:32:34,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 20:32:34,727 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2022-07-19 20:32:34,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 20:32:34,730 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2022-07-19 20:32:34,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 20:32:34,731 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2022-07-19 20:32:34,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 20:32:34,743 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2022-07-19 20:32:34,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 20:32:34,744 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2022-07-19 20:32:34,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 20:32:34,745 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2022-07-19 20:32:34,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 20:32:34,748 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-19 20:32:34,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 20:32:34,751 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-19 20:32:34,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 20:32:34,752 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2022-07-19 20:32:34,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 20:32:34,753 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2022-07-19 20:32:34,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 20:32:34,754 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 125 [2022-07-19 20:32:34,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 20:32:34,756 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-19 20:32:34,756 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 20:32:34,756 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1167710967] [2022-07-19 20:32:34,756 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1167710967] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-19 20:32:34,756 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1576255465] [2022-07-19 20:32:34,756 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 20:32:34,756 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-19 20:32:34,757 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-19 20:32:34,758 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-19 20:32:34,759 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-19 20:32:34,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 20:32:34,833 INFO L263 TraceCheckSpWp]: Trace formula consists of 483 conjuncts, 5 conjunts are in the unsatisfiable core [2022-07-19 20:32:34,842 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-19 20:32:34,866 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-19 20:32:34,866 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-19 20:32:34,866 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1576255465] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-19 20:32:34,866 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-07-19 20:32:34,866 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [10] total 12 [2022-07-19 20:32:34,866 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1715988597] [2022-07-19 20:32:34,866 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-19 20:32:34,867 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-19 20:32:34,867 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 20:32:34,867 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-19 20:32:34,867 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=108, Unknown=0, NotChecked=0, Total=132 [2022-07-19 20:32:34,868 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-19 20:32:35,096 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 20:32:35,096 INFO L93 Difference]: Finished difference Result 8412 states and 10844 transitions. [2022-07-19 20:32:35,097 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-19 20:32:35,097 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-19 20:32:35,097 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 20:32:35,107 INFO L225 Difference]: With dead ends: 8412 [2022-07-19 20:32:35,107 INFO L226 Difference]: Without dead ends: 5175 [2022-07-19 20:32:35,112 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-19 20:32:35,112 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-19 20:32:35,112 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-19 20:32:35,115 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5175 states. [2022-07-19 20:32:35,318 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5175 to 5052. [2022-07-19 20:32:35,321 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-19 20:32:35,328 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5052 states to 5052 states and 6859 transitions. [2022-07-19 20:32:35,329 INFO L78 Accepts]: Start accepts. Automaton has 5052 states and 6859 transitions. Word has length 145 [2022-07-19 20:32:35,329 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 20:32:35,329 INFO L495 AbstractCegarLoop]: Abstraction has 5052 states and 6859 transitions. [2022-07-19 20:32:35,329 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-19 20:32:35,330 INFO L276 IsEmpty]: Start isEmpty. Operand 5052 states and 6859 transitions. [2022-07-19 20:32:35,334 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2022-07-19 20:32:35,334 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 20:32:35,334 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-19 20:32:35,351 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-19 20:32:35,549 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-19 20:32:35,549 INFO L420 AbstractCegarLoop]: === Iteration 25 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 20:32:35,549 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 20:32:35,549 INFO L85 PathProgramCache]: Analyzing trace with hash -1647944136, now seen corresponding path program 1 times [2022-07-19 20:32:35,549 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 20:32:35,549 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1615047731] [2022-07-19 20:32:35,550 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 20:32:35,550 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 20:32:35,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 20:32:35,561 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-07-19 20:32:35,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 20:32:35,568 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-07-19 20:32:35,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 20:32:35,573 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2022-07-19 20:32:35,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 20:32:35,595 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2022-07-19 20:32:35,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 20:32:35,596 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2022-07-19 20:32:35,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 20:32:35,597 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2022-07-19 20:32:35,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 20:32:35,600 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-07-19 20:32:35,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 20:32:35,601 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2022-07-19 20:32:35,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 20:32:35,604 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-07-19 20:32:35,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 20:32:35,606 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2022-07-19 20:32:35,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 20:32:35,607 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-19 20:32:35,607 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 20:32:35,607 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1615047731] [2022-07-19 20:32:35,607 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1615047731] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-19 20:32:35,607 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [349211396] [2022-07-19 20:32:35,607 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 20:32:35,607 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-19 20:32:35,608 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-19 20:32:35,609 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-19 20:32:35,610 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-19 20:32:35,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 20:32:35,684 INFO L263 TraceCheckSpWp]: Trace formula consists of 512 conjuncts, 2 conjunts are in the unsatisfiable core [2022-07-19 20:32:35,687 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-19 20:32:35,799 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-19 20:32:35,799 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-19 20:32:35,799 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [349211396] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-19 20:32:35,799 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-07-19 20:32:35,799 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [7] total 8 [2022-07-19 20:32:35,799 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1316795510] [2022-07-19 20:32:35,800 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-19 20:32:35,800 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-19 20:32:35,800 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 20:32:35,800 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-19 20:32:35,800 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2022-07-19 20:32:35,801 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-19 20:32:36,178 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 20:32:36,179 INFO L93 Difference]: Finished difference Result 11808 states and 16744 transitions. [2022-07-19 20:32:36,179 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-19 20:32:36,179 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-19 20:32:36,179 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 20:32:36,196 INFO L225 Difference]: With dead ends: 11808 [2022-07-19 20:32:36,196 INFO L226 Difference]: Without dead ends: 8335 [2022-07-19 20:32:36,203 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-19 20:32:36,205 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-19 20:32:36,205 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-19 20:32:36,209 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8335 states. [2022-07-19 20:32:36,545 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8335 to 8265. [2022-07-19 20:32:36,551 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-19 20:32:36,563 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8265 states to 8265 states and 11443 transitions. [2022-07-19 20:32:36,564 INFO L78 Accepts]: Start accepts. Automaton has 8265 states and 11443 transitions. Word has length 143 [2022-07-19 20:32:36,565 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 20:32:36,565 INFO L495 AbstractCegarLoop]: Abstraction has 8265 states and 11443 transitions. [2022-07-19 20:32:36,565 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-19 20:32:36,565 INFO L276 IsEmpty]: Start isEmpty. Operand 8265 states and 11443 transitions. [2022-07-19 20:32:36,573 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2022-07-19 20:32:36,573 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 20:32:36,573 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-19 20:32:36,592 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2022-07-19 20:32:36,789 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-19 20:32:36,790 INFO L420 AbstractCegarLoop]: === Iteration 26 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 20:32:36,790 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 20:32:36,791 INFO L85 PathProgramCache]: Analyzing trace with hash -1613614096, now seen corresponding path program 1 times [2022-07-19 20:32:36,791 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 20:32:36,791 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1279687240] [2022-07-19 20:32:36,791 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 20:32:36,791 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 20:32:36,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 20:32:36,804 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-07-19 20:32:36,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 20:32:36,831 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-07-19 20:32:36,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 20:32:36,838 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2022-07-19 20:32:36,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 20:32:36,862 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2022-07-19 20:32:36,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 20:32:36,863 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2022-07-19 20:32:36,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 20:32:36,864 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2022-07-19 20:32:36,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 20:32:36,866 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-07-19 20:32:36,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 20:32:36,868 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2022-07-19 20:32:36,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 20:32:36,870 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-07-19 20:32:36,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 20:32:36,872 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2022-07-19 20:32:36,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 20:32:36,873 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-19 20:32:36,873 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 20:32:36,874 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1279687240] [2022-07-19 20:32:36,874 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1279687240] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-19 20:32:36,874 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [737030726] [2022-07-19 20:32:36,874 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 20:32:36,874 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-19 20:32:36,874 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-19 20:32:36,875 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-19 20:32:36,876 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-19 20:32:36,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 20:32:36,992 INFO L263 TraceCheckSpWp]: Trace formula consists of 512 conjuncts, 2 conjunts are in the unsatisfiable core [2022-07-19 20:32:36,995 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-19 20:32:37,093 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-19 20:32:37,094 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-19 20:32:37,094 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [737030726] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-19 20:32:37,094 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-07-19 20:32:37,094 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [7] total 8 [2022-07-19 20:32:37,094 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1061922222] [2022-07-19 20:32:37,094 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-19 20:32:37,095 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-19 20:32:37,095 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 20:32:37,095 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-19 20:32:37,095 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2022-07-19 20:32:37,096 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-19 20:32:37,737 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 20:32:37,737 INFO L93 Difference]: Finished difference Result 15601 states and 22203 transitions. [2022-07-19 20:32:37,738 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-19 20:32:37,738 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-19 20:32:37,738 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 20:32:37,763 INFO L225 Difference]: With dead ends: 15601 [2022-07-19 20:32:37,764 INFO L226 Difference]: Without dead ends: 11391 [2022-07-19 20:32:37,777 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-19 20:32:37,778 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-19 20:32:37,778 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-19 20:32:37,784 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11391 states. [2022-07-19 20:32:38,328 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11391 to 11291. [2022-07-19 20:32:38,336 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-19 20:32:38,354 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11291 states to 11291 states and 15764 transitions. [2022-07-19 20:32:38,356 INFO L78 Accepts]: Start accepts. Automaton has 11291 states and 15764 transitions. Word has length 143 [2022-07-19 20:32:38,356 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 20:32:38,356 INFO L495 AbstractCegarLoop]: Abstraction has 11291 states and 15764 transitions. [2022-07-19 20:32:38,356 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-19 20:32:38,356 INFO L276 IsEmpty]: Start isEmpty. Operand 11291 states and 15764 transitions. [2022-07-19 20:32:38,366 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 160 [2022-07-19 20:32:38,366 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 20:32:38,366 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-19 20:32:38,384 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-19 20:32:38,583 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-19 20:32:38,584 INFO L420 AbstractCegarLoop]: === Iteration 27 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 20:32:38,584 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 20:32:38,584 INFO L85 PathProgramCache]: Analyzing trace with hash 50370099, now seen corresponding path program 1 times [2022-07-19 20:32:38,584 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 20:32:38,584 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [730050070] [2022-07-19 20:32:38,584 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 20:32:38,585 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 20:32:38,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 20:32:38,612 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-07-19 20:32:38,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 20:32:38,617 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-07-19 20:32:38,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 20:32:38,623 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-07-19 20:32:38,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 20:32:38,625 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-19 20:32:38,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 20:32:38,626 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-19 20:32:38,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 20:32:38,627 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2022-07-19 20:32:38,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 20:32:38,628 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2022-07-19 20:32:38,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 20:32:38,629 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2022-07-19 20:32:38,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 20:32:38,630 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2022-07-19 20:32:38,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 20:32:38,641 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2022-07-19 20:32:38,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 20:32:38,643 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2022-07-19 20:32:38,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 20:32:38,645 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-19 20:32:38,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 20:32:38,646 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-19 20:32:38,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 20:32:38,647 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 118 [2022-07-19 20:32:38,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 20:32:38,648 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 124 [2022-07-19 20:32:38,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 20:32:38,650 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 139 [2022-07-19 20:32:38,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 20:32:38,651 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-19 20:32:38,651 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 20:32:38,651 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [730050070] [2022-07-19 20:32:38,651 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [730050070] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-19 20:32:38,651 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-19 20:32:38,651 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-07-19 20:32:38,652 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1312883951] [2022-07-19 20:32:38,652 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-19 20:32:38,652 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-07-19 20:32:38,652 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 20:32:38,652 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-07-19 20:32:38,653 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2022-07-19 20:32:38,653 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-19 20:32:39,480 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 20:32:39,480 INFO L93 Difference]: Finished difference Result 12574 states and 17284 transitions. [2022-07-19 20:32:39,480 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-07-19 20:32:39,480 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-19 20:32:39,481 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 20:32:39,505 INFO L225 Difference]: With dead ends: 12574 [2022-07-19 20:32:39,506 INFO L226 Difference]: Without dead ends: 11184 [2022-07-19 20:32:39,513 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-19 20:32:39,514 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-19 20:32:39,514 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-19 20:32:39,521 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11184 states. [2022-07-19 20:32:39,961 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11184 to 11038. [2022-07-19 20:32:39,972 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-19 20:32:39,994 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11038 states to 11038 states and 15471 transitions. [2022-07-19 20:32:39,996 INFO L78 Accepts]: Start accepts. Automaton has 11038 states and 15471 transitions. Word has length 159 [2022-07-19 20:32:39,996 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 20:32:39,996 INFO L495 AbstractCegarLoop]: Abstraction has 11038 states and 15471 transitions. [2022-07-19 20:32:39,997 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-19 20:32:39,997 INFO L276 IsEmpty]: Start isEmpty. Operand 11038 states and 15471 transitions. [2022-07-19 20:32:40,009 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 163 [2022-07-19 20:32:40,010 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 20:32:40,010 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-19 20:32:40,010 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2022-07-19 20:32:40,010 INFO L420 AbstractCegarLoop]: === Iteration 28 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 20:32:40,010 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 20:32:40,011 INFO L85 PathProgramCache]: Analyzing trace with hash 2115413199, now seen corresponding path program 1 times [2022-07-19 20:32:40,011 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 20:32:40,011 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [992176549] [2022-07-19 20:32:40,011 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 20:32:40,011 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 20:32:40,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 20:32:40,056 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-07-19 20:32:40,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 20:32:40,066 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-07-19 20:32:40,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 20:32:40,075 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-07-19 20:32:40,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 20:32:40,080 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-19 20:32:40,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 20:32:40,081 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-19 20:32:40,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 20:32:40,082 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2022-07-19 20:32:40,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 20:32:40,084 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2022-07-19 20:32:40,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 20:32:40,085 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2022-07-19 20:32:40,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 20:32:40,086 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2022-07-19 20:32:40,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 20:32:40,092 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2022-07-19 20:32:40,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 20:32:40,095 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2022-07-19 20:32:40,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 20:32:40,102 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-19 20:32:40,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 20:32:40,104 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-19 20:32:40,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 20:32:40,106 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2022-07-19 20:32:40,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 20:32:40,107 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2022-07-19 20:32:40,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 20:32:40,108 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 142 [2022-07-19 20:32:40,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 20:32:40,110 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-19 20:32:40,110 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 20:32:40,110 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [992176549] [2022-07-19 20:32:40,110 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [992176549] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-19 20:32:40,110 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1916266626] [2022-07-19 20:32:40,111 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 20:32:40,111 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-19 20:32:40,111 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-19 20:32:40,127 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-19 20:32:40,129 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-19 20:32:40,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 20:32:40,208 INFO L263 TraceCheckSpWp]: Trace formula consists of 545 conjuncts, 12 conjunts are in the unsatisfiable core [2022-07-19 20:32:40,211 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-19 20:32:40,364 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-19 20:32:40,364 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-19 20:32:40,365 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1916266626] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-19 20:32:40,365 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-07-19 20:32:40,365 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [9] total 11 [2022-07-19 20:32:40,365 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1615313032] [2022-07-19 20:32:40,365 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-19 20:32:40,366 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-19 20:32:40,366 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 20:32:40,366 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-19 20:32:40,367 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=84, Unknown=0, NotChecked=0, Total=110 [2022-07-19 20:32:40,367 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-19 20:32:41,055 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 20:32:41,055 INFO L93 Difference]: Finished difference Result 13364 states and 18279 transitions. [2022-07-19 20:32:41,056 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-07-19 20:32:41,056 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-19 20:32:41,056 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 20:32:41,077 INFO L225 Difference]: With dead ends: 13364 [2022-07-19 20:32:41,077 INFO L226 Difference]: Without dead ends: 11954 [2022-07-19 20:32:41,082 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-19 20:32:41,083 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.2s IncrementalHoareTripleChecker+Time [2022-07-19 20:32:41,083 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.2s Time] [2022-07-19 20:32:41,089 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11954 states. [2022-07-19 20:32:41,578 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11954 to 11912. [2022-07-19 20:32:41,589 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-19 20:32:41,612 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11912 states to 11912 states and 16489 transitions. [2022-07-19 20:32:41,614 INFO L78 Accepts]: Start accepts. Automaton has 11912 states and 16489 transitions. Word has length 162 [2022-07-19 20:32:41,614 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 20:32:41,614 INFO L495 AbstractCegarLoop]: Abstraction has 11912 states and 16489 transitions. [2022-07-19 20:32:41,615 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-19 20:32:41,615 INFO L276 IsEmpty]: Start isEmpty. Operand 11912 states and 16489 transitions. [2022-07-19 20:32:41,626 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 161 [2022-07-19 20:32:41,626 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 20:32:41,626 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-19 20:32:41,643 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-19 20:32:41,839 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-19 20:32:41,840 INFO L420 AbstractCegarLoop]: === Iteration 29 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 20:32:41,840 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 20:32:41,840 INFO L85 PathProgramCache]: Analyzing trace with hash -1963717299, now seen corresponding path program 1 times [2022-07-19 20:32:41,840 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 20:32:41,841 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [547634491] [2022-07-19 20:32:41,841 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 20:32:41,841 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 20:32:41,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 20:32:41,857 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-07-19 20:32:41,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 20:32:41,864 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-07-19 20:32:41,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 20:32:41,869 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2022-07-19 20:32:41,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 20:32:41,897 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2022-07-19 20:32:41,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 20:32:41,900 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2022-07-19 20:32:41,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 20:32:41,904 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2022-07-19 20:32:41,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 20:32:41,906 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2022-07-19 20:32:41,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 20:32:41,909 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-07-19 20:32:41,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 20:32:41,911 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 115 [2022-07-19 20:32:41,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 20:32:41,915 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-07-19 20:32:41,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 20:32:41,917 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 145 [2022-07-19 20:32:41,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 20:32:41,926 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-19 20:32:41,926 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 20:32:41,926 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [547634491] [2022-07-19 20:32:41,927 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [547634491] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-19 20:32:41,927 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1844041797] [2022-07-19 20:32:41,927 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 20:32:41,927 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-19 20:32:41,927 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-19 20:32:41,944 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-19 20:32:41,945 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-19 20:32:42,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 20:32:42,027 INFO L263 TraceCheckSpWp]: Trace formula consists of 553 conjuncts, 2 conjunts are in the unsatisfiable core [2022-07-19 20:32:42,029 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-19 20:32:42,052 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-19 20:32:42,053 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-19 20:32:42,053 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1844041797] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-19 20:32:42,053 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-07-19 20:32:42,053 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [7] total 8 [2022-07-19 20:32:42,053 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1900967325] [2022-07-19 20:32:42,053 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-19 20:32:42,053 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-19 20:32:42,053 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 20:32:42,054 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-19 20:32:42,054 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2022-07-19 20:32:42,054 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-19 20:32:42,726 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 20:32:42,726 INFO L93 Difference]: Finished difference Result 21811 states and 30766 transitions. [2022-07-19 20:32:42,727 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-19 20:32:42,727 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-19 20:32:42,727 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 20:32:42,749 INFO L225 Difference]: With dead ends: 21811 [2022-07-19 20:32:42,750 INFO L226 Difference]: Without dead ends: 12814 [2022-07-19 20:32:42,762 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-19 20:32:42,762 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-19 20:32:42,763 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-19 20:32:42,768 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12814 states. [2022-07-19 20:32:43,321 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12814 to 12439. [2022-07-19 20:32:43,329 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-19 20:32:43,349 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12439 states to 12439 states and 16493 transitions. [2022-07-19 20:32:43,351 INFO L78 Accepts]: Start accepts. Automaton has 12439 states and 16493 transitions. Word has length 160 [2022-07-19 20:32:43,352 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 20:32:43,352 INFO L495 AbstractCegarLoop]: Abstraction has 12439 states and 16493 transitions. [2022-07-19 20:32:43,352 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-19 20:32:43,352 INFO L276 IsEmpty]: Start isEmpty. Operand 12439 states and 16493 transitions. [2022-07-19 20:32:43,360 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 161 [2022-07-19 20:32:43,360 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 20:32:43,360 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-19 20:32:43,377 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-19 20:32:43,574 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-19 20:32:43,574 INFO L420 AbstractCegarLoop]: === Iteration 30 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 20:32:43,575 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 20:32:43,575 INFO L85 PathProgramCache]: Analyzing trace with hash -2001388946, now seen corresponding path program 1 times [2022-07-19 20:32:43,575 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 20:32:43,575 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1232378068] [2022-07-19 20:32:43,575 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 20:32:43,575 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 20:32:43,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 20:32:43,588 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-07-19 20:32:43,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 20:32:43,595 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-07-19 20:32:43,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 20:32:43,600 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2022-07-19 20:32:43,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 20:32:43,623 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2022-07-19 20:32:43,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 20:32:43,626 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2022-07-19 20:32:43,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 20:32:43,627 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2022-07-19 20:32:43,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 20:32:43,628 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2022-07-19 20:32:43,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 20:32:43,630 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-07-19 20:32:43,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 20:32:43,632 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 115 [2022-07-19 20:32:43,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 20:32:43,634 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-07-19 20:32:43,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 20:32:43,635 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 145 [2022-07-19 20:32:43,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 20:32:43,637 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-19 20:32:43,637 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 20:32:43,637 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1232378068] [2022-07-19 20:32:43,637 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1232378068] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-19 20:32:43,637 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1428147394] [2022-07-19 20:32:43,637 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 20:32:43,637 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-19 20:32:43,637 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-19 20:32:43,639 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-19 20:32:43,640 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-19 20:32:43,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 20:32:43,722 INFO L263 TraceCheckSpWp]: Trace formula consists of 547 conjuncts, 3 conjunts are in the unsatisfiable core [2022-07-19 20:32:43,724 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-19 20:32:43,800 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-19 20:32:43,800 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-19 20:32:43,800 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1428147394] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-19 20:32:43,801 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-07-19 20:32:43,801 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [7] total 8 [2022-07-19 20:32:43,801 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [488411826] [2022-07-19 20:32:43,801 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-19 20:32:43,801 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-19 20:32:43,801 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 20:32:43,802 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-19 20:32:43,802 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2022-07-19 20:32:43,802 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-19 20:32:44,438 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 20:32:44,438 INFO L93 Difference]: Finished difference Result 21018 states and 28214 transitions. [2022-07-19 20:32:44,438 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-19 20:32:44,439 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-19 20:32:44,439 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 20:32:44,458 INFO L225 Difference]: With dead ends: 21018 [2022-07-19 20:32:44,459 INFO L226 Difference]: Without dead ends: 10780 [2022-07-19 20:32:44,474 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-19 20:32:44,475 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-19 20:32:44,475 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-19 20:32:44,480 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10780 states. [2022-07-19 20:32:45,147 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10780 to 10740. [2022-07-19 20:32:45,155 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-19 20:32:45,170 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10740 states to 10740 states and 13822 transitions. [2022-07-19 20:32:45,173 INFO L78 Accepts]: Start accepts. Automaton has 10740 states and 13822 transitions. Word has length 160 [2022-07-19 20:32:45,173 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 20:32:45,173 INFO L495 AbstractCegarLoop]: Abstraction has 10740 states and 13822 transitions. [2022-07-19 20:32:45,173 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-19 20:32:45,174 INFO L276 IsEmpty]: Start isEmpty. Operand 10740 states and 13822 transitions. [2022-07-19 20:32:45,180 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 161 [2022-07-19 20:32:45,180 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 20:32:45,180 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-19 20:32:45,197 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-19 20:32:45,398 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-19 20:32:45,398 INFO L420 AbstractCegarLoop]: === Iteration 31 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 20:32:45,398 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 20:32:45,399 INFO L85 PathProgramCache]: Analyzing trace with hash 453524583, now seen corresponding path program 1 times [2022-07-19 20:32:45,399 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 20:32:45,399 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [218653673] [2022-07-19 20:32:45,399 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 20:32:45,399 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 20:32:45,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 20:32:45,443 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-07-19 20:32:45,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 20:32:45,450 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-07-19 20:32:45,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 20:32:45,455 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2022-07-19 20:32:45,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 20:32:45,498 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2022-07-19 20:32:45,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 20:32:45,500 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2022-07-19 20:32:45,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 20:32:45,500 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2022-07-19 20:32:45,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 20:32:45,501 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2022-07-19 20:32:45,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 20:32:45,505 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-07-19 20:32:45,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 20:32:45,507 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2022-07-19 20:32:45,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 20:32:45,509 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-07-19 20:32:45,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 20:32:45,525 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 145 [2022-07-19 20:32:45,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 20:32:45,526 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-19 20:32:45,526 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 20:32:45,526 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [218653673] [2022-07-19 20:32:45,526 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [218653673] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-19 20:32:45,526 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [593235834] [2022-07-19 20:32:45,526 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 20:32:45,527 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-19 20:32:45,527 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-19 20:32:45,528 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-19 20:32:45,535 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-19 20:32:45,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 20:32:45,615 INFO L263 TraceCheckSpWp]: Trace formula consists of 544 conjuncts, 3 conjunts are in the unsatisfiable core [2022-07-19 20:32:45,618 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-19 20:32:45,631 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-19 20:32:45,631 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-19 20:32:45,631 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [593235834] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-19 20:32:45,632 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-07-19 20:32:45,632 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [7] total 8 [2022-07-19 20:32:45,632 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1787635654] [2022-07-19 20:32:45,632 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-19 20:32:45,633 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-19 20:32:45,633 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 20:32:45,633 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-19 20:32:45,633 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2022-07-19 20:32:45,633 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-19 20:32:46,157 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 20:32:46,157 INFO L93 Difference]: Finished difference Result 19185 states and 25013 transitions. [2022-07-19 20:32:46,158 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-19 20:32:46,158 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-19 20:32:46,158 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 20:32:46,177 INFO L225 Difference]: With dead ends: 19185 [2022-07-19 20:32:46,177 INFO L226 Difference]: Without dead ends: 10646 [2022-07-19 20:32:46,190 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-19 20:32:46,191 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-19 20:32:46,191 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-19 20:32:46,197 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10646 states. [2022-07-19 20:32:46,776 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10646 to 10646. [2022-07-19 20:32:46,784 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-19 20:32:46,798 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10646 states to 10646 states and 13540 transitions. [2022-07-19 20:32:46,800 INFO L78 Accepts]: Start accepts. Automaton has 10646 states and 13540 transitions. Word has length 160 [2022-07-19 20:32:46,800 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 20:32:46,800 INFO L495 AbstractCegarLoop]: Abstraction has 10646 states and 13540 transitions. [2022-07-19 20:32:46,800 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-19 20:32:46,800 INFO L276 IsEmpty]: Start isEmpty. Operand 10646 states and 13540 transitions. [2022-07-19 20:32:46,806 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 162 [2022-07-19 20:32:46,806 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 20:32:46,807 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-19 20:32:46,823 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-19 20:32:47,018 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-19 20:32:47,019 INFO L420 AbstractCegarLoop]: === Iteration 32 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 20:32:47,019 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 20:32:47,019 INFO L85 PathProgramCache]: Analyzing trace with hash 1421882321, now seen corresponding path program 1 times [2022-07-19 20:32:47,020 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 20:32:47,020 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1629004270] [2022-07-19 20:32:47,020 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 20:32:47,020 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 20:32:47,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 20:32:47,040 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-07-19 20:32:47,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 20:32:47,047 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-07-19 20:32:47,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 20:32:47,051 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2022-07-19 20:32:47,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 20:32:47,073 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2022-07-19 20:32:47,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 20:32:47,074 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2022-07-19 20:32:47,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 20:32:47,075 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2022-07-19 20:32:47,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 20:32:47,077 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-07-19 20:32:47,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 20:32:47,080 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2022-07-19 20:32:47,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 20:32:47,080 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2022-07-19 20:32:47,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 20:32:47,083 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-07-19 20:32:47,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 20:32:47,084 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 146 [2022-07-19 20:32:47,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 20:32:47,085 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-19 20:32:47,085 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 20:32:47,085 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1629004270] [2022-07-19 20:32:47,085 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1629004270] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-19 20:32:47,086 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1374755326] [2022-07-19 20:32:47,086 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 20:32:47,086 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-19 20:32:47,086 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-19 20:32:47,087 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-19 20:32:47,119 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-19 20:32:47,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 20:32:47,171 INFO L263 TraceCheckSpWp]: Trace formula consists of 545 conjuncts, 2 conjunts are in the unsatisfiable core [2022-07-19 20:32:47,173 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-19 20:32:47,190 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-19 20:32:47,190 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-19 20:32:47,191 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1374755326] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-19 20:32:47,191 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-07-19 20:32:47,191 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [7] total 8 [2022-07-19 20:32:47,191 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [471270000] [2022-07-19 20:32:47,191 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-19 20:32:47,191 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-19 20:32:47,191 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 20:32:47,192 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-19 20:32:47,192 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2022-07-19 20:32:47,192 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-19 20:32:47,992 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 20:32:47,992 INFO L93 Difference]: Finished difference Result 25956 states and 33661 transitions. [2022-07-19 20:32:47,993 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-19 20:32:47,993 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-19 20:32:47,993 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 20:32:48,032 INFO L225 Difference]: With dead ends: 25956 [2022-07-19 20:32:48,033 INFO L226 Difference]: Without dead ends: 17511 [2022-07-19 20:32:48,050 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-19 20:32:48,051 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-19 20:32:48,051 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-19 20:32:48,061 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17511 states. [2022-07-19 20:32:48,967 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17511 to 17507. [2022-07-19 20:32:48,982 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-19 20:32:49,011 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17507 states to 17507 states and 22555 transitions. [2022-07-19 20:32:49,014 INFO L78 Accepts]: Start accepts. Automaton has 17507 states and 22555 transitions. Word has length 161 [2022-07-19 20:32:49,014 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 20:32:49,014 INFO L495 AbstractCegarLoop]: Abstraction has 17507 states and 22555 transitions. [2022-07-19 20:32:49,015 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-19 20:32:49,015 INFO L276 IsEmpty]: Start isEmpty. Operand 17507 states and 22555 transitions. [2022-07-19 20:32:49,025 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 162 [2022-07-19 20:32:49,025 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 20:32:49,025 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-19 20:32:49,042 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-19 20:32:49,227 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-19 20:32:49,227 INFO L420 AbstractCegarLoop]: === Iteration 33 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 20:32:49,228 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 20:32:49,228 INFO L85 PathProgramCache]: Analyzing trace with hash -831857108, now seen corresponding path program 1 times [2022-07-19 20:32:49,228 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 20:32:49,228 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [147219996] [2022-07-19 20:32:49,228 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 20:32:49,228 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 20:32:49,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 20:32:49,267 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-07-19 20:32:49,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 20:32:49,275 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-07-19 20:32:49,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 20:32:49,280 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2022-07-19 20:32:49,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 20:32:49,304 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2022-07-19 20:32:49,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 20:32:49,306 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2022-07-19 20:32:49,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 20:32:49,307 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2022-07-19 20:32:49,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 20:32:49,308 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2022-07-19 20:32:49,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 20:32:49,314 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-07-19 20:32:49,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 20:32:49,317 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2022-07-19 20:32:49,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 20:32:49,319 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-07-19 20:32:49,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 20:32:49,321 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 146 [2022-07-19 20:32:49,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 20:32:49,322 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-19 20:32:49,323 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 20:32:49,323 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [147219996] [2022-07-19 20:32:49,323 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [147219996] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-19 20:32:49,323 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [173689152] [2022-07-19 20:32:49,323 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 20:32:49,323 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-19 20:32:49,323 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-19 20:32:49,348 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-19 20:32:49,349 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-19 20:32:49,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 20:32:49,434 INFO L263 TraceCheckSpWp]: Trace formula consists of 551 conjuncts, 3 conjunts are in the unsatisfiable core [2022-07-19 20:32:49,438 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-19 20:32:49,468 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-19 20:32:49,468 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-19 20:32:49,468 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [173689152] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-19 20:32:49,468 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-07-19 20:32:49,468 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [7] total 8 [2022-07-19 20:32:49,469 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [29891697] [2022-07-19 20:32:49,469 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-19 20:32:49,470 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-19 20:32:49,470 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 20:32:49,471 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-19 20:32:49,471 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2022-07-19 20:32:49,471 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-19 20:32:51,060 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 20:32:51,060 INFO L93 Difference]: Finished difference Result 47490 states and 62539 transitions. [2022-07-19 20:32:51,061 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-19 20:32:51,061 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-19 20:32:51,061 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 20:32:51,154 INFO L225 Difference]: With dead ends: 47490 [2022-07-19 20:32:51,154 INFO L226 Difference]: Without dead ends: 32188 [2022-07-19 20:32:51,187 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-19 20:32:51,187 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-19 20:32:51,187 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-19 20:32:51,211 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32188 states. [2022-07-19 20:32:53,138 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32188 to 32004. [2022-07-19 20:32:53,169 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-19 20:32:53,246 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32004 states to 32004 states and 42078 transitions. [2022-07-19 20:32:53,251 INFO L78 Accepts]: Start accepts. Automaton has 32004 states and 42078 transitions. Word has length 161 [2022-07-19 20:32:53,251 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 20:32:53,252 INFO L495 AbstractCegarLoop]: Abstraction has 32004 states and 42078 transitions. [2022-07-19 20:32:53,252 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-19 20:32:53,252 INFO L276 IsEmpty]: Start isEmpty. Operand 32004 states and 42078 transitions. [2022-07-19 20:32:53,278 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 162 [2022-07-19 20:32:53,278 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 20:32:53,278 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-19 20:32:53,295 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-19 20:32:53,491 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-19 20:32:53,492 INFO L420 AbstractCegarLoop]: === Iteration 34 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 20:32:53,492 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 20:32:53,492 INFO L85 PathProgramCache]: Analyzing trace with hash 60308522, now seen corresponding path program 1 times [2022-07-19 20:32:53,492 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 20:32:53,492 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1218908268] [2022-07-19 20:32:53,492 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 20:32:53,493 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 20:32:53,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 20:32:53,509 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-07-19 20:32:53,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 20:32:53,517 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-07-19 20:32:53,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 20:32:53,524 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2022-07-19 20:32:53,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 20:32:53,526 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2022-07-19 20:32:53,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 20:32:53,528 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2022-07-19 20:32:53,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 20:32:53,529 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2022-07-19 20:32:53,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 20:32:53,530 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2022-07-19 20:32:53,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 20:32:53,532 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-07-19 20:32:53,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 20:32:53,533 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2022-07-19 20:32:53,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 20:32:53,536 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-07-19 20:32:53,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 20:32:53,537 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 146 [2022-07-19 20:32:53,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 20:32:53,538 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-19 20:32:53,538 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 20:32:53,539 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1218908268] [2022-07-19 20:32:53,539 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1218908268] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-19 20:32:53,539 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-19 20:32:53,539 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-07-19 20:32:53,539 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1716343856] [2022-07-19 20:32:53,539 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-19 20:32:53,540 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-07-19 20:32:53,540 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 20:32:53,540 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-19 20:32:53,540 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-07-19 20:32:53,540 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-19 20:32:55,362 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 20:32:55,362 INFO L93 Difference]: Finished difference Result 58974 states and 77653 transitions. [2022-07-19 20:32:55,362 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-19 20:32:55,363 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-19 20:32:55,363 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 20:32:55,434 INFO L225 Difference]: With dead ends: 58974 [2022-07-19 20:32:55,434 INFO L226 Difference]: Without dead ends: 29173 [2022-07-19 20:32:55,480 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-19 20:32:55,480 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-19 20:32:55,480 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-19 20:32:55,497 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29173 states. [2022-07-19 20:32:57,073 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29173 to 26979. [2022-07-19 20:32:57,096 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-19 20:32:57,144 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26979 states to 26979 states and 35351 transitions. [2022-07-19 20:32:57,149 INFO L78 Accepts]: Start accepts. Automaton has 26979 states and 35351 transitions. Word has length 161 [2022-07-19 20:32:57,149 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 20:32:57,150 INFO L495 AbstractCegarLoop]: Abstraction has 26979 states and 35351 transitions. [2022-07-19 20:32:57,150 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-19 20:32:57,150 INFO L276 IsEmpty]: Start isEmpty. Operand 26979 states and 35351 transitions. [2022-07-19 20:32:57,166 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 164 [2022-07-19 20:32:57,166 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 20:32:57,166 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-19 20:32:57,167 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33 [2022-07-19 20:32:57,167 INFO L420 AbstractCegarLoop]: === Iteration 35 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 20:32:57,167 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 20:32:57,167 INFO L85 PathProgramCache]: Analyzing trace with hash -81101080, now seen corresponding path program 1 times [2022-07-19 20:32:57,167 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 20:32:57,167 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1773413970] [2022-07-19 20:32:57,167 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 20:32:57,168 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 20:32:57,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 20:32:57,178 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-07-19 20:32:57,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 20:32:57,185 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-07-19 20:32:57,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 20:32:57,190 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2022-07-19 20:32:57,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 20:32:57,211 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2022-07-19 20:32:57,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 20:32:57,212 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2022-07-19 20:32:57,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 20:32:57,213 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2022-07-19 20:32:57,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 20:32:57,214 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2022-07-19 20:32:57,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 20:32:57,216 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-07-19 20:32:57,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 20:32:57,217 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2022-07-19 20:32:57,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 20:32:57,219 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-07-19 20:32:57,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 20:32:57,221 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 148 [2022-07-19 20:32:57,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 20:32:57,222 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-19 20:32:57,222 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 20:32:57,222 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1773413970] [2022-07-19 20:32:57,222 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1773413970] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-19 20:32:57,222 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [236748035] [2022-07-19 20:32:57,222 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 20:32:57,222 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-19 20:32:57,223 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-19 20:32:57,224 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-19 20:32:57,241 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-19 20:32:57,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 20:32:57,336 INFO L263 TraceCheckSpWp]: Trace formula consists of 565 conjuncts, 3 conjunts are in the unsatisfiable core [2022-07-19 20:32:57,338 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-19 20:32:57,375 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-19 20:32:57,375 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-19 20:32:57,375 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [236748035] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-19 20:32:57,376 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-07-19 20:32:57,376 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [7] total 8 [2022-07-19 20:32:57,376 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [924141852] [2022-07-19 20:32:57,376 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-19 20:32:57,376 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-19 20:32:57,376 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 20:32:57,377 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-19 20:32:57,377 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2022-07-19 20:32:57,377 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-19 20:32:58,913 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 20:32:58,913 INFO L93 Difference]: Finished difference Result 44846 states and 61259 transitions. [2022-07-19 20:32:58,914 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-19 20:32:58,914 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-19 20:32:58,914 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 20:32:58,992 INFO L225 Difference]: With dead ends: 44846 [2022-07-19 20:32:58,992 INFO L226 Difference]: Without dead ends: 27045 [2022-07-19 20:32:59,027 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-19 20:32:59,027 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-19 20:32:59,028 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-19 20:32:59,048 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27045 states. [2022-07-19 20:33:00,506 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27045 to 26979. [2022-07-19 20:33:00,531 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-19 20:33:00,593 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26979 states to 26979 states and 34798 transitions. [2022-07-19 20:33:00,599 INFO L78 Accepts]: Start accepts. Automaton has 26979 states and 34798 transitions. Word has length 163 [2022-07-19 20:33:00,600 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 20:33:00,600 INFO L495 AbstractCegarLoop]: Abstraction has 26979 states and 34798 transitions. [2022-07-19 20:33:00,600 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-19 20:33:00,600 INFO L276 IsEmpty]: Start isEmpty. Operand 26979 states and 34798 transitions. [2022-07-19 20:33:00,618 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 164 [2022-07-19 20:33:00,618 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 20:33:00,618 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-19 20:33:00,648 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-19 20:33:00,850 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-19 20:33:00,851 INFO L420 AbstractCegarLoop]: === Iteration 36 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 20:33:00,851 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 20:33:00,851 INFO L85 PathProgramCache]: Analyzing trace with hash -929152312, now seen corresponding path program 1 times [2022-07-19 20:33:00,851 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 20:33:00,851 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1292165608] [2022-07-19 20:33:00,852 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 20:33:00,852 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 20:33:00,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 20:33:00,863 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-07-19 20:33:00,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 20:33:00,869 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-07-19 20:33:00,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 20:33:00,875 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2022-07-19 20:33:00,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 20:33:00,898 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2022-07-19 20:33:00,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 20:33:00,900 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2022-07-19 20:33:00,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 20:33:00,901 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2022-07-19 20:33:00,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 20:33:00,902 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2022-07-19 20:33:00,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 20:33:00,904 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-07-19 20:33:00,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 20:33:00,910 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2022-07-19 20:33:00,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 20:33:00,912 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-07-19 20:33:00,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 20:33:00,914 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 148 [2022-07-19 20:33:00,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 20:33:00,917 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-19 20:33:00,917 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 20:33:00,917 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1292165608] [2022-07-19 20:33:00,917 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1292165608] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-19 20:33:00,917 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1031186445] [2022-07-19 20:33:00,917 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 20:33:00,917 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-19 20:33:00,918 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-19 20:33:00,932 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-19 20:33:00,973 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-19 20:33:01,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 20:33:01,033 INFO L263 TraceCheckSpWp]: Trace formula consists of 571 conjuncts, 2 conjunts are in the unsatisfiable core [2022-07-19 20:33:01,036 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-19 20:33:01,091 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-19 20:33:01,091 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-19 20:33:01,091 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1031186445] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-19 20:33:01,092 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-07-19 20:33:01,092 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [7] total 8 [2022-07-19 20:33:01,092 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [643399642] [2022-07-19 20:33:01,092 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-19 20:33:01,093 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-19 20:33:01,093 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 20:33:01,093 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-19 20:33:01,093 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2022-07-19 20:33:01,093 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-19 20:33:03,054 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 20:33:03,054 INFO L93 Difference]: Finished difference Result 48806 states and 65023 transitions. [2022-07-19 20:33:03,055 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-19 20:33:03,055 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-19 20:33:03,055 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 20:33:03,138 INFO L225 Difference]: With dead ends: 48806 [2022-07-19 20:33:03,138 INFO L226 Difference]: Without dead ends: 26524 [2022-07-19 20:33:03,184 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-19 20:33:03,185 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-19 20:33:03,186 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-19 20:33:03,206 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26524 states. [2022-07-19 20:33:04,563 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26524 to 18133. [2022-07-19 20:33:04,578 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-19 20:33:04,611 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18133 states to 18133 states and 22352 transitions. [2022-07-19 20:33:04,614 INFO L78 Accepts]: Start accepts. Automaton has 18133 states and 22352 transitions. Word has length 163 [2022-07-19 20:33:04,615 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 20:33:04,615 INFO L495 AbstractCegarLoop]: Abstraction has 18133 states and 22352 transitions. [2022-07-19 20:33:04,615 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-19 20:33:04,615 INFO L276 IsEmpty]: Start isEmpty. Operand 18133 states and 22352 transitions. [2022-07-19 20:33:04,625 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 166 [2022-07-19 20:33:04,625 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 20:33:04,625 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-19 20:33:04,643 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-19 20:33:04,843 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-19 20:33:04,843 INFO L420 AbstractCegarLoop]: === Iteration 37 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 20:33:04,844 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 20:33:04,844 INFO L85 PathProgramCache]: Analyzing trace with hash 282552368, now seen corresponding path program 1 times [2022-07-19 20:33:04,844 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 20:33:04,844 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [937418629] [2022-07-19 20:33:04,844 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 20:33:04,844 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 20:33:04,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 20:33:04,855 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-07-19 20:33:04,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 20:33:04,871 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-07-19 20:33:04,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 20:33:04,878 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2022-07-19 20:33:04,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 20:33:04,900 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2022-07-19 20:33:04,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 20:33:04,903 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2022-07-19 20:33:04,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 20:33:04,904 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2022-07-19 20:33:04,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 20:33:04,905 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2022-07-19 20:33:04,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 20:33:04,907 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-07-19 20:33:04,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 20:33:04,909 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 120 [2022-07-19 20:33:04,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 20:33:04,912 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-07-19 20:33:04,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 20:33:04,914 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 150 [2022-07-19 20:33:04,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 20:33:04,915 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-19 20:33:04,915 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 20:33:04,915 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [937418629] [2022-07-19 20:33:04,915 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [937418629] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-19 20:33:04,916 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1070102462] [2022-07-19 20:33:04,916 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 20:33:04,916 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-19 20:33:04,916 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-19 20:33:04,921 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-19 20:33:04,922 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-19 20:33:05,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 20:33:05,016 INFO L263 TraceCheckSpWp]: Trace formula consists of 566 conjuncts, 6 conjunts are in the unsatisfiable core [2022-07-19 20:33:05,020 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-19 20:33:05,104 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-19 20:33:05,104 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-19 20:33:05,104 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1070102462] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-19 20:33:05,104 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-07-19 20:33:05,104 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [7] total 10 [2022-07-19 20:33:05,105 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1958504741] [2022-07-19 20:33:05,105 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-19 20:33:05,105 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-07-19 20:33:05,105 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 20:33:05,107 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-19 20:33:05,107 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2022-07-19 20:33:05,107 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-19 20:33:06,428 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 20:33:06,428 INFO L93 Difference]: Finished difference Result 34065 states and 42439 transitions. [2022-07-19 20:33:06,429 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-19 20:33:06,429 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-19 20:33:06,429 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 20:33:06,476 INFO L225 Difference]: With dead ends: 34065 [2022-07-19 20:33:06,476 INFO L226 Difference]: Without dead ends: 18133 [2022-07-19 20:33:06,504 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-19 20:33:06,505 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-19 20:33:06,505 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-19 20:33:06,518 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18133 states. [2022-07-19 20:33:07,847 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18133 to 18133. [2022-07-19 20:33:07,864 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-19 20:33:07,899 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18133 states to 18133 states and 21980 transitions. [2022-07-19 20:33:07,902 INFO L78 Accepts]: Start accepts. Automaton has 18133 states and 21980 transitions. Word has length 165 [2022-07-19 20:33:07,903 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 20:33:07,903 INFO L495 AbstractCegarLoop]: Abstraction has 18133 states and 21980 transitions. [2022-07-19 20:33:07,903 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-19 20:33:07,903 INFO L276 IsEmpty]: Start isEmpty. Operand 18133 states and 21980 transitions. [2022-07-19 20:33:07,914 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 166 [2022-07-19 20:33:07,914 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 20:33:07,914 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-19 20:33:07,932 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-19 20:33:08,127 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-19 20:33:08,128 INFO L420 AbstractCegarLoop]: === Iteration 38 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 20:33:08,128 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 20:33:08,128 INFO L85 PathProgramCache]: Analyzing trace with hash -810082834, now seen corresponding path program 1 times [2022-07-19 20:33:08,128 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 20:33:08,128 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1057942327] [2022-07-19 20:33:08,129 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 20:33:08,129 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 20:33:08,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 20:33:08,139 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-07-19 20:33:08,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 20:33:08,146 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-07-19 20:33:08,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 20:33:08,152 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2022-07-19 20:33:08,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 20:33:08,174 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2022-07-19 20:33:08,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 20:33:08,176 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2022-07-19 20:33:08,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 20:33:08,177 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2022-07-19 20:33:08,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 20:33:08,178 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2022-07-19 20:33:08,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 20:33:08,180 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-07-19 20:33:08,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 20:33:08,182 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 120 [2022-07-19 20:33:08,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 20:33:08,184 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-07-19 20:33:08,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 20:33:08,186 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 150 [2022-07-19 20:33:08,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 20:33:08,187 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-19 20:33:08,188 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 20:33:08,188 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1057942327] [2022-07-19 20:33:08,188 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1057942327] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-19 20:33:08,188 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [66975194] [2022-07-19 20:33:08,188 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 20:33:08,188 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-19 20:33:08,188 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-19 20:33:08,209 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-19 20:33:08,259 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-19 20:33:08,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 20:33:08,351 INFO L263 TraceCheckSpWp]: Trace formula consists of 563 conjuncts, 6 conjunts are in the unsatisfiable core [2022-07-19 20:33:08,353 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-19 20:33:08,416 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-19 20:33:08,416 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-19 20:33:08,416 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [66975194] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-19 20:33:08,416 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-07-19 20:33:08,417 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [7] total 10 [2022-07-19 20:33:08,417 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1022532384] [2022-07-19 20:33:08,417 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-19 20:33:08,417 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-07-19 20:33:08,417 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 20:33:08,417 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-19 20:33:08,418 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2022-07-19 20:33:08,418 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-19 20:33:09,609 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 20:33:09,609 INFO L93 Difference]: Finished difference Result 27073 states and 33157 transitions. [2022-07-19 20:33:09,610 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-19 20:33:09,610 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-19 20:33:09,610 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 20:33:09,648 INFO L225 Difference]: With dead ends: 27073 [2022-07-19 20:33:09,648 INFO L226 Difference]: Without dead ends: 15711 [2022-07-19 20:33:09,669 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-19 20:33:09,669 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-19 20:33:09,669 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-19 20:33:09,681 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15711 states. [2022-07-19 20:33:10,669 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15711 to 12330. [2022-07-19 20:33:10,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-19 20:33:10,694 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12330 states to 12330 states and 14760 transitions. [2022-07-19 20:33:10,696 INFO L78 Accepts]: Start accepts. Automaton has 12330 states and 14760 transitions. Word has length 165 [2022-07-19 20:33:10,696 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 20:33:10,697 INFO L495 AbstractCegarLoop]: Abstraction has 12330 states and 14760 transitions. [2022-07-19 20:33:10,697 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-19 20:33:10,697 INFO L276 IsEmpty]: Start isEmpty. Operand 12330 states and 14760 transitions. [2022-07-19 20:33:10,703 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 166 [2022-07-19 20:33:10,703 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 20:33:10,704 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-19 20:33:10,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-19 20:33:10,921 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-19 20:33:10,923 INFO L420 AbstractCegarLoop]: === Iteration 39 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 20:33:10,923 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 20:33:10,923 INFO L85 PathProgramCache]: Analyzing trace with hash -322035728, now seen corresponding path program 1 times [2022-07-19 20:33:10,923 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 20:33:10,923 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [210405478] [2022-07-19 20:33:10,923 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 20:33:10,924 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 20:33:10,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 20:33:10,945 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-07-19 20:33:10,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 20:33:10,952 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-07-19 20:33:10,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 20:33:10,957 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2022-07-19 20:33:10,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 20:33:10,979 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2022-07-19 20:33:10,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 20:33:10,981 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2022-07-19 20:33:10,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 20:33:10,982 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2022-07-19 20:33:10,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 20:33:10,983 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2022-07-19 20:33:10,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 20:33:10,985 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-07-19 20:33:10,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 20:33:10,986 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 120 [2022-07-19 20:33:10,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 20:33:10,989 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-07-19 20:33:10,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 20:33:10,991 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 150 [2022-07-19 20:33:10,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 20:33:10,992 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-19 20:33:10,992 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 20:33:10,992 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [210405478] [2022-07-19 20:33:10,992 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [210405478] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-19 20:33:10,992 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [421309823] [2022-07-19 20:33:10,993 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 20:33:10,993 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-19 20:33:10,993 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-19 20:33:10,994 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-19 20:33:11,039 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-19 20:33:11,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 20:33:11,120 INFO L263 TraceCheckSpWp]: Trace formula consists of 560 conjuncts, 7 conjunts are in the unsatisfiable core [2022-07-19 20:33:11,122 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-19 20:33:11,141 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-19 20:33:11,141 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-19 20:33:11,141 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [421309823] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-19 20:33:11,141 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-07-19 20:33:11,141 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [7] total 7 [2022-07-19 20:33:11,142 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1054774493] [2022-07-19 20:33:11,142 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-19 20:33:11,142 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-07-19 20:33:11,142 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 20:33:11,142 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-19 20:33:11,142 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-07-19 20:33:11,143 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-19 20:33:12,087 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 20:33:12,087 INFO L93 Difference]: Finished difference Result 22316 states and 27242 transitions. [2022-07-19 20:33:12,087 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-07-19 20:33:12,088 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-19 20:33:12,088 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 20:33:12,116 INFO L225 Difference]: With dead ends: 22316 [2022-07-19 20:33:12,116 INFO L226 Difference]: Without dead ends: 12189 [2022-07-19 20:33:12,135 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-19 20:33:12,136 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-19 20:33:12,137 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-19 20:33:12,146 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12189 states. [2022-07-19 20:33:13,186 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12189 to 11933. [2022-07-19 20:33:13,194 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-19 20:33:13,209 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11933 states to 11933 states and 14050 transitions. [2022-07-19 20:33:13,210 INFO L78 Accepts]: Start accepts. Automaton has 11933 states and 14050 transitions. Word has length 165 [2022-07-19 20:33:13,211 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 20:33:13,211 INFO L495 AbstractCegarLoop]: Abstraction has 11933 states and 14050 transitions. [2022-07-19 20:33:13,211 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-19 20:33:13,215 INFO L276 IsEmpty]: Start isEmpty. Operand 11933 states and 14050 transitions. [2022-07-19 20:33:13,220 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 166 [2022-07-19 20:33:13,221 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 20:33:13,221 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-19 20:33:13,240 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Ended with exit code 0 [2022-07-19 20:33:13,438 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-19 20:33:13,439 INFO L420 AbstractCegarLoop]: === Iteration 40 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 20:33:13,439 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 20:33:13,439 INFO L85 PathProgramCache]: Analyzing trace with hash -490424150, now seen corresponding path program 1 times [2022-07-19 20:33:13,439 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 20:33:13,439 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1887315423] [2022-07-19 20:33:13,439 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 20:33:13,440 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 20:33:13,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 20:33:13,449 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-07-19 20:33:13,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 20:33:13,456 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-07-19 20:33:13,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 20:33:13,461 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2022-07-19 20:33:13,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 20:33:13,482 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2022-07-19 20:33:13,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 20:33:13,484 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2022-07-19 20:33:13,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 20:33:13,485 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2022-07-19 20:33:13,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 20:33:13,486 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2022-07-19 20:33:13,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 20:33:13,492 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-07-19 20:33:13,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 20:33:13,494 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 120 [2022-07-19 20:33:13,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 20:33:13,496 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-07-19 20:33:13,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 20:33:13,498 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 150 [2022-07-19 20:33:13,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 20:33:13,499 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-19 20:33:13,499 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 20:33:13,500 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1887315423] [2022-07-19 20:33:13,500 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1887315423] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-19 20:33:13,500 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [51301776] [2022-07-19 20:33:13,500 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 20:33:13,500 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-19 20:33:13,500 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-19 20:33:13,501 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-19 20:33:13,503 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-19 20:33:13,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 20:33:13,582 INFO L263 TraceCheckSpWp]: Trace formula consists of 557 conjuncts, 7 conjunts are in the unsatisfiable core [2022-07-19 20:33:13,584 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-19 20:33:13,605 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-19 20:33:13,606 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-19 20:33:13,606 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [51301776] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-19 20:33:13,606 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-07-19 20:33:13,606 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [7] total 7 [2022-07-19 20:33:13,606 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2032479232] [2022-07-19 20:33:13,606 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-19 20:33:13,606 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-07-19 20:33:13,607 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 20:33:13,607 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-19 20:33:13,607 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-07-19 20:33:13,607 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-19 20:33:14,383 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 20:33:14,383 INFO L93 Difference]: Finished difference Result 18276 states and 21782 transitions. [2022-07-19 20:33:14,384 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-07-19 20:33:14,384 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-19 20:33:14,384 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 20:33:14,398 INFO L225 Difference]: With dead ends: 18276 [2022-07-19 20:33:14,399 INFO L226 Difference]: Without dead ends: 8543 [2022-07-19 20:33:14,410 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-19 20:33:14,410 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-19 20:33:14,411 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-19 20:33:14,415 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8543 states. [2022-07-19 20:33:15,069 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8543 to 8507. [2022-07-19 20:33:15,075 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-19 20:33:15,085 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8507 states to 8507 states and 9850 transitions. [2022-07-19 20:33:15,087 INFO L78 Accepts]: Start accepts. Automaton has 8507 states and 9850 transitions. Word has length 165 [2022-07-19 20:33:15,087 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 20:33:15,087 INFO L495 AbstractCegarLoop]: Abstraction has 8507 states and 9850 transitions. [2022-07-19 20:33:15,087 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-19 20:33:15,087 INFO L276 IsEmpty]: Start isEmpty. Operand 8507 states and 9850 transitions. [2022-07-19 20:33:15,091 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 201 [2022-07-19 20:33:15,091 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 20:33:15,091 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-19 20:33:15,111 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-19 20:33:15,307 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-19 20:33:15,307 INFO L420 AbstractCegarLoop]: === Iteration 41 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 20:33:15,307 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 20:33:15,307 INFO L85 PathProgramCache]: Analyzing trace with hash 994864062, now seen corresponding path program 1 times [2022-07-19 20:33:15,307 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 20:33:15,308 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [850006460] [2022-07-19 20:33:15,308 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 20:33:15,308 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 20:33:15,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 20:33:15,326 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-07-19 20:33:15,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 20:33:15,333 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-07-19 20:33:15,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 20:33:15,339 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2022-07-19 20:33:15,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 20:33:15,340 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2022-07-19 20:33:15,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 20:33:15,341 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2022-07-19 20:33:15,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 20:33:15,342 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2022-07-19 20:33:15,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 20:33:15,345 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-07-19 20:33:15,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 20:33:15,347 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2022-07-19 20:33:15,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 20:33:15,353 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 121 [2022-07-19 20:33:15,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 20:33:15,355 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-07-19 20:33:15,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 20:33:15,356 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 155 [2022-07-19 20:33:15,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 20:33:15,360 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-07-19 20:33:15,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 20:33:15,362 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 185 [2022-07-19 20:33:15,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 20:33:15,363 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-19 20:33:15,363 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 20:33:15,363 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [850006460] [2022-07-19 20:33:15,363 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [850006460] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-19 20:33:15,364 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [679573867] [2022-07-19 20:33:15,364 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 20:33:15,364 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-19 20:33:15,364 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-19 20:33:15,365 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-19 20:33:15,367 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-19 20:33:15,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 20:33:15,463 INFO L263 TraceCheckSpWp]: Trace formula consists of 643 conjuncts, 2 conjunts are in the unsatisfiable core [2022-07-19 20:33:15,466 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-19 20:33:15,481 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-19 20:33:15,481 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-19 20:33:15,481 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [679573867] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-19 20:33:15,481 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-07-19 20:33:15,481 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [7] total 8 [2022-07-19 20:33:15,482 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2127907809] [2022-07-19 20:33:15,482 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-19 20:33:15,482 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-19 20:33:15,482 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 20:33:15,482 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-19 20:33:15,482 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2022-07-19 20:33:15,483 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-19 20:33:15,843 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 20:33:15,843 INFO L93 Difference]: Finished difference Result 10600 states and 12240 transitions. [2022-07-19 20:33:15,843 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-19 20:33:15,843 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-19 20:33:15,844 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 20:33:15,851 INFO L225 Difference]: With dead ends: 10600 [2022-07-19 20:33:15,851 INFO L226 Difference]: Without dead ends: 4221 [2022-07-19 20:33:15,859 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-19 20:33:15,859 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-19 20:33:15,859 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-19 20:33:15,861 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4221 states. [2022-07-19 20:33:16,326 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4221 to 4221. [2022-07-19 20:33:16,329 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-19 20:33:16,334 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4221 states to 4221 states and 4833 transitions. [2022-07-19 20:33:16,335 INFO L78 Accepts]: Start accepts. Automaton has 4221 states and 4833 transitions. Word has length 200 [2022-07-19 20:33:16,335 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 20:33:16,335 INFO L495 AbstractCegarLoop]: Abstraction has 4221 states and 4833 transitions. [2022-07-19 20:33:16,335 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-19 20:33:16,335 INFO L276 IsEmpty]: Start isEmpty. Operand 4221 states and 4833 transitions. [2022-07-19 20:33:16,338 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 202 [2022-07-19 20:33:16,338 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 20:33:16,338 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-19 20:33:16,357 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-19 20:33:16,547 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-19 20:33:16,548 INFO L420 AbstractCegarLoop]: === Iteration 42 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 20:33:16,550 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 20:33:16,550 INFO L85 PathProgramCache]: Analyzing trace with hash 1498322473, now seen corresponding path program 1 times [2022-07-19 20:33:16,550 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 20:33:16,550 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1131722469] [2022-07-19 20:33:16,550 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 20:33:16,550 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 20:33:16,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 20:33:16,604 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-07-19 20:33:16,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 20:33:16,612 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-07-19 20:33:16,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 20:33:16,617 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2022-07-19 20:33:16,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 20:33:16,619 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2022-07-19 20:33:16,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 20:33:16,620 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2022-07-19 20:33:16,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 20:33:16,621 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2022-07-19 20:33:16,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 20:33:16,622 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2022-07-19 20:33:16,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 20:33:16,626 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-07-19 20:33:16,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 20:33:16,630 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2022-07-19 20:33:16,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 20:33:16,639 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-07-19 20:33:16,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 20:33:16,650 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 156 [2022-07-19 20:33:16,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 20:33:16,653 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-07-19 20:33:16,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 20:33:16,657 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 186 [2022-07-19 20:33:16,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 20:33:16,658 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-19 20:33:16,659 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 20:33:16,659 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1131722469] [2022-07-19 20:33:16,659 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1131722469] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-19 20:33:16,659 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1559148255] [2022-07-19 20:33:16,659 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 20:33:16,659 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-19 20:33:16,659 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-19 20:33:16,661 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-19 20:33:16,708 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-19 20:33:16,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 20:33:16,783 INFO L263 TraceCheckSpWp]: Trace formula consists of 655 conjuncts, 3 conjunts are in the unsatisfiable core [2022-07-19 20:33:16,785 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-19 20:33:16,837 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-19 20:33:16,837 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-19 20:33:16,837 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1559148255] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-19 20:33:16,837 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-07-19 20:33:16,837 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [6] total 6 [2022-07-19 20:33:16,838 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [793636786] [2022-07-19 20:33:16,838 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-19 20:33:16,838 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-19 20:33:16,838 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 20:33:16,839 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-19 20:33:16,839 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-19 20:33:16,839 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-19 20:33:17,174 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 20:33:17,175 INFO L93 Difference]: Finished difference Result 5724 states and 6542 transitions. [2022-07-19 20:33:17,175 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-19 20:33:17,175 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-19 20:33:17,175 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 20:33:17,182 INFO L225 Difference]: With dead ends: 5724 [2022-07-19 20:33:17,182 INFO L226 Difference]: Without dead ends: 4221 [2022-07-19 20:33:17,184 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-19 20:33:17,184 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-19 20:33:17,185 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-19 20:33:17,186 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4221 states. [2022-07-19 20:33:17,461 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4221 to 4221. [2022-07-19 20:33:17,464 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-19 20:33:17,468 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4221 states to 4221 states and 4815 transitions. [2022-07-19 20:33:17,469 INFO L78 Accepts]: Start accepts. Automaton has 4221 states and 4815 transitions. Word has length 201 [2022-07-19 20:33:17,469 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 20:33:17,469 INFO L495 AbstractCegarLoop]: Abstraction has 4221 states and 4815 transitions. [2022-07-19 20:33:17,470 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-19 20:33:17,470 INFO L276 IsEmpty]: Start isEmpty. Operand 4221 states and 4815 transitions. [2022-07-19 20:33:17,472 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 204 [2022-07-19 20:33:17,472 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 20:33:17,472 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-19 20:33:17,491 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-19 20:33:17,685 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-19 20:33:17,685 INFO L420 AbstractCegarLoop]: === Iteration 43 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 20:33:17,685 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 20:33:17,685 INFO L85 PathProgramCache]: Analyzing trace with hash -1332935587, now seen corresponding path program 1 times [2022-07-19 20:33:17,686 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 20:33:17,686 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [200586678] [2022-07-19 20:33:17,686 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 20:33:17,686 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 20:33:17,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 20:33:17,739 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-07-19 20:33:17,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 20:33:17,749 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-07-19 20:33:17,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 20:33:17,756 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2022-07-19 20:33:17,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 20:33:17,758 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2022-07-19 20:33:17,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 20:33:17,759 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2022-07-19 20:33:17,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 20:33:17,760 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2022-07-19 20:33:17,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 20:33:17,760 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2022-07-19 20:33:17,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 20:33:17,763 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-07-19 20:33:17,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 20:33:17,764 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2022-07-19 20:33:17,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 20:33:17,767 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-07-19 20:33:17,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 20:33:17,768 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 157 [2022-07-19 20:33:17,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 20:33:17,771 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-07-19 20:33:17,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 20:33:17,772 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 188 [2022-07-19 20:33:17,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 20:33:17,774 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-19 20:33:17,774 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 20:33:17,774 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [200586678] [2022-07-19 20:33:17,774 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [200586678] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-19 20:33:17,774 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-19 20:33:17,774 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-07-19 20:33:17,774 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [514789105] [2022-07-19 20:33:17,775 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-19 20:33:17,775 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-07-19 20:33:17,775 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 20:33:17,775 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-07-19 20:33:17,775 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-07-19 20:33:17,776 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-19 20:33:18,690 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 20:33:18,690 INFO L93 Difference]: Finished difference Result 4499 states and 5108 transitions. [2022-07-19 20:33:18,690 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-07-19 20:33:18,691 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-19 20:33:18,691 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 20:33:18,699 INFO L225 Difference]: With dead ends: 4499 [2022-07-19 20:33:18,699 INFO L226 Difference]: Without dead ends: 4456 [2022-07-19 20:33:18,701 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-19 20:33:18,701 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-19 20:33:18,702 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-19 20:33:18,704 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4456 states. [2022-07-19 20:33:19,010 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4456 to 4152. [2022-07-19 20:33:19,013 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-19 20:33:19,017 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4152 states to 4152 states and 4734 transitions. [2022-07-19 20:33:19,018 INFO L78 Accepts]: Start accepts. Automaton has 4152 states and 4734 transitions. Word has length 203 [2022-07-19 20:33:19,018 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 20:33:19,019 INFO L495 AbstractCegarLoop]: Abstraction has 4152 states and 4734 transitions. [2022-07-19 20:33:19,019 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-19 20:33:19,019 INFO L276 IsEmpty]: Start isEmpty. Operand 4152 states and 4734 transitions. [2022-07-19 20:33:19,021 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 208 [2022-07-19 20:33:19,021 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 20:33:19,021 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-19 20:33:19,022 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable42 [2022-07-19 20:33:19,022 INFO L420 AbstractCegarLoop]: === Iteration 44 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 20:33:19,022 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 20:33:19,022 INFO L85 PathProgramCache]: Analyzing trace with hash 424573701, now seen corresponding path program 1 times [2022-07-19 20:33:19,022 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 20:33:19,022 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [882292878] [2022-07-19 20:33:19,023 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 20:33:19,023 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 20:33:19,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 20:33:19,047 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-07-19 20:33:19,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 20:33:19,055 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-07-19 20:33:19,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 20:33:19,060 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2022-07-19 20:33:19,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 20:33:19,062 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2022-07-19 20:33:19,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 20:33:19,063 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2022-07-19 20:33:19,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 20:33:19,063 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2022-07-19 20:33:19,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 20:33:19,064 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2022-07-19 20:33:19,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 20:33:19,066 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-07-19 20:33:19,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 20:33:19,067 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2022-07-19 20:33:19,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 20:33:19,069 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-07-19 20:33:19,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 20:33:19,070 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 157 [2022-07-19 20:33:19,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 20:33:19,072 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-07-19 20:33:19,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 20:33:19,074 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 188 [2022-07-19 20:33:19,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 20:33:19,074 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-19 20:33:19,075 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 20:33:19,075 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [882292878] [2022-07-19 20:33:19,075 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [882292878] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-19 20:33:19,075 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-19 20:33:19,075 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-07-19 20:33:19,075 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [736626860] [2022-07-19 20:33:19,075 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-19 20:33:19,076 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-07-19 20:33:19,076 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 20:33:19,076 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-19 20:33:19,076 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-07-19 20:33:19,076 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-19 20:33:19,663 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 20:33:19,664 INFO L93 Difference]: Finished difference Result 5472 states and 6267 transitions. [2022-07-19 20:33:19,664 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-07-19 20:33:19,664 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-19 20:33:19,664 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 20:33:19,671 INFO L225 Difference]: With dead ends: 5472 [2022-07-19 20:33:19,671 INFO L226 Difference]: Without dead ends: 4531 [2022-07-19 20:33:19,672 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-19 20:33:19,673 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.3s IncrementalHoareTripleChecker+Time [2022-07-19 20:33:19,673 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.3s Time] [2022-07-19 20:33:19,675 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4531 states. [2022-07-19 20:33:19,975 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4531 to 4154. [2022-07-19 20:33:19,978 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-19 20:33:19,982 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4154 states to 4154 states and 4736 transitions. [2022-07-19 20:33:19,982 INFO L78 Accepts]: Start accepts. Automaton has 4154 states and 4736 transitions. Word has length 207 [2022-07-19 20:33:19,983 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 20:33:19,983 INFO L495 AbstractCegarLoop]: Abstraction has 4154 states and 4736 transitions. [2022-07-19 20:33:19,983 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-19 20:33:19,983 INFO L276 IsEmpty]: Start isEmpty. Operand 4154 states and 4736 transitions. [2022-07-19 20:33:19,985 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 209 [2022-07-19 20:33:19,985 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 20:33:19,985 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-19 20:33:19,985 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable43 [2022-07-19 20:33:19,986 INFO L420 AbstractCegarLoop]: === Iteration 45 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 20:33:19,986 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 20:33:19,986 INFO L85 PathProgramCache]: Analyzing trace with hash 1505939270, now seen corresponding path program 1 times [2022-07-19 20:33:19,986 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 20:33:19,986 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1882629536] [2022-07-19 20:33:19,986 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 20:33:19,987 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 20:33:19,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-19 20:33:19,996 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-19 20:33:20,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-19 20:33:20,055 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-19 20:33:20,055 INFO L271 BasicCegarLoop]: Counterexample is feasible [2022-07-19 20:33:20,056 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location error2Err0ASSERT_VIOLATIONERROR_FUNCTION (1 of 2 remaining) [2022-07-19 20:33:20,057 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location error1Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 2 remaining) [2022-07-19 20:33:20,057 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable44 [2022-07-19 20:33:20,059 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-19 20:33:20,062 INFO L176 ceAbstractionStarter]: Computing trace abstraction results [2022-07-19 20:33:20,153 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 19.07 08:33:20 BoogieIcfgContainer [2022-07-19 20:33:20,153 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-07-19 20:33:20,154 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-07-19 20:33:20,154 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-07-19 20:33:20,154 INFO L275 PluginConnector]: Witness Printer initialized [2022-07-19 20:33:20,154 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.07 08:32:11" (3/4) ... [2022-07-19 20:33:20,155 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2022-07-19 20:33:20,257 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2022-07-19 20:33:20,257 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-07-19 20:33:20,259 INFO L158 Benchmark]: Toolchain (without parser) took 70028.78ms. Allocated memory was 90.2MB in the beginning and 5.1GB in the end (delta: 5.0GB). Free memory was 55.3MB in the beginning and 2.4GB in the end (delta: -2.3GB). Peak memory consumption was 2.6GB. Max. memory is 16.1GB. [2022-07-19 20:33:20,259 INFO L158 Benchmark]: CDTParser took 0.19ms. Allocated memory is still 90.2MB. Free memory was 47.5MB in the beginning and 47.4MB in the end (delta: 76.9kB). There was no memory consumed. Max. memory is 16.1GB. [2022-07-19 20:33:20,259 INFO L158 Benchmark]: CACSL2BoogieTranslator took 297.49ms. Allocated memory is still 90.2MB. Free memory was 55.1MB in the beginning and 58.6MB in the end (delta: -3.5MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2022-07-19 20:33:20,259 INFO L158 Benchmark]: Boogie Procedure Inliner took 33.95ms. Allocated memory is still 90.2MB. Free memory was 58.6MB in the beginning and 55.7MB in the end (delta: 2.9MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2022-07-19 20:33:20,259 INFO L158 Benchmark]: Boogie Preprocessor took 51.09ms. Allocated memory is still 90.2MB. Free memory was 55.7MB in the beginning and 53.3MB in the end (delta: 2.4MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-07-19 20:33:20,260 INFO L158 Benchmark]: RCFGBuilder took 507.07ms. Allocated memory was 90.2MB in the beginning and 125.8MB in the end (delta: 35.7MB). Free memory was 53.3MB in the beginning and 91.8MB in the end (delta: -38.5MB). Peak memory consumption was 22.4MB. Max. memory is 16.1GB. [2022-07-19 20:33:20,260 INFO L158 Benchmark]: TraceAbstraction took 69031.15ms. Allocated memory was 125.8MB in the beginning and 5.1GB in the end (delta: 4.9GB). Free memory was 91.2MB in the beginning and 2.4GB in the end (delta: -2.3GB). Peak memory consumption was 2.6GB. Max. memory is 16.1GB. [2022-07-19 20:33:20,260 INFO L158 Benchmark]: Witness Printer took 103.57ms. Allocated memory is still 5.1GB. Free memory was 2.4GB in the beginning and 2.4GB in the end (delta: 26.1MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. [2022-07-19 20:33:20,265 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.19ms. Allocated memory is still 90.2MB. Free memory was 47.5MB in the beginning and 47.4MB in the end (delta: 76.9kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 297.49ms. Allocated memory is still 90.2MB. Free memory was 55.1MB in the beginning and 58.6MB in the end (delta: -3.5MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 33.95ms. Allocated memory is still 90.2MB. Free memory was 58.6MB in the beginning and 55.7MB in the end (delta: 2.9MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 51.09ms. Allocated memory is still 90.2MB. Free memory was 55.7MB in the beginning and 53.3MB in the end (delta: 2.4MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 507.07ms. Allocated memory was 90.2MB in the beginning and 125.8MB in the end (delta: 35.7MB). Free memory was 53.3MB in the beginning and 91.8MB in the end (delta: -38.5MB). Peak memory consumption was 22.4MB. Max. memory is 16.1GB. * TraceAbstraction took 69031.15ms. Allocated memory was 125.8MB in the beginning and 5.1GB in the end (delta: 4.9GB). Free memory was 91.2MB in the beginning and 2.4GB in the end (delta: -2.3GB). Peak memory consumption was 2.6GB. Max. memory is 16.1GB. * Witness Printer took 103.57ms. Allocated memory is still 5.1GB. Free memory was 2.4GB in the beginning and 2.4GB in the end (delta: 26.1MB). 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: 68.9s, OverallIterations: 45, TraceHistogramMax: 4, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.3s, AutomataDifference: 36.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 21782 SdHoareTripleChecker+Valid, 11.9s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 21286 mSDsluCounter, 40300 SdHoareTripleChecker+Invalid, 9.7s 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.2s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 4438 GetRequests, 3946 SyntacticMatches, 8 SemanticMatches, 484 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1307 ImplicationChecksByTransitivity, 3.2s 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.4s AutomataMinimizationTime, 44 MinimizatonAttempts, 21983 StatesRemovedByMinimization, 39 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.4s SsaConstructionTime, 1.1s SatisfiabilityAnalysisTime, 4.0s 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-19 20:33:20,295 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