./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/combinations/pc_sfifo_3.cil+token_ring.02.cil-2.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 839c364b 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_3.cil+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 d9dd329404607c04c3b8409033c911abc5eb1af40daa0f8673d76c8f1e85e1ae --- Real Ultimate output --- This is Ultimate 0.2.2-839c364b5d67a0f615c82cb70ab247790648d4a9-839c364 [2021-12-14 16:20:04,244 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-12-14 16:20:04,245 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-12-14 16:20:04,284 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-12-14 16:20:04,285 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-12-14 16:20:04,286 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-12-14 16:20:04,288 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-12-14 16:20:04,290 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-12-14 16:20:04,292 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-12-14 16:20:04,293 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-12-14 16:20:04,294 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-12-14 16:20:04,295 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-12-14 16:20:04,296 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-12-14 16:20:04,298 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-12-14 16:20:04,299 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-12-14 16:20:04,300 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-12-14 16:20:04,301 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-12-14 16:20:04,304 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-12-14 16:20:04,306 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-12-14 16:20:04,312 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-12-14 16:20:04,313 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-12-14 16:20:04,315 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-12-14 16:20:04,316 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-12-14 16:20:04,317 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-12-14 16:20:04,318 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-12-14 16:20:04,319 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-12-14 16:20:04,320 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-12-14 16:20:04,320 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-12-14 16:20:04,322 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-12-14 16:20:04,323 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-12-14 16:20:04,323 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-12-14 16:20:04,324 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-12-14 16:20:04,325 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-12-14 16:20:04,326 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-12-14 16:20:04,326 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-12-14 16:20:04,327 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-12-14 16:20:04,328 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-12-14 16:20:04,328 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-12-14 16:20:04,328 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-12-14 16:20:04,329 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-12-14 16:20:04,329 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-12-14 16:20:04,330 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2021-12-14 16:20:04,347 INFO L113 SettingsManager]: Loading preferences was successful [2021-12-14 16:20:04,349 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-12-14 16:20:04,350 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2021-12-14 16:20:04,350 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2021-12-14 16:20:04,351 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2021-12-14 16:20:04,351 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2021-12-14 16:20:04,352 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-12-14 16:20:04,352 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-12-14 16:20:04,352 INFO L138 SettingsManager]: * Use SBE=true [2021-12-14 16:20:04,352 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-12-14 16:20:04,353 INFO L138 SettingsManager]: * sizeof long=4 [2021-12-14 16:20:04,353 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-12-14 16:20:04,353 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-12-14 16:20:04,353 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-12-14 16:20:04,353 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-12-14 16:20:04,353 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-12-14 16:20:04,354 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-12-14 16:20:04,354 INFO L138 SettingsManager]: * sizeof long double=12 [2021-12-14 16:20:04,354 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-12-14 16:20:04,354 INFO L138 SettingsManager]: * Use constant arrays=true [2021-12-14 16:20:04,354 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-12-14 16:20:04,354 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-12-14 16:20:04,355 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-12-14 16:20:04,355 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-12-14 16:20:04,355 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-12-14 16:20:04,355 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-12-14 16:20:04,355 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-12-14 16:20:04,355 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-12-14 16:20:04,356 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-12-14 16:20:04,356 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-12-14 16:20:04,356 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2021-12-14 16:20:04,356 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2021-12-14 16:20:04,356 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2021-12-14 16:20:04,356 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-12-14 16:20:04,357 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 -> d9dd329404607c04c3b8409033c911abc5eb1af40daa0f8673d76c8f1e85e1ae [2021-12-14 16:20:04,552 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-12-14 16:20:04,567 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-12-14 16:20:04,569 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-12-14 16:20:04,570 INFO L271 PluginConnector]: Initializing CDTParser... [2021-12-14 16:20:04,570 INFO L275 PluginConnector]: CDTParser initialized [2021-12-14 16:20:04,571 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/combinations/pc_sfifo_3.cil+token_ring.02.cil-2.c [2021-12-14 16:20:04,619 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4efff1e9c/f014de1cc583414bbbb3f20fd2090ec6/FLAG5323a22f1 [2021-12-14 16:20:04,997 INFO L306 CDTParser]: Found 1 translation units. [2021-12-14 16:20:04,997 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/combinations/pc_sfifo_3.cil+token_ring.02.cil-2.c [2021-12-14 16:20:05,009 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4efff1e9c/f014de1cc583414bbbb3f20fd2090ec6/FLAG5323a22f1 [2021-12-14 16:20:05,021 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4efff1e9c/f014de1cc583414bbbb3f20fd2090ec6 [2021-12-14 16:20:05,024 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-12-14 16:20:05,025 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-12-14 16:20:05,027 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-12-14 16:20:05,027 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-12-14 16:20:05,029 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-12-14 16:20:05,030 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.12 04:20:05" (1/1) ... [2021-12-14 16:20:05,031 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5d3a4589 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 04:20:05, skipping insertion in model container [2021-12-14 16:20:05,031 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.12 04:20:05" (1/1) ... [2021-12-14 16:20:05,036 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-12-14 16:20:05,070 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-12-14 16:20:05,177 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_3.cil+token_ring.02.cil-2.c[911,924] [2021-12-14 16:20:05,228 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_3.cil+token_ring.02.cil-2.c[8416,8429] [2021-12-14 16:20:05,255 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-12-14 16:20:05,261 INFO L203 MainTranslator]: Completed pre-run [2021-12-14 16:20:05,274 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_3.cil+token_ring.02.cil-2.c[911,924] [2021-12-14 16:20:05,295 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_3.cil+token_ring.02.cil-2.c[8416,8429] [2021-12-14 16:20:05,310 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-12-14 16:20:05,326 INFO L208 MainTranslator]: Completed translation [2021-12-14 16:20:05,326 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 04:20:05 WrapperNode [2021-12-14 16:20:05,326 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-12-14 16:20:05,327 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-12-14 16:20:05,327 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-12-14 16:20:05,327 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-12-14 16:20:05,332 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 04:20:05" (1/1) ... [2021-12-14 16:20:05,351 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 04:20:05" (1/1) ... [2021-12-14 16:20:05,383 INFO L137 Inliner]: procedures = 59, calls = 68, calls flagged for inlining = 27, calls inlined = 27, statements flattened = 503 [2021-12-14 16:20:05,384 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-12-14 16:20:05,384 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-12-14 16:20:05,385 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-12-14 16:20:05,385 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-12-14 16:20:05,393 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 04:20:05" (1/1) ... [2021-12-14 16:20:05,393 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 04:20:05" (1/1) ... [2021-12-14 16:20:05,395 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 04:20:05" (1/1) ... [2021-12-14 16:20:05,395 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 04:20:05" (1/1) ... [2021-12-14 16:20:05,407 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 04:20:05" (1/1) ... [2021-12-14 16:20:05,413 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 04:20:05" (1/1) ... [2021-12-14 16:20:05,414 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 04:20:05" (1/1) ... [2021-12-14 16:20:05,424 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-12-14 16:20:05,425 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-12-14 16:20:05,425 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-12-14 16:20:05,425 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-12-14 16:20:05,432 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 04:20:05" (1/1) ... [2021-12-14 16:20:05,436 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-12-14 16:20:05,444 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-14 16:20:05,455 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) [2021-12-14 16:20:05,462 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 [2021-12-14 16:20:05,485 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2021-12-14 16:20:05,485 INFO L130 BoogieDeclarations]: Found specification of procedure immediate_notify [2021-12-14 16:20:05,485 INFO L138 BoogieDeclarations]: Found implementation of procedure immediate_notify [2021-12-14 16:20:05,485 INFO L130 BoogieDeclarations]: Found specification of procedure is_do_write_p_triggered [2021-12-14 16:20:05,489 INFO L138 BoogieDeclarations]: Found implementation of procedure is_do_write_p_triggered [2021-12-14 16:20:05,489 INFO L130 BoogieDeclarations]: Found specification of procedure exists_runnable_thread1 [2021-12-14 16:20:05,489 INFO L138 BoogieDeclarations]: Found implementation of procedure exists_runnable_thread1 [2021-12-14 16:20:05,489 INFO L130 BoogieDeclarations]: Found specification of procedure exists_runnable_thread2 [2021-12-14 16:20:05,489 INFO L138 BoogieDeclarations]: Found implementation of procedure exists_runnable_thread2 [2021-12-14 16:20:05,489 INFO L130 BoogieDeclarations]: Found specification of procedure reset_delta_events1 [2021-12-14 16:20:05,490 INFO L138 BoogieDeclarations]: Found implementation of procedure reset_delta_events1 [2021-12-14 16:20:05,490 INFO L130 BoogieDeclarations]: Found specification of procedure reset_delta_events2 [2021-12-14 16:20:05,490 INFO L138 BoogieDeclarations]: Found implementation of procedure reset_delta_events2 [2021-12-14 16:20:05,490 INFO L130 BoogieDeclarations]: Found specification of procedure activate_threads2 [2021-12-14 16:20:05,490 INFO L138 BoogieDeclarations]: Found implementation of procedure activate_threads2 [2021-12-14 16:20:05,490 INFO L130 BoogieDeclarations]: Found specification of procedure activate_threads1 [2021-12-14 16:20:05,490 INFO L138 BoogieDeclarations]: Found implementation of procedure activate_threads1 [2021-12-14 16:20:05,490 INFO L130 BoogieDeclarations]: Found specification of procedure is_do_read_c_triggered [2021-12-14 16:20:05,490 INFO L138 BoogieDeclarations]: Found implementation of procedure is_do_read_c_triggered [2021-12-14 16:20:05,491 INFO L130 BoogieDeclarations]: Found specification of procedure update_channels1 [2021-12-14 16:20:05,491 INFO L138 BoogieDeclarations]: Found implementation of procedure update_channels1 [2021-12-14 16:20:05,491 INFO L130 BoogieDeclarations]: Found specification of procedure update_channels2 [2021-12-14 16:20:05,491 INFO L138 BoogieDeclarations]: Found implementation of procedure update_channels2 [2021-12-14 16:20:05,491 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-12-14 16:20:05,491 INFO L130 BoogieDeclarations]: Found specification of procedure fire_delta_events2 [2021-12-14 16:20:05,491 INFO L138 BoogieDeclarations]: Found implementation of procedure fire_delta_events2 [2021-12-14 16:20:05,491 INFO L130 BoogieDeclarations]: Found specification of procedure fire_delta_events1 [2021-12-14 16:20:05,492 INFO L138 BoogieDeclarations]: Found implementation of procedure fire_delta_events1 [2021-12-14 16:20:05,492 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-12-14 16:20:05,492 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-12-14 16:20:05,492 INFO L130 BoogieDeclarations]: Found specification of procedure error1 [2021-12-14 16:20:05,492 INFO L138 BoogieDeclarations]: Found implementation of procedure error1 [2021-12-14 16:20:05,492 INFO L130 BoogieDeclarations]: Found specification of procedure error2 [2021-12-14 16:20:05,492 INFO L138 BoogieDeclarations]: Found implementation of procedure error2 [2021-12-14 16:20:05,578 INFO L236 CfgBuilder]: Building ICFG [2021-12-14 16:20:05,580 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2021-12-14 16:20:06,002 INFO L768 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##56: assume !(1 == ~q_free~0); [2021-12-14 16:20:06,003 INFO L768 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##55: assume 1 == ~q_free~0;~c_dr_st~0 := 2;~c_dr_pc~0 := 2;~a_t~0 := do_read_c_~a~0#1; [2021-12-14 16:20:06,035 INFO L277 CfgBuilder]: Performing block encoding [2021-12-14 16:20:06,043 INFO L296 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-12-14 16:20:06,046 INFO L301 CfgBuilder]: Removed 9 assume(true) statements. [2021-12-14 16:20:06,048 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.12 04:20:06 BoogieIcfgContainer [2021-12-14 16:20:06,049 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-12-14 16:20:06,051 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-12-14 16:20:06,052 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-12-14 16:20:06,054 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-12-14 16:20:06,055 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 14.12 04:20:05" (1/3) ... [2021-12-14 16:20:06,056 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5468168 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.12 04:20:06, skipping insertion in model container [2021-12-14 16:20:06,056 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 04:20:05" (2/3) ... [2021-12-14 16:20:06,056 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5468168 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.12 04:20:06, skipping insertion in model container [2021-12-14 16:20:06,056 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.12 04:20:06" (3/3) ... [2021-12-14 16:20:06,058 INFO L111 eAbstractionObserver]: Analyzing ICFG pc_sfifo_3.cil+token_ring.02.cil-2.c [2021-12-14 16:20:06,063 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-12-14 16:20:06,063 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2021-12-14 16:20:06,107 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2021-12-14 16:20:06,111 INFO L339 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, mLoopAccelerationTechnique=FAST_UPR [2021-12-14 16:20:06,112 INFO L340 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2021-12-14 16:20:06,132 INFO L276 IsEmpty]: Start isEmpty. Operand has 257 states, 205 states have (on average 1.5658536585365854) internal successors, (321), 213 states have internal predecessors, (321), 34 states have call successors, (34), 15 states have call predecessors, (34), 15 states have return successors, (34), 32 states have call predecessors, (34), 34 states have call successors, (34) [2021-12-14 16:20:06,149 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2021-12-14 16:20:06,151 INFO L506 BasicCegarLoop]: Found error trace [2021-12-14 16:20:06,151 INFO L514 BasicCegarLoop]: 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] [2021-12-14 16:20:06,152 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-14 16:20:06,156 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 16:20:06,156 INFO L85 PathProgramCache]: Analyzing trace with hash 1020803089, now seen corresponding path program 1 times [2021-12-14 16:20:06,162 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-14 16:20:06,163 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1675958425] [2021-12-14 16:20:06,163 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 16:20:06,164 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-14 16:20:06,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 16:20:06,367 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2021-12-14 16:20:06,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 16:20:06,395 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2021-12-14 16:20:06,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 16:20:06,432 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2021-12-14 16:20:06,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 16:20:06,459 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-14 16:20:06,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 16:20:06,465 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-12-14 16:20:06,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 16:20:06,476 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2021-12-14 16:20:06,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 16:20:06,483 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2021-12-14 16:20:06,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 16:20:06,491 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-14 16:20:06,492 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-14 16:20:06,492 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1675958425] [2021-12-14 16:20:06,493 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1675958425] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-14 16:20:06,493 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-14 16:20:06,493 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2021-12-14 16:20:06,494 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [576940108] [2021-12-14 16:20:06,495 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-14 16:20:06,499 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2021-12-14 16:20:06,499 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-14 16:20:06,519 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-12-14 16:20:06,520 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2021-12-14 16:20:06,523 INFO L87 Difference]: Start difference. First operand has 257 states, 205 states have (on average 1.5658536585365854) internal successors, (321), 213 states have internal predecessors, (321), 34 states have call successors, (34), 15 states have call predecessors, (34), 15 states have return successors, (34), 32 states have call predecessors, (34), 34 states have call successors, (34) 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) [2021-12-14 16:20:07,274 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-14 16:20:07,275 INFO L93 Difference]: Finished difference Result 646 states and 985 transitions. [2021-12-14 16:20:07,276 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2021-12-14 16:20:07,277 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 [2021-12-14 16:20:07,277 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-14 16:20:07,285 INFO L225 Difference]: With dead ends: 646 [2021-12-14 16:20:07,286 INFO L226 Difference]: Without dead ends: 397 [2021-12-14 16:20:07,289 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=79, Invalid=193, Unknown=0, NotChecked=0, Total=272 [2021-12-14 16:20:07,291 INFO L933 BasicCegarLoop]: 369 mSDtfsCounter, 678 mSDsluCounter, 914 mSDsCounter, 0 mSdLazyCounter, 635 mSolverCounterSat, 186 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 685 SdHoareTripleChecker+Valid, 1283 SdHoareTripleChecker+Invalid, 821 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 186 IncrementalHoareTripleChecker+Valid, 635 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2021-12-14 16:20:07,291 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [685 Valid, 1283 Invalid, 821 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [186 Valid, 635 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2021-12-14 16:20:07,303 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 397 states. [2021-12-14 16:20:07,344 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 397 to 358. [2021-12-14 16:20:07,346 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 358 states, 287 states have (on average 1.456445993031359) internal successors, (418), 294 states have internal predecessors, (418), 47 states have call successors, (47), 22 states have call predecessors, (47), 22 states have return successors, (48), 44 states have call predecessors, (48), 43 states have call successors, (48) [2021-12-14 16:20:07,347 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 358 states to 358 states and 513 transitions. [2021-12-14 16:20:07,348 INFO L78 Accepts]: Start accepts. Automaton has 358 states and 513 transitions. Word has length 65 [2021-12-14 16:20:07,349 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-14 16:20:07,349 INFO L470 AbstractCegarLoop]: Abstraction has 358 states and 513 transitions. [2021-12-14 16:20:07,349 INFO L471 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) [2021-12-14 16:20:07,349 INFO L276 IsEmpty]: Start isEmpty. Operand 358 states and 513 transitions. [2021-12-14 16:20:07,352 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2021-12-14 16:20:07,352 INFO L506 BasicCegarLoop]: Found error trace [2021-12-14 16:20:07,352 INFO L514 BasicCegarLoop]: 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] [2021-12-14 16:20:07,352 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-12-14 16:20:07,353 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-14 16:20:07,353 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 16:20:07,353 INFO L85 PathProgramCache]: Analyzing trace with hash -1595275567, now seen corresponding path program 1 times [2021-12-14 16:20:07,354 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-14 16:20:07,354 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1000221916] [2021-12-14 16:20:07,354 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 16:20:07,354 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-14 16:20:07,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 16:20:07,392 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2021-12-14 16:20:07,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 16:20:07,416 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2021-12-14 16:20:07,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 16:20:07,428 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2021-12-14 16:20:07,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 16:20:07,451 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-14 16:20:07,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 16:20:07,457 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-12-14 16:20:07,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 16:20:07,461 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2021-12-14 16:20:07,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 16:20:07,468 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2021-12-14 16:20:07,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 16:20:07,471 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-14 16:20:07,472 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-14 16:20:07,472 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1000221916] [2021-12-14 16:20:07,472 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1000221916] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-14 16:20:07,472 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-14 16:20:07,472 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2021-12-14 16:20:07,473 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [198602511] [2021-12-14 16:20:07,473 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-14 16:20:07,474 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2021-12-14 16:20:07,474 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-14 16:20:07,474 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-12-14 16:20:07,475 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2021-12-14 16:20:07,475 INFO L87 Difference]: Start difference. First operand 358 states and 513 transitions. Second operand has 10 states, 10 states have (on average 5.0) internal successors, (50), 7 states have internal predecessors, (50), 5 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 5 states have call successors, (7) [2021-12-14 16:20:09,019 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-14 16:20:09,020 INFO L93 Difference]: Finished difference Result 1391 states and 1973 transitions. [2021-12-14 16:20:09,020 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2021-12-14 16:20:09,021 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), 5 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 5 states have call successors, (7) Word has length 65 [2021-12-14 16:20:09,021 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-14 16:20:09,026 INFO L225 Difference]: With dead ends: 1391 [2021-12-14 16:20:09,027 INFO L226 Difference]: Without dead ends: 1170 [2021-12-14 16:20:09,028 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 337 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=257, Invalid=1075, Unknown=0, NotChecked=0, Total=1332 [2021-12-14 16:20:09,029 INFO L933 BasicCegarLoop]: 502 mSDtfsCounter, 2123 mSDsluCounter, 1502 mSDsCounter, 0 mSdLazyCounter, 1611 mSolverCounterSat, 575 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2143 SdHoareTripleChecker+Valid, 2004 SdHoareTripleChecker+Invalid, 2186 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 575 IncrementalHoareTripleChecker+Valid, 1611 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2021-12-14 16:20:09,030 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [2143 Valid, 2004 Invalid, 2186 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [575 Valid, 1611 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2021-12-14 16:20:09,031 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1170 states. [2021-12-14 16:20:09,107 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1170 to 1031. [2021-12-14 16:20:09,110 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1031 states, 830 states have (on average 1.393975903614458) internal successors, (1157), 845 states have internal predecessors, (1157), 118 states have call successors, (118), 75 states have call predecessors, (118), 81 states have return successors, (128), 112 states have call predecessors, (128), 114 states have call successors, (128) [2021-12-14 16:20:09,116 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1031 states to 1031 states and 1403 transitions. [2021-12-14 16:20:09,117 INFO L78 Accepts]: Start accepts. Automaton has 1031 states and 1403 transitions. Word has length 65 [2021-12-14 16:20:09,117 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-14 16:20:09,117 INFO L470 AbstractCegarLoop]: Abstraction has 1031 states and 1403 transitions. [2021-12-14 16:20:09,117 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 5.0) internal successors, (50), 7 states have internal predecessors, (50), 5 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 5 states have call successors, (7) [2021-12-14 16:20:09,118 INFO L276 IsEmpty]: Start isEmpty. Operand 1031 states and 1403 transitions. [2021-12-14 16:20:09,125 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2021-12-14 16:20:09,125 INFO L506 BasicCegarLoop]: Found error trace [2021-12-14 16:20:09,125 INFO L514 BasicCegarLoop]: 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] [2021-12-14 16:20:09,125 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2021-12-14 16:20:09,126 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-14 16:20:09,126 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 16:20:09,126 INFO L85 PathProgramCache]: Analyzing trace with hash -306777911, now seen corresponding path program 1 times [2021-12-14 16:20:09,126 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-14 16:20:09,127 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [219153216] [2021-12-14 16:20:09,127 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 16:20:09,128 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-14 16:20:09,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 16:20:09,172 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2021-12-14 16:20:09,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 16:20:09,180 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2021-12-14 16:20:09,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 16:20:09,189 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2021-12-14 16:20:09,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 16:20:09,221 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-14 16:20:09,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 16:20:09,245 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2021-12-14 16:20:09,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 16:20:09,249 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2021-12-14 16:20:09,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 16:20:09,253 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2021-12-14 16:20:09,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 16:20:09,267 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-14 16:20:09,268 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-14 16:20:09,268 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [219153216] [2021-12-14 16:20:09,269 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [219153216] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-14 16:20:09,269 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-14 16:20:09,269 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2021-12-14 16:20:09,270 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1018306951] [2021-12-14 16:20:09,270 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-14 16:20:09,270 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2021-12-14 16:20:09,270 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-14 16:20:09,271 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-12-14 16:20:09,271 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2021-12-14 16:20:09,271 INFO L87 Difference]: Start difference. First operand 1031 states and 1403 transitions. Second operand has 9 states, 9 states have (on average 5.666666666666667) internal successors, (51), 5 states have internal predecessors, (51), 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) [2021-12-14 16:20:09,736 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-14 16:20:09,736 INFO L93 Difference]: Finished difference Result 2057 states and 2797 transitions. [2021-12-14 16:20:09,736 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2021-12-14 16:20:09,737 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 5.666666666666667) internal successors, (51), 5 states have internal predecessors, (51), 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 66 [2021-12-14 16:20:09,737 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-14 16:20:09,741 INFO L225 Difference]: With dead ends: 2057 [2021-12-14 16:20:09,741 INFO L226 Difference]: Without dead ends: 1169 [2021-12-14 16:20:09,743 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=66, Invalid=174, Unknown=0, NotChecked=0, Total=240 [2021-12-14 16:20:09,744 INFO L933 BasicCegarLoop]: 343 mSDtfsCounter, 395 mSDsluCounter, 1236 mSDsCounter, 0 mSdLazyCounter, 673 mSolverCounterSat, 124 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 396 SdHoareTripleChecker+Valid, 1579 SdHoareTripleChecker+Invalid, 797 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 124 IncrementalHoareTripleChecker+Valid, 673 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2021-12-14 16:20:09,744 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [396 Valid, 1579 Invalid, 797 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [124 Valid, 673 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2021-12-14 16:20:09,746 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1169 states. [2021-12-14 16:20:09,780 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1169 to 1061. [2021-12-14 16:20:09,782 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1061 states, 854 states have (on average 1.379391100702576) internal successors, (1178), 869 states have internal predecessors, (1178), 118 states have call successors, (118), 75 states have call predecessors, (118), 87 states have return successors, (134), 118 states have call predecessors, (134), 114 states have call successors, (134) [2021-12-14 16:20:09,785 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1061 states to 1061 states and 1430 transitions. [2021-12-14 16:20:09,786 INFO L78 Accepts]: Start accepts. Automaton has 1061 states and 1430 transitions. Word has length 66 [2021-12-14 16:20:09,786 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-14 16:20:09,786 INFO L470 AbstractCegarLoop]: Abstraction has 1061 states and 1430 transitions. [2021-12-14 16:20:09,787 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 5.666666666666667) internal successors, (51), 5 states have internal predecessors, (51), 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) [2021-12-14 16:20:09,787 INFO L276 IsEmpty]: Start isEmpty. Operand 1061 states and 1430 transitions. [2021-12-14 16:20:09,787 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2021-12-14 16:20:09,788 INFO L506 BasicCegarLoop]: Found error trace [2021-12-14 16:20:09,788 INFO L514 BasicCegarLoop]: 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] [2021-12-14 16:20:09,788 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2021-12-14 16:20:09,788 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-14 16:20:09,788 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 16:20:09,789 INFO L85 PathProgramCache]: Analyzing trace with hash -1336137209, now seen corresponding path program 1 times [2021-12-14 16:20:09,789 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-14 16:20:09,789 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1865123211] [2021-12-14 16:20:09,789 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 16:20:09,789 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-14 16:20:09,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 16:20:09,818 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2021-12-14 16:20:09,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 16:20:09,834 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2021-12-14 16:20:09,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 16:20:09,844 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2021-12-14 16:20:09,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 16:20:09,855 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-14 16:20:09,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 16:20:09,859 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2021-12-14 16:20:09,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 16:20:09,864 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2021-12-14 16:20:09,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 16:20:09,867 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2021-12-14 16:20:09,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 16:20:09,870 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-14 16:20:09,870 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-14 16:20:09,870 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1865123211] [2021-12-14 16:20:09,871 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1865123211] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-14 16:20:09,871 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-14 16:20:09,871 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2021-12-14 16:20:09,871 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [122889847] [2021-12-14 16:20:09,871 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-14 16:20:09,871 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2021-12-14 16:20:09,872 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-14 16:20:09,872 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-12-14 16:20:09,872 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2021-12-14 16:20:09,872 INFO L87 Difference]: Start difference. First operand 1061 states and 1430 transitions. Second operand has 10 states, 10 states have (on average 5.1) internal successors, (51), 7 states have internal predecessors, (51), 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) [2021-12-14 16:20:11,220 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-14 16:20:11,220 INFO L93 Difference]: Finished difference Result 3399 states and 4617 transitions. [2021-12-14 16:20:11,220 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2021-12-14 16:20:11,221 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 5.1) internal successors, (51), 7 states have internal predecessors, (51), 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 66 [2021-12-14 16:20:11,221 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-14 16:20:11,225 INFO L225 Difference]: With dead ends: 3399 [2021-12-14 16:20:11,226 INFO L226 Difference]: Without dead ends: 1304 [2021-12-14 16:20:11,230 INFO L932 BasicCegarLoop]: 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 [2021-12-14 16:20:11,230 INFO L933 BasicCegarLoop]: 486 mSDtfsCounter, 2189 mSDsluCounter, 1541 mSDsCounter, 0 mSdLazyCounter, 1530 mSolverCounterSat, 604 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2209 SdHoareTripleChecker+Valid, 2027 SdHoareTripleChecker+Invalid, 2134 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 604 IncrementalHoareTripleChecker+Valid, 1530 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2021-12-14 16:20:11,231 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [2209 Valid, 2027 Invalid, 2134 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [604 Valid, 1530 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2021-12-14 16:20:11,232 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1304 states. [2021-12-14 16:20:11,268 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1304 to 1149. [2021-12-14 16:20:11,270 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1149 states, 907 states have (on average 1.3395810363836824) internal successors, (1215), 922 states have internal predecessors, (1215), 138 states have call successors, (138), 89 states have call predecessors, (138), 102 states have return successors, (155), 139 states have call predecessors, (155), 134 states have call successors, (155) [2021-12-14 16:20:11,273 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1149 states to 1149 states and 1508 transitions. [2021-12-14 16:20:11,274 INFO L78 Accepts]: Start accepts. Automaton has 1149 states and 1508 transitions. Word has length 66 [2021-12-14 16:20:11,275 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-14 16:20:11,275 INFO L470 AbstractCegarLoop]: Abstraction has 1149 states and 1508 transitions. [2021-12-14 16:20:11,275 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 5.1) internal successors, (51), 7 states have internal predecessors, (51), 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) [2021-12-14 16:20:11,275 INFO L276 IsEmpty]: Start isEmpty. Operand 1149 states and 1508 transitions. [2021-12-14 16:20:11,276 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2021-12-14 16:20:11,276 INFO L506 BasicCegarLoop]: Found error trace [2021-12-14 16:20:11,276 INFO L514 BasicCegarLoop]: 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] [2021-12-14 16:20:11,277 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2021-12-14 16:20:11,277 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-14 16:20:11,277 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 16:20:11,277 INFO L85 PathProgramCache]: Analyzing trace with hash -1682176981, now seen corresponding path program 1 times [2021-12-14 16:20:11,278 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-14 16:20:11,278 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1864468396] [2021-12-14 16:20:11,278 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 16:20:11,278 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-14 16:20:11,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 16:20:11,316 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2021-12-14 16:20:11,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 16:20:11,326 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2021-12-14 16:20:11,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 16:20:11,340 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2021-12-14 16:20:11,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 16:20:11,346 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2021-12-14 16:20:11,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 16:20:11,349 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2021-12-14 16:20:11,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 16:20:11,351 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-14 16:20:11,351 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-14 16:20:11,352 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1864468396] [2021-12-14 16:20:11,352 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1864468396] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-14 16:20:11,352 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-14 16:20:11,352 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-12-14 16:20:11,352 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2017728644] [2021-12-14 16:20:11,352 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-14 16:20:11,353 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-12-14 16:20:11,353 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-14 16:20:11,353 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-12-14 16:20:11,353 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-12-14 16:20:11,354 INFO L87 Difference]: Start difference. First operand 1149 states and 1508 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) [2021-12-14 16:20:11,879 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-14 16:20:11,879 INFO L93 Difference]: Finished difference Result 1459 states and 1979 transitions. [2021-12-14 16:20:11,880 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-12-14 16:20:11,880 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 [2021-12-14 16:20:11,880 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-14 16:20:11,885 INFO L225 Difference]: With dead ends: 1459 [2021-12-14 16:20:11,885 INFO L226 Difference]: Without dead ends: 1335 [2021-12-14 16:20:11,886 INFO L932 BasicCegarLoop]: 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 [2021-12-14 16:20:11,888 INFO L933 BasicCegarLoop]: 354 mSDtfsCounter, 667 mSDsluCounter, 575 mSDsCounter, 0 mSdLazyCounter, 647 mSolverCounterSat, 127 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 688 SdHoareTripleChecker+Valid, 929 SdHoareTripleChecker+Invalid, 774 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 127 IncrementalHoareTripleChecker+Valid, 647 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2021-12-14 16:20:11,888 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [688 Valid, 929 Invalid, 774 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [127 Valid, 647 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2021-12-14 16:20:11,891 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1335 states. [2021-12-14 16:20:11,941 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1335 to 1270. [2021-12-14 16:20:11,942 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1270 states, 1010 states have (on average 1.3574257425742575) internal successors, (1371), 1026 states have internal predecessors, (1371), 149 states have call successors, (149), 95 states have call predecessors, (149), 109 states have return successors, (169), 150 states have call predecessors, (169), 145 states have call successors, (169) [2021-12-14 16:20:11,946 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1270 states to 1270 states and 1689 transitions. [2021-12-14 16:20:11,946 INFO L78 Accepts]: Start accepts. Automaton has 1270 states and 1689 transitions. Word has length 69 [2021-12-14 16:20:11,946 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-14 16:20:11,946 INFO L470 AbstractCegarLoop]: Abstraction has 1270 states and 1689 transitions. [2021-12-14 16:20:11,947 INFO L471 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) [2021-12-14 16:20:11,947 INFO L276 IsEmpty]: Start isEmpty. Operand 1270 states and 1689 transitions. [2021-12-14 16:20:11,947 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2021-12-14 16:20:11,948 INFO L506 BasicCegarLoop]: Found error trace [2021-12-14 16:20:11,948 INFO L514 BasicCegarLoop]: 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] [2021-12-14 16:20:11,948 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2021-12-14 16:20:11,948 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-14 16:20:11,949 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 16:20:11,949 INFO L85 PathProgramCache]: Analyzing trace with hash -1579462617, now seen corresponding path program 1 times [2021-12-14 16:20:11,949 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-14 16:20:11,949 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [45423166] [2021-12-14 16:20:11,949 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 16:20:11,949 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-14 16:20:11,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 16:20:11,974 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2021-12-14 16:20:11,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 16:20:11,983 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2021-12-14 16:20:11,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 16:20:12,002 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2021-12-14 16:20:12,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 16:20:12,016 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2021-12-14 16:20:12,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 16:20:12,019 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2021-12-14 16:20:12,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 16:20:12,022 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-14 16:20:12,022 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-14 16:20:12,022 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [45423166] [2021-12-14 16:20:12,022 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [45423166] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-14 16:20:12,023 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-14 16:20:12,023 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-12-14 16:20:12,023 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1842921415] [2021-12-14 16:20:12,023 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-14 16:20:12,023 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2021-12-14 16:20:12,023 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-14 16:20:12,024 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-12-14 16:20:12,024 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2021-12-14 16:20:12,024 INFO L87 Difference]: Start difference. First operand 1270 states and 1689 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) [2021-12-14 16:20:12,718 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-14 16:20:12,720 INFO L93 Difference]: Finished difference Result 1732 states and 2383 transitions. [2021-12-14 16:20:12,721 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2021-12-14 16:20:12,721 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 [2021-12-14 16:20:12,721 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-14 16:20:12,726 INFO L225 Difference]: With dead ends: 1732 [2021-12-14 16:20:12,726 INFO L226 Difference]: Without dead ends: 1487 [2021-12-14 16:20:12,727 INFO L932 BasicCegarLoop]: 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 [2021-12-14 16:20:12,729 INFO L933 BasicCegarLoop]: 371 mSDtfsCounter, 684 mSDsluCounter, 763 mSDsCounter, 0 mSdLazyCounter, 960 mSolverCounterSat, 121 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 705 SdHoareTripleChecker+Valid, 1134 SdHoareTripleChecker+Invalid, 1081 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 121 IncrementalHoareTripleChecker+Valid, 960 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2021-12-14 16:20:12,730 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [705 Valid, 1134 Invalid, 1081 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [121 Valid, 960 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2021-12-14 16:20:12,733 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1487 states. [2021-12-14 16:20:12,769 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1487 to 1384. [2021-12-14 16:20:12,771 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1384 states, 1106 states have (on average 1.367992766726944) internal successors, (1513), 1123 states have internal predecessors, (1513), 160 states have call successors, (160), 101 states have call predecessors, (160), 116 states have return successors, (182), 162 states have call predecessors, (182), 156 states have call successors, (182) [2021-12-14 16:20:12,775 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1384 states to 1384 states and 1855 transitions. [2021-12-14 16:20:12,775 INFO L78 Accepts]: Start accepts. Automaton has 1384 states and 1855 transitions. Word has length 69 [2021-12-14 16:20:12,776 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-14 16:20:12,776 INFO L470 AbstractCegarLoop]: Abstraction has 1384 states and 1855 transitions. [2021-12-14 16:20:12,776 INFO L471 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) [2021-12-14 16:20:12,776 INFO L276 IsEmpty]: Start isEmpty. Operand 1384 states and 1855 transitions. [2021-12-14 16:20:12,777 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2021-12-14 16:20:12,777 INFO L506 BasicCegarLoop]: Found error trace [2021-12-14 16:20:12,777 INFO L514 BasicCegarLoop]: 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] [2021-12-14 16:20:12,777 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2021-12-14 16:20:12,778 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-14 16:20:12,778 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 16:20:12,778 INFO L85 PathProgramCache]: Analyzing trace with hash -192677207, now seen corresponding path program 1 times [2021-12-14 16:20:12,778 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-14 16:20:12,778 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1341058727] [2021-12-14 16:20:12,778 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 16:20:12,779 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-14 16:20:12,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 16:20:12,794 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2021-12-14 16:20:12,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 16:20:12,804 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2021-12-14 16:20:12,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 16:20:12,824 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2021-12-14 16:20:12,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 16:20:12,834 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2021-12-14 16:20:12,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 16:20:12,848 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2021-12-14 16:20:12,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 16:20:12,851 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-14 16:20:12,852 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-14 16:20:12,852 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1341058727] [2021-12-14 16:20:12,852 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1341058727] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-14 16:20:12,852 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-14 16:20:12,852 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-12-14 16:20:12,852 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2041597321] [2021-12-14 16:20:12,852 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-14 16:20:12,853 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2021-12-14 16:20:12,853 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-14 16:20:12,854 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-12-14 16:20:12,854 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2021-12-14 16:20:12,854 INFO L87 Difference]: Start difference. First operand 1384 states and 1855 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) [2021-12-14 16:20:13,674 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-14 16:20:13,674 INFO L93 Difference]: Finished difference Result 2206 states and 3083 transitions. [2021-12-14 16:20:13,675 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2021-12-14 16:20:13,675 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 [2021-12-14 16:20:13,675 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-14 16:20:13,682 INFO L225 Difference]: With dead ends: 2206 [2021-12-14 16:20:13,682 INFO L226 Difference]: Without dead ends: 1847 [2021-12-14 16:20:13,684 INFO L932 BasicCegarLoop]: 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 [2021-12-14 16:20:13,686 INFO L933 BasicCegarLoop]: 471 mSDtfsCounter, 681 mSDsluCounter, 955 mSDsCounter, 0 mSdLazyCounter, 1144 mSolverCounterSat, 116 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 701 SdHoareTripleChecker+Valid, 1426 SdHoareTripleChecker+Invalid, 1260 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 116 IncrementalHoareTripleChecker+Valid, 1144 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2021-12-14 16:20:13,686 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [701 Valid, 1426 Invalid, 1260 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [116 Valid, 1144 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2021-12-14 16:20:13,688 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1847 states. [2021-12-14 16:20:13,749 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1847 to 1610. [2021-12-14 16:20:13,751 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1610 states, 1298 states have (on average 1.386748844375963) internal successors, (1800), 1317 states have internal predecessors, (1800), 180 states have call successors, (180), 113 states have call predecessors, (180), 130 states have return successors, (210), 184 states have call predecessors, (210), 176 states have call successors, (210) [2021-12-14 16:20:13,755 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1610 states to 1610 states and 2190 transitions. [2021-12-14 16:20:13,756 INFO L78 Accepts]: Start accepts. Automaton has 1610 states and 2190 transitions. Word has length 69 [2021-12-14 16:20:13,756 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-14 16:20:13,756 INFO L470 AbstractCegarLoop]: Abstraction has 1610 states and 2190 transitions. [2021-12-14 16:20:13,756 INFO L471 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) [2021-12-14 16:20:13,756 INFO L276 IsEmpty]: Start isEmpty. Operand 1610 states and 2190 transitions. [2021-12-14 16:20:13,757 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2021-12-14 16:20:13,757 INFO L506 BasicCegarLoop]: Found error trace [2021-12-14 16:20:13,757 INFO L514 BasicCegarLoop]: 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] [2021-12-14 16:20:13,758 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2021-12-14 16:20:13,758 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-14 16:20:13,758 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 16:20:13,758 INFO L85 PathProgramCache]: Analyzing trace with hash 251223467, now seen corresponding path program 1 times [2021-12-14 16:20:13,758 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-14 16:20:13,758 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [938281945] [2021-12-14 16:20:13,759 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 16:20:13,759 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-14 16:20:13,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 16:20:13,775 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2021-12-14 16:20:13,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 16:20:13,785 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2021-12-14 16:20:13,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 16:20:13,807 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2021-12-14 16:20:13,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 16:20:13,812 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2021-12-14 16:20:13,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 16:20:13,817 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2021-12-14 16:20:13,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 16:20:13,820 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-14 16:20:13,820 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-14 16:20:13,820 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [938281945] [2021-12-14 16:20:13,821 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [938281945] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-14 16:20:13,821 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-14 16:20:13,821 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-12-14 16:20:13,821 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [298634123] [2021-12-14 16:20:13,821 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-14 16:20:13,821 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2021-12-14 16:20:13,822 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-14 16:20:13,822 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-12-14 16:20:13,822 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2021-12-14 16:20:13,822 INFO L87 Difference]: Start difference. First operand 1610 states and 2190 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) [2021-12-14 16:20:14,665 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-14 16:20:14,665 INFO L93 Difference]: Finished difference Result 2996 states and 4250 transitions. [2021-12-14 16:20:14,666 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2021-12-14 16:20:14,666 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 [2021-12-14 16:20:14,667 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-14 16:20:14,677 INFO L225 Difference]: With dead ends: 2996 [2021-12-14 16:20:14,678 INFO L226 Difference]: Without dead ends: 2411 [2021-12-14 16:20:14,680 INFO L932 BasicCegarLoop]: 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 [2021-12-14 16:20:14,681 INFO L933 BasicCegarLoop]: 425 mSDtfsCounter, 710 mSDsluCounter, 952 mSDsCounter, 0 mSdLazyCounter, 1005 mSolverCounterSat, 119 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 734 SdHoareTripleChecker+Valid, 1377 SdHoareTripleChecker+Invalid, 1124 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 119 IncrementalHoareTripleChecker+Valid, 1005 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2021-12-14 16:20:14,681 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [734 Valid, 1377 Invalid, 1124 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [119 Valid, 1005 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2021-12-14 16:20:14,683 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2411 states. [2021-12-14 16:20:14,762 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2411 to 2017. [2021-12-14 16:20:14,765 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2017 states, 1639 states have (on average 1.4020744356314827) internal successors, (2298), 1662 states have internal predecessors, (2298), 218 states have call successors, (218), 137 states have call predecessors, (218), 158 states have return successors, (270), 226 states have call predecessors, (270), 214 states have call successors, (270) [2021-12-14 16:20:14,776 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2017 states to 2017 states and 2786 transitions. [2021-12-14 16:20:14,776 INFO L78 Accepts]: Start accepts. Automaton has 2017 states and 2786 transitions. Word has length 69 [2021-12-14 16:20:14,777 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-14 16:20:14,777 INFO L470 AbstractCegarLoop]: Abstraction has 2017 states and 2786 transitions. [2021-12-14 16:20:14,777 INFO L471 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) [2021-12-14 16:20:14,777 INFO L276 IsEmpty]: Start isEmpty. Operand 2017 states and 2786 transitions. [2021-12-14 16:20:14,778 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2021-12-14 16:20:14,779 INFO L506 BasicCegarLoop]: Found error trace [2021-12-14 16:20:14,779 INFO L514 BasicCegarLoop]: 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] [2021-12-14 16:20:14,779 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2021-12-14 16:20:14,780 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-14 16:20:14,780 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 16:20:14,780 INFO L85 PathProgramCache]: Analyzing trace with hash 1789563497, now seen corresponding path program 1 times [2021-12-14 16:20:14,780 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-14 16:20:14,780 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1500403729] [2021-12-14 16:20:14,780 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 16:20:14,781 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-14 16:20:14,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 16:20:14,796 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2021-12-14 16:20:14,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 16:20:14,807 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2021-12-14 16:20:14,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 16:20:14,825 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2021-12-14 16:20:14,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 16:20:14,831 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2021-12-14 16:20:14,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 16:20:14,834 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2021-12-14 16:20:14,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 16:20:14,837 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-14 16:20:14,837 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-14 16:20:14,838 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1500403729] [2021-12-14 16:20:14,838 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1500403729] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-14 16:20:14,838 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-14 16:20:14,838 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-12-14 16:20:14,838 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [382770181] [2021-12-14 16:20:14,838 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-14 16:20:14,839 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2021-12-14 16:20:14,839 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-14 16:20:14,839 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-12-14 16:20:14,839 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2021-12-14 16:20:14,840 INFO L87 Difference]: Start difference. First operand 2017 states and 2786 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) [2021-12-14 16:20:15,247 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-14 16:20:15,248 INFO L93 Difference]: Finished difference Result 3240 states and 4619 transitions. [2021-12-14 16:20:15,248 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-12-14 16:20:15,248 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 [2021-12-14 16:20:15,248 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-14 16:20:15,256 INFO L225 Difference]: With dead ends: 3240 [2021-12-14 16:20:15,257 INFO L226 Difference]: Without dead ends: 2248 [2021-12-14 16:20:15,259 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=36, Invalid=74, Unknown=0, NotChecked=0, Total=110 [2021-12-14 16:20:15,297 INFO L933 BasicCegarLoop]: 305 mSDtfsCounter, 664 mSDsluCounter, 444 mSDsCounter, 0 mSdLazyCounter, 462 mSolverCounterSat, 148 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 686 SdHoareTripleChecker+Valid, 749 SdHoareTripleChecker+Invalid, 610 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 148 IncrementalHoareTripleChecker+Valid, 462 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2021-12-14 16:20:15,297 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [686 Valid, 749 Invalid, 610 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [148 Valid, 462 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2021-12-14 16:20:15,299 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2248 states. [2021-12-14 16:20:15,369 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2248 to 2017. [2021-12-14 16:20:15,371 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2017 states, 1639 states have (on average 1.3965832824893227) internal successors, (2289), 1662 states have internal predecessors, (2289), 218 states have call successors, (218), 137 states have call predecessors, (218), 158 states have return successors, (270), 226 states have call predecessors, (270), 214 states have call successors, (270) [2021-12-14 16:20:15,377 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2017 states to 2017 states and 2777 transitions. [2021-12-14 16:20:15,377 INFO L78 Accepts]: Start accepts. Automaton has 2017 states and 2777 transitions. Word has length 69 [2021-12-14 16:20:15,377 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-14 16:20:15,377 INFO L470 AbstractCegarLoop]: Abstraction has 2017 states and 2777 transitions. [2021-12-14 16:20:15,378 INFO L471 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) [2021-12-14 16:20:15,378 INFO L276 IsEmpty]: Start isEmpty. Operand 2017 states and 2777 transitions. [2021-12-14 16:20:15,379 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2021-12-14 16:20:15,379 INFO L506 BasicCegarLoop]: Found error trace [2021-12-14 16:20:15,379 INFO L514 BasicCegarLoop]: 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] [2021-12-14 16:20:15,379 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2021-12-14 16:20:15,380 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-14 16:20:15,380 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 16:20:15,380 INFO L85 PathProgramCache]: Analyzing trace with hash -239022613, now seen corresponding path program 1 times [2021-12-14 16:20:15,380 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-14 16:20:15,380 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [78997160] [2021-12-14 16:20:15,380 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 16:20:15,381 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-14 16:20:15,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 16:20:15,392 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2021-12-14 16:20:15,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 16:20:15,398 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2021-12-14 16:20:15,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 16:20:15,403 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2021-12-14 16:20:15,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 16:20:15,430 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2021-12-14 16:20:15,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 16:20:15,433 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2021-12-14 16:20:15,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 16:20:15,437 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-14 16:20:15,437 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-14 16:20:15,438 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [78997160] [2021-12-14 16:20:15,438 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [78997160] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-14 16:20:15,438 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-14 16:20:15,438 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-12-14 16:20:15,438 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [85405137] [2021-12-14 16:20:15,438 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-14 16:20:15,438 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2021-12-14 16:20:15,439 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-14 16:20:15,439 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-12-14 16:20:15,439 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2021-12-14 16:20:15,439 INFO L87 Difference]: Start difference. First operand 2017 states and 2777 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) [2021-12-14 16:20:16,031 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-14 16:20:16,031 INFO L93 Difference]: Finished difference Result 3552 states and 5054 transitions. [2021-12-14 16:20:16,032 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2021-12-14 16:20:16,032 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 [2021-12-14 16:20:16,032 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-14 16:20:16,040 INFO L225 Difference]: With dead ends: 3552 [2021-12-14 16:20:16,040 INFO L226 Difference]: Without dead ends: 2561 [2021-12-14 16:20:16,043 INFO L932 BasicCegarLoop]: 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 [2021-12-14 16:20:16,044 INFO L933 BasicCegarLoop]: 330 mSDtfsCounter, 376 mSDsluCounter, 957 mSDsCounter, 0 mSdLazyCounter, 673 mSolverCounterSat, 81 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 376 SdHoareTripleChecker+Valid, 1287 SdHoareTripleChecker+Invalid, 754 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 81 IncrementalHoareTripleChecker+Valid, 673 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2021-12-14 16:20:16,044 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [376 Valid, 1287 Invalid, 754 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [81 Valid, 673 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2021-12-14 16:20:16,046 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2561 states. [2021-12-14 16:20:16,114 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2561 to 2044. [2021-12-14 16:20:16,117 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2044 states, 1666 states have (on average 1.39015606242497) internal successors, (2316), 1689 states have internal predecessors, (2316), 218 states have call successors, (218), 137 states have call predecessors, (218), 158 states have return successors, (270), 226 states have call predecessors, (270), 214 states have call successors, (270) [2021-12-14 16:20:16,122 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2044 states to 2044 states and 2804 transitions. [2021-12-14 16:20:16,122 INFO L78 Accepts]: Start accepts. Automaton has 2044 states and 2804 transitions. Word has length 69 [2021-12-14 16:20:16,123 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-14 16:20:16,123 INFO L470 AbstractCegarLoop]: Abstraction has 2044 states and 2804 transitions. [2021-12-14 16:20:16,123 INFO L471 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) [2021-12-14 16:20:16,123 INFO L276 IsEmpty]: Start isEmpty. Operand 2044 states and 2804 transitions. [2021-12-14 16:20:16,125 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2021-12-14 16:20:16,126 INFO L506 BasicCegarLoop]: Found error trace [2021-12-14 16:20:16,126 INFO L514 BasicCegarLoop]: 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] [2021-12-14 16:20:16,126 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2021-12-14 16:20:16,126 INFO L402 AbstractCegarLoop]: === Iteration 11 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-14 16:20:16,127 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 16:20:16,127 INFO L85 PathProgramCache]: Analyzing trace with hash 9123881, now seen corresponding path program 1 times [2021-12-14 16:20:16,127 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-14 16:20:16,127 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [255594406] [2021-12-14 16:20:16,127 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 16:20:16,127 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-14 16:20:16,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 16:20:16,157 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2021-12-14 16:20:16,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 16:20:16,165 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2021-12-14 16:20:16,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 16:20:16,173 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2021-12-14 16:20:16,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 16:20:16,235 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2021-12-14 16:20:16,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 16:20:16,238 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2021-12-14 16:20:16,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 16:20:16,239 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-14 16:20:16,239 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-14 16:20:16,239 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [255594406] [2021-12-14 16:20:16,240 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [255594406] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-14 16:20:16,240 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-14 16:20:16,240 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-12-14 16:20:16,240 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1644229890] [2021-12-14 16:20:16,240 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-14 16:20:16,240 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2021-12-14 16:20:16,240 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-14 16:20:16,240 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-12-14 16:20:16,240 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2021-12-14 16:20:16,241 INFO L87 Difference]: Start difference. First operand 2044 states and 2804 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) [2021-12-14 16:20:17,294 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-14 16:20:17,294 INFO L93 Difference]: Finished difference Result 5508 states and 8002 transitions. [2021-12-14 16:20:17,294 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2021-12-14 16:20:17,295 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 [2021-12-14 16:20:17,295 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-14 16:20:17,312 INFO L225 Difference]: With dead ends: 5508 [2021-12-14 16:20:17,313 INFO L226 Difference]: Without dead ends: 4490 [2021-12-14 16:20:17,318 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 52 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=87, Invalid=219, Unknown=0, NotChecked=0, Total=306 [2021-12-14 16:20:17,318 INFO L933 BasicCegarLoop]: 497 mSDtfsCounter, 1309 mSDsluCounter, 742 mSDsCounter, 0 mSdLazyCounter, 981 mSolverCounterSat, 342 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1330 SdHoareTripleChecker+Valid, 1239 SdHoareTripleChecker+Invalid, 1323 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 342 IncrementalHoareTripleChecker+Valid, 981 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2021-12-14 16:20:17,319 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1330 Valid, 1239 Invalid, 1323 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [342 Valid, 981 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2021-12-14 16:20:17,322 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4490 states. [2021-12-14 16:20:17,498 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4490 to 3921. [2021-12-14 16:20:17,504 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3921 states, 3231 states have (on average 1.4051377282575055) internal successors, (4540), 3285 states have internal predecessors, (4540), 402 states have call successors, (402), 249 states have call predecessors, (402), 286 states have return successors, (569), 395 states have call predecessors, (569), 398 states have call successors, (569) [2021-12-14 16:20:17,512 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3921 states to 3921 states and 5511 transitions. [2021-12-14 16:20:17,513 INFO L78 Accepts]: Start accepts. Automaton has 3921 states and 5511 transitions. Word has length 69 [2021-12-14 16:20:17,513 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-14 16:20:17,513 INFO L470 AbstractCegarLoop]: Abstraction has 3921 states and 5511 transitions. [2021-12-14 16:20:17,513 INFO L471 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) [2021-12-14 16:20:17,513 INFO L276 IsEmpty]: Start isEmpty. Operand 3921 states and 5511 transitions. [2021-12-14 16:20:17,517 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2021-12-14 16:20:17,517 INFO L506 BasicCegarLoop]: Found error trace [2021-12-14 16:20:17,517 INFO L514 BasicCegarLoop]: trace histogram [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] [2021-12-14 16:20:17,517 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2021-12-14 16:20:17,518 INFO L402 AbstractCegarLoop]: === Iteration 12 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-14 16:20:17,518 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 16:20:17,518 INFO L85 PathProgramCache]: Analyzing trace with hash -411543486, now seen corresponding path program 1 times [2021-12-14 16:20:17,518 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-14 16:20:17,518 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1343558043] [2021-12-14 16:20:17,518 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 16:20:17,519 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-14 16:20:17,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 16:20:17,540 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2021-12-14 16:20:17,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 16:20:17,545 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2021-12-14 16:20:17,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 16:20:17,551 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2021-12-14 16:20:17,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 16:20:17,570 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-14 16:20:17,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 16:20:17,572 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2021-12-14 16:20:17,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 16:20:17,594 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2021-12-14 16:20:17,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 16:20:17,597 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2021-12-14 16:20:17,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 16:20:17,599 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2021-12-14 16:20:17,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 16:20:17,601 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2021-12-14 16:20:17,601 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-14 16:20:17,602 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1343558043] [2021-12-14 16:20:17,602 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1343558043] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-14 16:20:17,602 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-14 16:20:17,602 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2021-12-14 16:20:17,602 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [569876840] [2021-12-14 16:20:17,602 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-14 16:20:17,603 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2021-12-14 16:20:17,603 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-14 16:20:17,603 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-12-14 16:20:17,603 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2021-12-14 16:20:17,603 INFO L87 Difference]: Start difference. First operand 3921 states and 5511 transitions. Second operand has 9 states, 9 states have (on average 6.888888888888889) internal successors, (62), 5 states have internal predecessors, (62), 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) [2021-12-14 16:20:18,148 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-14 16:20:18,148 INFO L93 Difference]: Finished difference Result 5098 states and 7062 transitions. [2021-12-14 16:20:18,148 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2021-12-14 16:20:18,149 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 6.888888888888889) internal successors, (62), 5 states have internal predecessors, (62), 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 91 [2021-12-14 16:20:18,149 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-14 16:20:18,163 INFO L225 Difference]: With dead ends: 5098 [2021-12-14 16:20:18,163 INFO L226 Difference]: Without dead ends: 4092 [2021-12-14 16:20:18,166 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=72, Invalid=200, Unknown=0, NotChecked=0, Total=272 [2021-12-14 16:20:18,167 INFO L933 BasicCegarLoop]: 329 mSDtfsCounter, 258 mSDsluCounter, 1336 mSDsCounter, 0 mSdLazyCounter, 702 mSolverCounterSat, 85 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 260 SdHoareTripleChecker+Valid, 1665 SdHoareTripleChecker+Invalid, 787 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 85 IncrementalHoareTripleChecker+Valid, 702 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2021-12-14 16:20:18,167 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [260 Valid, 1665 Invalid, 787 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [85 Valid, 702 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2021-12-14 16:20:18,170 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4092 states. [2021-12-14 16:20:18,321 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4092 to 3961. [2021-12-14 16:20:18,335 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3961 states, 3263 states have (on average 1.4002451731535397) internal successors, (4569), 3317 states have internal predecessors, (4569), 402 states have call successors, (402), 249 states have call predecessors, (402), 294 states have return successors, (577), 403 states have call predecessors, (577), 398 states have call successors, (577) [2021-12-14 16:20:18,343 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3961 states to 3961 states and 5548 transitions. [2021-12-14 16:20:18,343 INFO L78 Accepts]: Start accepts. Automaton has 3961 states and 5548 transitions. Word has length 91 [2021-12-14 16:20:18,343 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-14 16:20:18,344 INFO L470 AbstractCegarLoop]: Abstraction has 3961 states and 5548 transitions. [2021-12-14 16:20:18,344 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 6.888888888888889) internal successors, (62), 5 states have internal predecessors, (62), 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) [2021-12-14 16:20:18,344 INFO L276 IsEmpty]: Start isEmpty. Operand 3961 states and 5548 transitions. [2021-12-14 16:20:18,346 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2021-12-14 16:20:18,347 INFO L506 BasicCegarLoop]: Found error trace [2021-12-14 16:20:18,347 INFO L514 BasicCegarLoop]: trace histogram [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] [2021-12-14 16:20:18,347 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2021-12-14 16:20:18,347 INFO L402 AbstractCegarLoop]: === Iteration 13 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-14 16:20:18,347 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 16:20:18,348 INFO L85 PathProgramCache]: Analyzing trace with hash 32357188, now seen corresponding path program 1 times [2021-12-14 16:20:18,348 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-14 16:20:18,348 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [67392037] [2021-12-14 16:20:18,348 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 16:20:18,348 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-14 16:20:18,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 16:20:18,375 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2021-12-14 16:20:18,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 16:20:18,382 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2021-12-14 16:20:18,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 16:20:18,391 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2021-12-14 16:20:18,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 16:20:18,399 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-14 16:20:18,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 16:20:18,401 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2021-12-14 16:20:18,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 16:20:18,403 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2021-12-14 16:20:18,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 16:20:18,418 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2021-12-14 16:20:18,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 16:20:18,421 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2021-12-14 16:20:18,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 16:20:18,423 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2021-12-14 16:20:18,423 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-14 16:20:18,423 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [67392037] [2021-12-14 16:20:18,424 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [67392037] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-14 16:20:18,424 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-14 16:20:18,424 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2021-12-14 16:20:18,424 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [366734786] [2021-12-14 16:20:18,424 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-14 16:20:18,424 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2021-12-14 16:20:18,424 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-14 16:20:18,425 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-12-14 16:20:18,425 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2021-12-14 16:20:18,425 INFO L87 Difference]: Start difference. First operand 3961 states and 5548 transitions. Second operand has 8 states, 8 states have (on average 7.75) internal successors, (62), 6 states have internal predecessors, (62), 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) [2021-12-14 16:20:19,150 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-14 16:20:19,150 INFO L93 Difference]: Finished difference Result 5999 states and 8153 transitions. [2021-12-14 16:20:19,151 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2021-12-14 16:20:19,151 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 7.75) internal successors, (62), 6 states have internal predecessors, (62), 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 91 [2021-12-14 16:20:19,151 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-14 16:20:19,166 INFO L225 Difference]: With dead ends: 5999 [2021-12-14 16:20:19,166 INFO L226 Difference]: Without dead ends: 4954 [2021-12-14 16:20:19,169 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 67 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=103, Invalid=277, Unknown=0, NotChecked=0, Total=380 [2021-12-14 16:20:19,170 INFO L933 BasicCegarLoop]: 371 mSDtfsCounter, 688 mSDsluCounter, 963 mSDsCounter, 0 mSdLazyCounter, 843 mSolverCounterSat, 143 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 711 SdHoareTripleChecker+Valid, 1334 SdHoareTripleChecker+Invalid, 986 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 143 IncrementalHoareTripleChecker+Valid, 843 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2021-12-14 16:20:19,170 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [711 Valid, 1334 Invalid, 986 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [143 Valid, 843 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2021-12-14 16:20:19,174 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4954 states. [2021-12-14 16:20:19,355 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4954 to 4638. [2021-12-14 16:20:19,361 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4638 states, 3792 states have (on average 1.3800105485232068) internal successors, (5233), 3859 states have internal predecessors, (5233), 478 states have call successors, (478), 302 states have call predecessors, (478), 366 states have return successors, (690), 486 states have call predecessors, (690), 474 states have call successors, (690) [2021-12-14 16:20:19,371 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4638 states to 4638 states and 6401 transitions. [2021-12-14 16:20:19,372 INFO L78 Accepts]: Start accepts. Automaton has 4638 states and 6401 transitions. Word has length 91 [2021-12-14 16:20:19,372 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-14 16:20:19,372 INFO L470 AbstractCegarLoop]: Abstraction has 4638 states and 6401 transitions. [2021-12-14 16:20:19,373 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 7.75) internal successors, (62), 6 states have internal predecessors, (62), 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) [2021-12-14 16:20:19,373 INFO L276 IsEmpty]: Start isEmpty. Operand 4638 states and 6401 transitions. [2021-12-14 16:20:19,375 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2021-12-14 16:20:19,376 INFO L506 BasicCegarLoop]: Found error trace [2021-12-14 16:20:19,376 INFO L514 BasicCegarLoop]: trace histogram [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] [2021-12-14 16:20:19,376 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2021-12-14 16:20:19,376 INFO L402 AbstractCegarLoop]: === Iteration 14 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-14 16:20:19,376 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 16:20:19,377 INFO L85 PathProgramCache]: Analyzing trace with hash 1971519234, now seen corresponding path program 1 times [2021-12-14 16:20:19,377 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-14 16:20:19,377 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [885231987] [2021-12-14 16:20:19,377 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 16:20:19,377 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-14 16:20:19,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 16:20:19,404 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2021-12-14 16:20:19,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 16:20:19,411 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2021-12-14 16:20:19,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 16:20:19,416 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2021-12-14 16:20:19,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 16:20:19,426 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-14 16:20:19,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 16:20:19,428 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2021-12-14 16:20:19,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 16:20:19,432 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2021-12-14 16:20:19,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 16:20:19,434 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2021-12-14 16:20:19,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 16:20:19,436 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2021-12-14 16:20:19,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 16:20:19,438 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2021-12-14 16:20:19,438 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-14 16:20:19,438 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [885231987] [2021-12-14 16:20:19,438 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [885231987] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-14 16:20:19,439 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-14 16:20:19,439 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-12-14 16:20:19,439 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [372474593] [2021-12-14 16:20:19,439 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-14 16:20:19,439 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2021-12-14 16:20:19,439 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-14 16:20:19,440 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-12-14 16:20:19,440 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2021-12-14 16:20:19,440 INFO L87 Difference]: Start difference. First operand 4638 states and 6401 transitions. Second operand has 7 states, 7 states have (on average 10.0) internal successors, (70), 4 states have internal predecessors, (70), 4 states have call successors, (9), 5 states have call predecessors, (9), 2 states have return successors, (8), 4 states have call predecessors, (8), 4 states have call successors, (8) [2021-12-14 16:20:19,907 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-14 16:20:19,908 INFO L93 Difference]: Finished difference Result 8297 states and 11183 transitions. [2021-12-14 16:20:19,911 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2021-12-14 16:20:19,911 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 10.0) internal successors, (70), 4 states have internal predecessors, (70), 4 states have call successors, (9), 5 states have call predecessors, (9), 2 states have return successors, (8), 4 states have call predecessors, (8), 4 states have call successors, (8) Word has length 91 [2021-12-14 16:20:19,911 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-14 16:20:19,929 INFO L225 Difference]: With dead ends: 8297 [2021-12-14 16:20:19,929 INFO L226 Difference]: Without dead ends: 6577 [2021-12-14 16:20:19,934 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 27 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=71, Invalid=139, Unknown=0, NotChecked=0, Total=210 [2021-12-14 16:20:19,935 INFO L933 BasicCegarLoop]: 344 mSDtfsCounter, 910 mSDsluCounter, 385 mSDsCounter, 0 mSdLazyCounter, 274 mSolverCounterSat, 243 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 934 SdHoareTripleChecker+Valid, 729 SdHoareTripleChecker+Invalid, 517 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 243 IncrementalHoareTripleChecker+Valid, 274 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2021-12-14 16:20:19,935 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [934 Valid, 729 Invalid, 517 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [243 Valid, 274 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2021-12-14 16:20:19,940 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6577 states. [2021-12-14 16:20:20,165 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6577 to 6357. [2021-12-14 16:20:20,172 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6357 states, 5130 states have (on average 1.3442495126705654) internal successors, (6896), 5233 states have internal predecessors, (6896), 671 states have call successors, (671), 436 states have call predecessors, (671), 554 states have return successors, (1030), 699 states have call predecessors, (1030), 667 states have call successors, (1030) [2021-12-14 16:20:20,185 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6357 states to 6357 states and 8597 transitions. [2021-12-14 16:20:20,186 INFO L78 Accepts]: Start accepts. Automaton has 6357 states and 8597 transitions. Word has length 91 [2021-12-14 16:20:20,187 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-14 16:20:20,187 INFO L470 AbstractCegarLoop]: Abstraction has 6357 states and 8597 transitions. [2021-12-14 16:20:20,187 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 10.0) internal successors, (70), 4 states have internal predecessors, (70), 4 states have call successors, (9), 5 states have call predecessors, (9), 2 states have return successors, (8), 4 states have call predecessors, (8), 4 states have call successors, (8) [2021-12-14 16:20:20,187 INFO L276 IsEmpty]: Start isEmpty. Operand 6357 states and 8597 transitions. [2021-12-14 16:20:20,190 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2021-12-14 16:20:20,191 INFO L506 BasicCegarLoop]: Found error trace [2021-12-14 16:20:20,191 INFO L514 BasicCegarLoop]: trace histogram [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] [2021-12-14 16:20:20,191 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2021-12-14 16:20:20,191 INFO L402 AbstractCegarLoop]: === Iteration 15 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-14 16:20:20,191 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 16:20:20,191 INFO L85 PathProgramCache]: Analyzing trace with hash 913681156, now seen corresponding path program 1 times [2021-12-14 16:20:20,192 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-14 16:20:20,192 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [630954916] [2021-12-14 16:20:20,192 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 16:20:20,192 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-14 16:20:20,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 16:20:20,210 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2021-12-14 16:20:20,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 16:20:20,215 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2021-12-14 16:20:20,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 16:20:20,220 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2021-12-14 16:20:20,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 16:20:20,223 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-14 16:20:20,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 16:20:20,225 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2021-12-14 16:20:20,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 16:20:20,229 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2021-12-14 16:20:20,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 16:20:20,230 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2021-12-14 16:20:20,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 16:20:20,232 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2021-12-14 16:20:20,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 16:20:20,234 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2021-12-14 16:20:20,234 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-14 16:20:20,234 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [630954916] [2021-12-14 16:20:20,235 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [630954916] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-14 16:20:20,235 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-14 16:20:20,235 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-12-14 16:20:20,235 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [939498939] [2021-12-14 16:20:20,235 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-14 16:20:20,235 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-12-14 16:20:20,235 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-14 16:20:20,236 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-12-14 16:20:20,236 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2021-12-14 16:20:20,236 INFO L87 Difference]: Start difference. First operand 6357 states and 8597 transitions. Second operand has 6 states, 6 states have (on average 10.333333333333334) internal successors, (62), 3 states have internal predecessors, (62), 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) [2021-12-14 16:20:20,594 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-14 16:20:20,595 INFO L93 Difference]: Finished difference Result 8195 states and 10900 transitions. [2021-12-14 16:20:20,595 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-12-14 16:20:20,595 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), 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 91 [2021-12-14 16:20:20,596 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-14 16:20:20,606 INFO L225 Difference]: With dead ends: 8195 [2021-12-14 16:20:20,607 INFO L226 Difference]: Without dead ends: 4756 [2021-12-14 16:20:20,613 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2021-12-14 16:20:20,614 INFO L933 BasicCegarLoop]: 328 mSDtfsCounter, 376 mSDsluCounter, 575 mSDsCounter, 0 mSdLazyCounter, 236 mSolverCounterSat, 91 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 392 SdHoareTripleChecker+Valid, 903 SdHoareTripleChecker+Invalid, 327 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 91 IncrementalHoareTripleChecker+Valid, 236 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2021-12-14 16:20:20,614 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [392 Valid, 903 Invalid, 327 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [91 Valid, 236 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2021-12-14 16:20:20,618 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4756 states. [2021-12-14 16:20:20,834 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4756 to 4638. [2021-12-14 16:20:20,840 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4638 states, 3792 states have (on average 1.3686708860759493) internal successors, (5190), 3859 states have internal predecessors, (5190), 478 states have call successors, (478), 302 states have call predecessors, (478), 366 states have return successors, (690), 486 states have call predecessors, (690), 474 states have call successors, (690) [2021-12-14 16:20:20,851 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4638 states to 4638 states and 6358 transitions. [2021-12-14 16:20:20,853 INFO L78 Accepts]: Start accepts. Automaton has 4638 states and 6358 transitions. Word has length 91 [2021-12-14 16:20:20,853 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-14 16:20:20,853 INFO L470 AbstractCegarLoop]: Abstraction has 4638 states and 6358 transitions. [2021-12-14 16:20:20,853 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 10.333333333333334) internal successors, (62), 3 states have internal predecessors, (62), 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) [2021-12-14 16:20:20,853 INFO L276 IsEmpty]: Start isEmpty. Operand 4638 states and 6358 transitions. [2021-12-14 16:20:20,856 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2021-12-14 16:20:20,857 INFO L506 BasicCegarLoop]: Found error trace [2021-12-14 16:20:20,857 INFO L514 BasicCegarLoop]: trace histogram [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] [2021-12-14 16:20:20,857 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2021-12-14 16:20:20,857 INFO L402 AbstractCegarLoop]: === Iteration 16 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-14 16:20:20,857 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 16:20:20,858 INFO L85 PathProgramCache]: Analyzing trace with hash -1870290611, now seen corresponding path program 1 times [2021-12-14 16:20:20,858 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-14 16:20:20,858 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [454098958] [2021-12-14 16:20:20,858 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 16:20:20,858 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-14 16:20:20,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 16:20:20,886 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2021-12-14 16:20:20,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 16:20:20,899 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2021-12-14 16:20:20,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 16:20:20,907 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2021-12-14 16:20:20,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 16:20:20,924 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-14 16:20:20,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 16:20:20,926 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2021-12-14 16:20:20,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 16:20:20,928 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2021-12-14 16:20:20,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 16:20:20,930 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2021-12-14 16:20:20,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 16:20:20,931 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2021-12-14 16:20:20,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 16:20:20,937 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 15 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2021-12-14 16:20:20,937 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-14 16:20:20,938 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [454098958] [2021-12-14 16:20:20,939 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [454098958] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-14 16:20:20,939 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-14 16:20:20,939 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2021-12-14 16:20:20,939 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1860298864] [2021-12-14 16:20:20,940 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-14 16:20:20,940 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2021-12-14 16:20:20,940 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-14 16:20:20,940 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-12-14 16:20:20,941 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2021-12-14 16:20:20,941 INFO L87 Difference]: Start difference. First operand 4638 states and 6358 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) [2021-12-14 16:20:22,031 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-14 16:20:22,032 INFO L93 Difference]: Finished difference Result 7464 states and 9960 transitions. [2021-12-14 16:20:22,032 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2021-12-14 16:20:22,033 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 92 [2021-12-14 16:20:22,033 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-14 16:20:22,049 INFO L225 Difference]: With dead ends: 7464 [2021-12-14 16:20:22,049 INFO L226 Difference]: Without dead ends: 5437 [2021-12-14 16:20:22,054 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 226 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=210, Invalid=720, Unknown=0, NotChecked=0, Total=930 [2021-12-14 16:20:22,056 INFO L933 BasicCegarLoop]: 407 mSDtfsCounter, 1545 mSDsluCounter, 965 mSDsCounter, 0 mSdLazyCounter, 1001 mSolverCounterSat, 472 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1578 SdHoareTripleChecker+Valid, 1372 SdHoareTripleChecker+Invalid, 1473 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 472 IncrementalHoareTripleChecker+Valid, 1001 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2021-12-14 16:20:22,056 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1578 Valid, 1372 Invalid, 1473 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [472 Valid, 1001 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2021-12-14 16:20:22,061 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5437 states. [2021-12-14 16:20:22,283 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5437 to 5260. [2021-12-14 16:20:22,288 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5260 states, 4258 states have (on average 1.3435885392202913) internal successors, (5721), 4333 states have internal predecessors, (5721), 556 states have call successors, (556), 350 states have call predecessors, (556), 444 states have return successors, (823), 586 states have call predecessors, (823), 552 states have call successors, (823) [2021-12-14 16:20:22,297 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5260 states to 5260 states and 7100 transitions. [2021-12-14 16:20:22,299 INFO L78 Accepts]: Start accepts. Automaton has 5260 states and 7100 transitions. Word has length 92 [2021-12-14 16:20:22,299 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-14 16:20:22,299 INFO L470 AbstractCegarLoop]: Abstraction has 5260 states and 7100 transitions. [2021-12-14 16:20:22,299 INFO L471 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) [2021-12-14 16:20:22,299 INFO L276 IsEmpty]: Start isEmpty. Operand 5260 states and 7100 transitions. [2021-12-14 16:20:22,304 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2021-12-14 16:20:22,304 INFO L506 BasicCegarLoop]: Found error trace [2021-12-14 16:20:22,304 INFO L514 BasicCegarLoop]: 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] [2021-12-14 16:20:22,304 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2021-12-14 16:20:22,305 INFO L402 AbstractCegarLoop]: === Iteration 17 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-14 16:20:22,305 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 16:20:22,305 INFO L85 PathProgramCache]: Analyzing trace with hash 56705439, now seen corresponding path program 1 times [2021-12-14 16:20:22,305 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-14 16:20:22,305 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [950779824] [2021-12-14 16:20:22,305 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 16:20:22,306 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-14 16:20:22,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 16:20:22,321 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2021-12-14 16:20:22,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 16:20:22,329 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2021-12-14 16:20:22,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 16:20:22,335 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2021-12-14 16:20:22,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 16:20:22,367 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2021-12-14 16:20:22,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 16:20:22,369 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2021-12-14 16:20:22,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 16:20:22,371 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2021-12-14 16:20:22,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 16:20:22,375 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-12-14 16:20:22,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 16:20:22,380 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2021-12-14 16:20:22,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 16:20:22,384 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2021-12-14 16:20:22,385 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-14 16:20:22,385 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [950779824] [2021-12-14 16:20:22,385 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [950779824] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-14 16:20:22,385 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1542345132] [2021-12-14 16:20:22,385 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 16:20:22,385 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-14 16:20:22,385 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-14 16:20:22,387 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) [2021-12-14 16:20:22,389 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2021-12-14 16:20:22,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 16:20:22,485 INFO L263 TraceCheckSpWp]: Trace formula consists of 420 conjuncts, 2 conjunts are in the unsatisfiable core [2021-12-14 16:20:22,495 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-14 16:20:22,710 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2021-12-14 16:20:22,710 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-14 16:20:22,710 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1542345132] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-14 16:20:22,710 INFO L186 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2021-12-14 16:20:22,710 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [7] total 8 [2021-12-14 16:20:22,711 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1956425337] [2021-12-14 16:20:22,711 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-14 16:20:22,711 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-12-14 16:20:22,711 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-14 16:20:22,711 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-12-14 16:20:22,711 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2021-12-14 16:20:22,711 INFO L87 Difference]: Start difference. First operand 5260 states and 7100 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) [2021-12-14 16:20:23,013 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-14 16:20:23,013 INFO L93 Difference]: Finished difference Result 10874 states and 15268 transitions. [2021-12-14 16:20:23,013 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-12-14 16:20:23,013 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 [2021-12-14 16:20:23,013 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-14 16:20:23,028 INFO L225 Difference]: With dead ends: 10874 [2021-12-14 16:20:23,028 INFO L226 Difference]: Without dead ends: 5785 [2021-12-14 16:20:23,039 INFO L932 BasicCegarLoop]: 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 [2021-12-14 16:20:23,039 INFO L933 BasicCegarLoop]: 494 mSDtfsCounter, 153 mSDsluCounter, 335 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 153 SdHoareTripleChecker+Valid, 829 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 [2021-12-14 16:20:23,040 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [153 Valid, 829 Invalid, 12 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-14 16:20:23,044 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5785 states. [2021-12-14 16:20:23,242 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5785 to 5785. [2021-12-14 16:20:23,248 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5785 states, 4700 states have (on average 1.3495744680851063) internal successors, (6343), 4779 states have internal predecessors, (6343), 605 states have call successors, (605), 380 states have call predecessors, (605), 478 states have return successors, (901), 635 states have call predecessors, (901), 601 states have call successors, (901) [2021-12-14 16:20:23,258 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5785 states to 5785 states and 7849 transitions. [2021-12-14 16:20:23,259 INFO L78 Accepts]: Start accepts. Automaton has 5785 states and 7849 transitions. Word has length 111 [2021-12-14 16:20:23,260 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-14 16:20:23,260 INFO L470 AbstractCegarLoop]: Abstraction has 5785 states and 7849 transitions. [2021-12-14 16:20:23,260 INFO L471 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) [2021-12-14 16:20:23,260 INFO L276 IsEmpty]: Start isEmpty. Operand 5785 states and 7849 transitions. [2021-12-14 16:20:23,267 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2021-12-14 16:20:23,267 INFO L506 BasicCegarLoop]: Found error trace [2021-12-14 16:20:23,267 INFO L514 BasicCegarLoop]: 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] [2021-12-14 16:20:23,303 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2021-12-14 16:20:23,483 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2021-12-14 16:20:23,484 INFO L402 AbstractCegarLoop]: === Iteration 18 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-14 16:20:23,484 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 16:20:23,484 INFO L85 PathProgramCache]: Analyzing trace with hash 1296496829, now seen corresponding path program 1 times [2021-12-14 16:20:23,484 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-14 16:20:23,484 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2059719558] [2021-12-14 16:20:23,484 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 16:20:23,484 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-14 16:20:23,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 16:20:23,498 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2021-12-14 16:20:23,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 16:20:23,506 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2021-12-14 16:20:23,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 16:20:23,511 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2021-12-14 16:20:23,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 16:20:23,537 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2021-12-14 16:20:23,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 16:20:23,541 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2021-12-14 16:20:23,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 16:20:23,543 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2021-12-14 16:20:23,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 16:20:23,546 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-12-14 16:20:23,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 16:20:23,548 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2021-12-14 16:20:23,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 16:20:23,551 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-12-14 16:20:23,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 16:20:23,554 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2021-12-14 16:20:23,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 16:20:23,556 INFO L134 CoverageAnalysis]: Checked inductivity of 71 backedges. 0 proven. 22 refuted. 0 times theorem prover too weak. 49 trivial. 0 not checked. [2021-12-14 16:20:23,556 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-14 16:20:23,556 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2059719558] [2021-12-14 16:20:23,556 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2059719558] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-14 16:20:23,556 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [495020885] [2021-12-14 16:20:23,557 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 16:20:23,557 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-14 16:20:23,557 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-14 16:20:23,558 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) [2021-12-14 16:20:23,559 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2021-12-14 16:20:23,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 16:20:23,642 INFO L263 TraceCheckSpWp]: Trace formula consists of 518 conjuncts, 2 conjunts are in the unsatisfiable core [2021-12-14 16:20:23,650 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-14 16:20:23,894 INFO L134 CoverageAnalysis]: Checked inductivity of 71 backedges. 51 proven. 0 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2021-12-14 16:20:23,894 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-14 16:20:23,894 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [495020885] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-14 16:20:23,894 INFO L186 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2021-12-14 16:20:23,894 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [7] total 8 [2021-12-14 16:20:23,895 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [745906641] [2021-12-14 16:20:23,895 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-14 16:20:23,895 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-12-14 16:20:23,895 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-14 16:20:23,896 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-12-14 16:20:23,896 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2021-12-14 16:20:23,896 INFO L87 Difference]: Start difference. First operand 5785 states and 7849 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) [2021-12-14 16:20:24,249 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-14 16:20:24,249 INFO L93 Difference]: Finished difference Result 12495 states and 17694 transitions. [2021-12-14 16:20:24,251 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-12-14 16:20:24,251 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 [2021-12-14 16:20:24,251 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-14 16:20:24,277 INFO L225 Difference]: With dead ends: 12495 [2021-12-14 16:20:24,277 INFO L226 Difference]: Without dead ends: 9075 [2021-12-14 16:20:24,290 INFO L932 BasicCegarLoop]: 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 [2021-12-14 16:20:24,291 INFO L933 BasicCegarLoop]: 347 mSDtfsCounter, 252 mSDsluCounter, 170 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 252 SdHoareTripleChecker+Valid, 517 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 [2021-12-14 16:20:24,291 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [252 Valid, 517 Invalid, 12 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-14 16:20:24,299 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9075 states. [2021-12-14 16:20:24,684 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9075 to 9005. [2021-12-14 16:20:24,692 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9005 states, 7394 states have (on average 1.3755747903705708) internal successors, (10171), 7516 states have internal predecessors, (10171), 909 states have call successors, (909), 574 states have call predecessors, (909), 700 states have return successors, (1365), 924 states have call predecessors, (1365), 905 states have call successors, (1365) [2021-12-14 16:20:24,708 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9005 states to 9005 states and 12445 transitions. [2021-12-14 16:20:24,710 INFO L78 Accepts]: Start accepts. Automaton has 9005 states and 12445 transitions. Word has length 143 [2021-12-14 16:20:24,710 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-14 16:20:24,710 INFO L470 AbstractCegarLoop]: Abstraction has 9005 states and 12445 transitions. [2021-12-14 16:20:24,710 INFO L471 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) [2021-12-14 16:20:24,710 INFO L276 IsEmpty]: Start isEmpty. Operand 9005 states and 12445 transitions. [2021-12-14 16:20:24,721 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2021-12-14 16:20:24,721 INFO L506 BasicCegarLoop]: Found error trace [2021-12-14 16:20:24,722 INFO L514 BasicCegarLoop]: 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] [2021-12-14 16:20:24,745 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2021-12-14 16:20:24,935 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2021-12-14 16:20:24,935 INFO L402 AbstractCegarLoop]: === Iteration 19 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-14 16:20:24,936 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 16:20:24,936 INFO L85 PathProgramCache]: Analyzing trace with hash 2080420097, now seen corresponding path program 1 times [2021-12-14 16:20:24,936 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-14 16:20:24,936 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1267799370] [2021-12-14 16:20:24,936 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 16:20:24,936 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-14 16:20:24,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 16:20:24,959 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2021-12-14 16:20:24,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 16:20:24,966 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2021-12-14 16:20:24,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 16:20:24,971 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2021-12-14 16:20:24,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 16:20:24,998 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2021-12-14 16:20:24,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 16:20:25,001 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2021-12-14 16:20:25,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 16:20:25,006 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2021-12-14 16:20:25,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 16:20:25,009 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-12-14 16:20:25,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 16:20:25,011 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2021-12-14 16:20:25,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 16:20:25,018 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-12-14 16:20:25,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 16:20:25,021 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2021-12-14 16:20:25,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 16:20:25,023 INFO L134 CoverageAnalysis]: Checked inductivity of 71 backedges. 0 proven. 22 refuted. 0 times theorem prover too weak. 49 trivial. 0 not checked. [2021-12-14 16:20:25,024 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-14 16:20:25,024 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1267799370] [2021-12-14 16:20:25,024 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1267799370] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-14 16:20:25,024 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1577563466] [2021-12-14 16:20:25,024 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 16:20:25,024 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-14 16:20:25,024 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-14 16:20:25,025 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) [2021-12-14 16:20:25,027 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2021-12-14 16:20:25,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 16:20:25,112 INFO L263 TraceCheckSpWp]: Trace formula consists of 518 conjuncts, 2 conjunts are in the unsatisfiable core [2021-12-14 16:20:25,117 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-14 16:20:25,311 INFO L134 CoverageAnalysis]: Checked inductivity of 71 backedges. 51 proven. 0 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2021-12-14 16:20:25,311 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-14 16:20:25,311 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1577563466] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-14 16:20:25,311 INFO L186 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2021-12-14 16:20:25,311 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [7] total 8 [2021-12-14 16:20:25,312 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [674531077] [2021-12-14 16:20:25,312 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-14 16:20:25,313 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-12-14 16:20:25,313 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-14 16:20:25,313 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-12-14 16:20:25,313 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2021-12-14 16:20:25,313 INFO L87 Difference]: Start difference. First operand 9005 states and 12445 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) [2021-12-14 16:20:25,696 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-14 16:20:25,697 INFO L93 Difference]: Finished difference Result 16265 states and 23071 transitions. [2021-12-14 16:20:25,697 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-12-14 16:20:25,697 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 [2021-12-14 16:20:25,697 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-14 16:20:25,724 INFO L225 Difference]: With dead ends: 16265 [2021-12-14 16:20:25,724 INFO L226 Difference]: Without dead ends: 12077 [2021-12-14 16:20:25,736 INFO L932 BasicCegarLoop]: 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 [2021-12-14 16:20:25,736 INFO L933 BasicCegarLoop]: 368 mSDtfsCounter, 253 mSDsluCounter, 170 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 253 SdHoareTripleChecker+Valid, 538 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 [2021-12-14 16:20:25,737 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [253 Valid, 538 Invalid, 12 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-14 16:20:25,746 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12077 states. [2021-12-14 16:20:26,127 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12077 to 11977. [2021-12-14 16:20:26,138 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11977 states, 9901 states have (on average 1.3896576103423897) internal successors, (13759), 10057 states have internal predecessors, (13759), 1177 states have call successors, (1177), 747 states have call predecessors, (1177), 897 states have return successors, (1746), 1182 states have call predecessors, (1746), 1173 states have call successors, (1746) [2021-12-14 16:20:26,221 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11977 states to 11977 states and 16682 transitions. [2021-12-14 16:20:26,222 INFO L78 Accepts]: Start accepts. Automaton has 11977 states and 16682 transitions. Word has length 143 [2021-12-14 16:20:26,223 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-14 16:20:26,223 INFO L470 AbstractCegarLoop]: Abstraction has 11977 states and 16682 transitions. [2021-12-14 16:20:26,223 INFO L471 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) [2021-12-14 16:20:26,223 INFO L276 IsEmpty]: Start isEmpty. Operand 11977 states and 16682 transitions. [2021-12-14 16:20:26,235 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 164 [2021-12-14 16:20:26,235 INFO L506 BasicCegarLoop]: Found error trace [2021-12-14 16:20:26,235 INFO L514 BasicCegarLoop]: trace histogram [5, 5, 5, 4, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2021-12-14 16:20:26,255 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2021-12-14 16:20:26,451 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-14 16:20:26,451 INFO L402 AbstractCegarLoop]: === Iteration 20 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-14 16:20:26,452 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 16:20:26,452 INFO L85 PathProgramCache]: Analyzing trace with hash -1194272178, now seen corresponding path program 1 times [2021-12-14 16:20:26,452 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-14 16:20:26,452 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [42943606] [2021-12-14 16:20:26,452 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 16:20:26,452 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-14 16:20:26,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 16:20:26,495 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2021-12-14 16:20:26,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 16:20:26,502 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2021-12-14 16:20:26,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 16:20:26,509 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2021-12-14 16:20:26,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 16:20:26,516 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-14 16:20:26,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 16:20:26,518 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2021-12-14 16:20:26,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 16:20:26,520 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2021-12-14 16:20:26,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 16:20:26,521 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2021-12-14 16:20:26,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 16:20:26,524 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2021-12-14 16:20:26,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 16:20:26,539 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2021-12-14 16:20:26,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 16:20:26,541 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2021-12-14 16:20:26,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 16:20:26,543 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2021-12-14 16:20:26,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 16:20:26,547 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-14 16:20:26,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 16:20:26,549 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-12-14 16:20:26,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 16:20:26,552 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2021-12-14 16:20:26,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 16:20:26,555 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 114 [2021-12-14 16:20:26,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 16:20:26,558 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2021-12-14 16:20:26,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 16:20:26,562 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 137 [2021-12-14 16:20:26,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 16:20:26,564 INFO L134 CoverageAnalysis]: Checked inductivity of 104 backedges. 23 proven. 9 refuted. 0 times theorem prover too weak. 72 trivial. 0 not checked. [2021-12-14 16:20:26,565 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-14 16:20:26,565 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [42943606] [2021-12-14 16:20:26,565 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [42943606] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-14 16:20:26,565 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [382405342] [2021-12-14 16:20:26,565 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 16:20:26,565 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-14 16:20:26,566 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-14 16:20:26,566 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) [2021-12-14 16:20:26,568 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2021-12-14 16:20:26,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 16:20:26,651 INFO L263 TraceCheckSpWp]: Trace formula consists of 532 conjuncts, 2 conjunts are in the unsatisfiable core [2021-12-14 16:20:26,656 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-14 16:20:26,885 INFO L134 CoverageAnalysis]: Checked inductivity of 104 backedges. 69 proven. 0 refuted. 0 times theorem prover too weak. 35 trivial. 0 not checked. [2021-12-14 16:20:26,886 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-14 16:20:26,886 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [382405342] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-14 16:20:26,886 INFO L186 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2021-12-14 16:20:26,886 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [10] total 11 [2021-12-14 16:20:26,887 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [588983849] [2021-12-14 16:20:26,887 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-14 16:20:26,888 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-12-14 16:20:26,888 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-14 16:20:26,889 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-12-14 16:20:26,889 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=90, Unknown=0, NotChecked=0, Total=110 [2021-12-14 16:20:26,889 INFO L87 Difference]: Start difference. First operand 11977 states and 16682 transitions. Second operand has 3 states, 3 states have (on average 36.0) internal successors, (108), 3 states have internal predecessors, (108), 2 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) [2021-12-14 16:20:27,336 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-14 16:20:27,336 INFO L93 Difference]: Finished difference Result 16302 states and 21997 transitions. [2021-12-14 16:20:27,337 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-12-14 16:20:27,337 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 36.0) internal successors, (108), 3 states have internal predecessors, (108), 2 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) Word has length 163 [2021-12-14 16:20:27,337 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-14 16:20:27,366 INFO L225 Difference]: With dead ends: 16302 [2021-12-14 16:20:27,366 INFO L226 Difference]: Without dead ends: 14114 [2021-12-14 16:20:27,373 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 203 GetRequests, 194 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=20, Invalid=90, Unknown=0, NotChecked=0, Total=110 [2021-12-14 16:20:27,374 INFO L933 BasicCegarLoop]: 352 mSDtfsCounter, 61 mSDsluCounter, 319 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 61 SdHoareTripleChecker+Valid, 671 SdHoareTripleChecker+Invalid, 8 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-14 16:20:27,374 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [61 Valid, 671 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-14 16:20:27,381 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14114 states. [2021-12-14 16:20:27,999 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14114 to 14069. [2021-12-14 16:20:28,014 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14069 states, 11526 states have (on average 1.3627450980392157) internal successors, (15707), 11711 states have internal predecessors, (15707), 1411 states have call successors, (1411), 929 states have call predecessors, (1411), 1130 states have return successors, (2053), 1438 states have call predecessors, (2053), 1407 states have call successors, (2053) [2021-12-14 16:20:28,051 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14069 states to 14069 states and 19171 transitions. [2021-12-14 16:20:28,053 INFO L78 Accepts]: Start accepts. Automaton has 14069 states and 19171 transitions. Word has length 163 [2021-12-14 16:20:28,054 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-14 16:20:28,054 INFO L470 AbstractCegarLoop]: Abstraction has 14069 states and 19171 transitions. [2021-12-14 16:20:28,054 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 36.0) internal successors, (108), 3 states have internal predecessors, (108), 2 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) [2021-12-14 16:20:28,054 INFO L276 IsEmpty]: Start isEmpty. Operand 14069 states and 19171 transitions. [2021-12-14 16:20:28,069 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 161 [2021-12-14 16:20:28,069 INFO L506 BasicCegarLoop]: Found error trace [2021-12-14 16:20:28,069 INFO L514 BasicCegarLoop]: 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] [2021-12-14 16:20:28,088 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2021-12-14 16:20:28,287 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-14 16:20:28,287 INFO L402 AbstractCegarLoop]: === Iteration 21 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-14 16:20:28,288 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 16:20:28,288 INFO L85 PathProgramCache]: Analyzing trace with hash 746982758, now seen corresponding path program 1 times [2021-12-14 16:20:28,288 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-14 16:20:28,288 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1915657921] [2021-12-14 16:20:28,288 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 16:20:28,288 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-14 16:20:28,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 16:20:28,308 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2021-12-14 16:20:28,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 16:20:28,315 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2021-12-14 16:20:28,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 16:20:28,321 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2021-12-14 16:20:28,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 16:20:28,348 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2021-12-14 16:20:28,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 16:20:28,351 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2021-12-14 16:20:28,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 16:20:28,352 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2021-12-14 16:20:28,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 16:20:28,354 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2021-12-14 16:20:28,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 16:20:28,356 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-12-14 16:20:28,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 16:20:28,359 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 115 [2021-12-14 16:20:28,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 16:20:28,362 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-12-14 16:20:28,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 16:20:28,378 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 145 [2021-12-14 16:20:28,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 16:20:28,380 INFO L134 CoverageAnalysis]: Checked inductivity of 98 backedges. 0 proven. 22 refuted. 0 times theorem prover too weak. 76 trivial. 0 not checked. [2021-12-14 16:20:28,381 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-14 16:20:28,381 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1915657921] [2021-12-14 16:20:28,381 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1915657921] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-14 16:20:28,381 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1665045870] [2021-12-14 16:20:28,381 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 16:20:28,381 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-14 16:20:28,382 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-14 16:20:28,382 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) [2021-12-14 16:20:28,383 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2021-12-14 16:20:28,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 16:20:28,476 INFO L263 TraceCheckSpWp]: Trace formula consists of 559 conjuncts, 2 conjunts are in the unsatisfiable core [2021-12-14 16:20:28,479 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-14 16:20:28,658 INFO L134 CoverageAnalysis]: Checked inductivity of 98 backedges. 82 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2021-12-14 16:20:28,659 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-14 16:20:28,659 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1665045870] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-14 16:20:28,659 INFO L186 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2021-12-14 16:20:28,659 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [7] total 8 [2021-12-14 16:20:28,659 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [839714093] [2021-12-14 16:20:28,659 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-14 16:20:28,660 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-12-14 16:20:28,661 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-14 16:20:28,661 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-12-14 16:20:28,661 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2021-12-14 16:20:28,661 INFO L87 Difference]: Start difference. First operand 14069 states and 19171 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) [2021-12-14 16:20:29,122 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-14 16:20:29,122 INFO L93 Difference]: Finished difference Result 19704 states and 27234 transitions. [2021-12-14 16:20:29,122 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-12-14 16:20:29,122 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 [2021-12-14 16:20:29,123 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-14 16:20:29,151 INFO L225 Difference]: With dead ends: 19704 [2021-12-14 16:20:29,151 INFO L226 Difference]: Without dead ends: 11177 [2021-12-14 16:20:29,168 INFO L932 BasicCegarLoop]: 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 [2021-12-14 16:20:29,169 INFO L933 BasicCegarLoop]: 334 mSDtfsCounter, 271 mSDsluCounter, 34 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 271 SdHoareTripleChecker+Valid, 368 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 [2021-12-14 16:20:29,169 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [271 Valid, 368 Invalid, 12 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-14 16:20:29,176 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11177 states. [2021-12-14 16:20:29,555 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11177 to 10697. [2021-12-14 16:20:29,566 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10697 states, 8719 states have (on average 1.3027870168597315) internal successors, (11359), 8838 states have internal predecessors, (11359), 1072 states have call successors, (1072), 745 states have call predecessors, (1072), 904 states have return successors, (1423), 1119 states have call predecessors, (1423), 1068 states have call successors, (1423) [2021-12-14 16:20:29,584 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10697 states to 10697 states and 13854 transitions. [2021-12-14 16:20:29,586 INFO L78 Accepts]: Start accepts. Automaton has 10697 states and 13854 transitions. Word has length 160 [2021-12-14 16:20:29,586 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-14 16:20:29,586 INFO L470 AbstractCegarLoop]: Abstraction has 10697 states and 13854 transitions. [2021-12-14 16:20:29,586 INFO L471 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) [2021-12-14 16:20:29,587 INFO L276 IsEmpty]: Start isEmpty. Operand 10697 states and 13854 transitions. [2021-12-14 16:20:29,595 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 161 [2021-12-14 16:20:29,595 INFO L506 BasicCegarLoop]: Found error trace [2021-12-14 16:20:29,596 INFO L514 BasicCegarLoop]: 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] [2021-12-14 16:20:29,616 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2021-12-14 16:20:29,803 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-14 16:20:29,803 INFO L402 AbstractCegarLoop]: === Iteration 22 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-14 16:20:29,803 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 16:20:29,803 INFO L85 PathProgramCache]: Analyzing trace with hash -1605594576, now seen corresponding path program 1 times [2021-12-14 16:20:29,804 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-14 16:20:29,804 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1658768183] [2021-12-14 16:20:29,804 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 16:20:29,804 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-14 16:20:29,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 16:20:29,824 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2021-12-14 16:20:29,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 16:20:29,833 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2021-12-14 16:20:29,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 16:20:29,846 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2021-12-14 16:20:29,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 16:20:29,884 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2021-12-14 16:20:29,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 16:20:29,887 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2021-12-14 16:20:29,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 16:20:29,888 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2021-12-14 16:20:29,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 16:20:29,889 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2021-12-14 16:20:29,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 16:20:29,892 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-12-14 16:20:29,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 16:20:29,894 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2021-12-14 16:20:29,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 16:20:29,897 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-12-14 16:20:29,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 16:20:29,900 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 145 [2021-12-14 16:20:29,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 16:20:29,902 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 0 proven. 22 refuted. 0 times theorem prover too weak. 78 trivial. 0 not checked. [2021-12-14 16:20:29,903 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-14 16:20:29,903 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1658768183] [2021-12-14 16:20:29,903 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1658768183] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-14 16:20:29,903 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1226424321] [2021-12-14 16:20:29,903 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 16:20:29,904 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-14 16:20:29,904 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-14 16:20:29,905 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) [2021-12-14 16:20:29,931 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2021-12-14 16:20:29,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 16:20:29,997 INFO L263 TraceCheckSpWp]: Trace formula consists of 550 conjuncts, 3 conjunts are in the unsatisfiable core [2021-12-14 16:20:29,999 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-14 16:20:30,175 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 59 proven. 0 refuted. 0 times theorem prover too weak. 41 trivial. 0 not checked. [2021-12-14 16:20:30,175 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-14 16:20:30,175 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1226424321] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-14 16:20:30,175 INFO L186 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2021-12-14 16:20:30,175 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [7] total 8 [2021-12-14 16:20:30,176 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [229865791] [2021-12-14 16:20:30,176 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-14 16:20:30,176 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-12-14 16:20:30,176 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-14 16:20:30,176 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-12-14 16:20:30,176 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2021-12-14 16:20:30,177 INFO L87 Difference]: Start difference. First operand 10697 states and 13854 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) [2021-12-14 16:20:30,592 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-14 16:20:30,592 INFO L93 Difference]: Finished difference Result 17534 states and 23048 transitions. [2021-12-14 16:20:30,594 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-12-14 16:20:30,594 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 [2021-12-14 16:20:30,595 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-14 16:20:30,620 INFO L225 Difference]: With dead ends: 17534 [2021-12-14 16:20:30,620 INFO L226 Difference]: Without dead ends: 11295 [2021-12-14 16:20:30,632 INFO L932 BasicCegarLoop]: 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 [2021-12-14 16:20:30,632 INFO L933 BasicCegarLoop]: 359 mSDtfsCounter, 298 mSDsluCounter, 166 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 298 SdHoareTripleChecker+Valid, 525 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 [2021-12-14 16:20:30,632 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [298 Valid, 525 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-14 16:20:30,640 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11295 states. [2021-12-14 16:20:31,040 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11295 to 11150. [2021-12-14 16:20:31,050 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11150 states, 9135 states have (on average 1.2825396825396826) internal successors, (11716), 9249 states have internal predecessors, (11716), 1074 states have call successors, (1074), 777 states have call predecessors, (1074), 939 states have return successors, (1419), 1129 states have call predecessors, (1419), 1070 states have call successors, (1419) [2021-12-14 16:20:31,068 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11150 states to 11150 states and 14209 transitions. [2021-12-14 16:20:31,070 INFO L78 Accepts]: Start accepts. Automaton has 11150 states and 14209 transitions. Word has length 160 [2021-12-14 16:20:31,071 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-14 16:20:31,071 INFO L470 AbstractCegarLoop]: Abstraction has 11150 states and 14209 transitions. [2021-12-14 16:20:31,071 INFO L471 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) [2021-12-14 16:20:31,071 INFO L276 IsEmpty]: Start isEmpty. Operand 11150 states and 14209 transitions. [2021-12-14 16:20:31,078 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 162 [2021-12-14 16:20:31,079 INFO L506 BasicCegarLoop]: Found error trace [2021-12-14 16:20:31,079 INFO L514 BasicCegarLoop]: 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] [2021-12-14 16:20:31,107 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2021-12-14 16:20:31,291 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-14 16:20:31,292 INFO L402 AbstractCegarLoop]: === Iteration 23 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-14 16:20:31,292 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 16:20:31,292 INFO L85 PathProgramCache]: Analyzing trace with hash 522982663, now seen corresponding path program 1 times [2021-12-14 16:20:31,292 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-14 16:20:31,292 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1933100739] [2021-12-14 16:20:31,292 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 16:20:31,292 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-14 16:20:31,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 16:20:31,305 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2021-12-14 16:20:31,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 16:20:31,311 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2021-12-14 16:20:31,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 16:20:31,317 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2021-12-14 16:20:31,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 16:20:31,344 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2021-12-14 16:20:31,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 16:20:31,347 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2021-12-14 16:20:31,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 16:20:31,348 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2021-12-14 16:20:31,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 16:20:31,351 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-12-14 16:20:31,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 16:20:31,354 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2021-12-14 16:20:31,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 16:20:31,355 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2021-12-14 16:20:31,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 16:20:31,358 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-12-14 16:20:31,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 16:20:31,361 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 146 [2021-12-14 16:20:31,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 16:20:31,362 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 0 proven. 22 refuted. 0 times theorem prover too weak. 78 trivial. 0 not checked. [2021-12-14 16:20:31,362 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-14 16:20:31,362 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1933100739] [2021-12-14 16:20:31,362 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1933100739] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-14 16:20:31,362 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [163572109] [2021-12-14 16:20:31,363 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 16:20:31,363 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-14 16:20:31,363 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-14 16:20:31,364 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) [2021-12-14 16:20:31,371 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2021-12-14 16:20:31,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 16:20:31,451 INFO L263 TraceCheckSpWp]: Trace formula consists of 551 conjuncts, 2 conjunts are in the unsatisfiable core [2021-12-14 16:20:31,453 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-14 16:20:31,637 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 80 proven. 0 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2021-12-14 16:20:31,637 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-14 16:20:31,638 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [163572109] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-14 16:20:31,638 INFO L186 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2021-12-14 16:20:31,638 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [7] total 8 [2021-12-14 16:20:31,638 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [308503417] [2021-12-14 16:20:31,638 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-14 16:20:31,638 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-12-14 16:20:31,639 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-14 16:20:31,639 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-12-14 16:20:31,639 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2021-12-14 16:20:31,639 INFO L87 Difference]: Start difference. First operand 11150 states and 14209 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) [2021-12-14 16:20:32,200 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-14 16:20:32,201 INFO L93 Difference]: Finished difference Result 23451 states and 30632 transitions. [2021-12-14 16:20:32,202 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-12-14 16:20:32,202 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 [2021-12-14 16:20:32,202 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-14 16:20:32,239 INFO L225 Difference]: With dead ends: 23451 [2021-12-14 16:20:32,239 INFO L226 Difference]: Without dead ends: 16759 [2021-12-14 16:20:32,253 INFO L932 BasicCegarLoop]: 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 [2021-12-14 16:20:32,253 INFO L933 BasicCegarLoop]: 486 mSDtfsCounter, 151 mSDsluCounter, 332 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 151 SdHoareTripleChecker+Valid, 818 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 [2021-12-14 16:20:32,254 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [151 Valid, 818 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-14 16:20:32,264 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16759 states. [2021-12-14 16:20:33,024 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16759 to 16755. [2021-12-14 16:20:33,038 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16755 states, 13837 states have (on average 1.2924044229240443) internal successors, (17883), 14001 states have internal predecessors, (17883), 1581 states have call successors, (1581), 1132 states have call predecessors, (1581), 1335 states have return successors, (2254), 1631 states have call predecessors, (2254), 1577 states have call successors, (2254) [2021-12-14 16:20:33,071 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16755 states to 16755 states and 21718 transitions. [2021-12-14 16:20:33,074 INFO L78 Accepts]: Start accepts. Automaton has 16755 states and 21718 transitions. Word has length 161 [2021-12-14 16:20:33,074 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-14 16:20:33,075 INFO L470 AbstractCegarLoop]: Abstraction has 16755 states and 21718 transitions. [2021-12-14 16:20:33,075 INFO L471 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) [2021-12-14 16:20:33,075 INFO L276 IsEmpty]: Start isEmpty. Operand 16755 states and 21718 transitions. [2021-12-14 16:20:33,086 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 162 [2021-12-14 16:20:33,086 INFO L506 BasicCegarLoop]: Found error trace [2021-12-14 16:20:33,086 INFO L514 BasicCegarLoop]: 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] [2021-12-14 16:20:33,107 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2021-12-14 16:20:33,287 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-14 16:20:33,287 INFO L402 AbstractCegarLoop]: === Iteration 24 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-14 16:20:33,287 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 16:20:33,287 INFO L85 PathProgramCache]: Analyzing trace with hash 675676757, now seen corresponding path program 1 times [2021-12-14 16:20:33,288 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-14 16:20:33,288 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [852115257] [2021-12-14 16:20:33,288 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 16:20:33,288 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-14 16:20:33,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 16:20:33,303 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2021-12-14 16:20:33,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 16:20:33,311 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2021-12-14 16:20:33,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 16:20:33,317 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2021-12-14 16:20:33,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 16:20:33,343 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2021-12-14 16:20:33,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 16:20:33,346 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2021-12-14 16:20:33,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 16:20:33,347 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2021-12-14 16:20:33,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 16:20:33,349 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2021-12-14 16:20:33,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 16:20:33,352 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-12-14 16:20:33,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 16:20:33,354 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2021-12-14 16:20:33,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 16:20:33,357 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-12-14 16:20:33,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 16:20:33,360 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 146 [2021-12-14 16:20:33,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 16:20:33,362 INFO L134 CoverageAnalysis]: Checked inductivity of 102 backedges. 0 proven. 22 refuted. 0 times theorem prover too weak. 80 trivial. 0 not checked. [2021-12-14 16:20:33,362 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-14 16:20:33,362 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [852115257] [2021-12-14 16:20:33,363 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [852115257] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-14 16:20:33,363 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1598678613] [2021-12-14 16:20:33,363 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 16:20:33,363 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-14 16:20:33,363 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-14 16:20:33,370 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) [2021-12-14 16:20:33,372 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2021-12-14 16:20:33,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 16:20:33,461 INFO L263 TraceCheckSpWp]: Trace formula consists of 557 conjuncts, 3 conjunts are in the unsatisfiable core [2021-12-14 16:20:33,463 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-14 16:20:33,639 INFO L134 CoverageAnalysis]: Checked inductivity of 102 backedges. 62 proven. 0 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2021-12-14 16:20:33,639 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-14 16:20:33,639 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1598678613] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-14 16:20:33,639 INFO L186 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2021-12-14 16:20:33,639 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [7] total 8 [2021-12-14 16:20:33,639 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [79194531] [2021-12-14 16:20:33,639 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-14 16:20:33,640 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-12-14 16:20:33,640 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-14 16:20:33,640 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-12-14 16:20:33,640 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2021-12-14 16:20:33,640 INFO L87 Difference]: Start difference. First operand 16755 states and 21718 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) [2021-12-14 16:20:34,780 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-14 16:20:34,781 INFO L93 Difference]: Finished difference Result 40810 states and 54220 transitions. [2021-12-14 16:20:34,781 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-12-14 16:20:34,781 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 [2021-12-14 16:20:34,781 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-14 16:20:34,848 INFO L225 Difference]: With dead ends: 40810 [2021-12-14 16:20:34,848 INFO L226 Difference]: Without dead ends: 28517 [2021-12-14 16:20:34,865 INFO L932 BasicCegarLoop]: 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 [2021-12-14 16:20:34,865 INFO L933 BasicCegarLoop]: 376 mSDtfsCounter, 297 mSDsluCounter, 175 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 297 SdHoareTripleChecker+Valid, 551 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 [2021-12-14 16:20:34,866 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [297 Valid, 551 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-14 16:20:34,883 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28517 states. [2021-12-14 16:20:35,906 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28517 to 28251. [2021-12-14 16:20:35,934 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 28251 states, 23571 states have (on average 1.2945992957447712) internal successors, (30515), 23835 states have internal predecessors, (30515), 2551 states have call successors, (2551), 1848 states have call predecessors, (2551), 2127 states have return successors, (4331), 2585 states have call predecessors, (4331), 2547 states have call successors, (4331) [2021-12-14 16:20:35,996 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28251 states to 28251 states and 37397 transitions. [2021-12-14 16:20:36,002 INFO L78 Accepts]: Start accepts. Automaton has 28251 states and 37397 transitions. Word has length 161 [2021-12-14 16:20:36,003 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-14 16:20:36,003 INFO L470 AbstractCegarLoop]: Abstraction has 28251 states and 37397 transitions. [2021-12-14 16:20:36,003 INFO L471 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) [2021-12-14 16:20:36,003 INFO L276 IsEmpty]: Start isEmpty. Operand 28251 states and 37397 transitions. [2021-12-14 16:20:36,105 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 162 [2021-12-14 16:20:36,105 INFO L506 BasicCegarLoop]: Found error trace [2021-12-14 16:20:36,106 INFO L514 BasicCegarLoop]: 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] [2021-12-14 16:20:36,128 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2021-12-14 16:20:36,315 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable23 [2021-12-14 16:20:36,315 INFO L402 AbstractCegarLoop]: === Iteration 25 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-14 16:20:36,316 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 16:20:36,316 INFO L85 PathProgramCache]: Analyzing trace with hash 1567842387, now seen corresponding path program 1 times [2021-12-14 16:20:36,316 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-14 16:20:36,316 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1131688183] [2021-12-14 16:20:36,316 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 16:20:36,316 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-14 16:20:36,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 16:20:36,336 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2021-12-14 16:20:36,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 16:20:36,345 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2021-12-14 16:20:36,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 16:20:36,353 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2021-12-14 16:20:36,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 16:20:36,357 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2021-12-14 16:20:36,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 16:20:36,360 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2021-12-14 16:20:36,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 16:20:36,362 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2021-12-14 16:20:36,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 16:20:36,364 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2021-12-14 16:20:36,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 16:20:36,368 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-12-14 16:20:36,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 16:20:36,372 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2021-12-14 16:20:36,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 16:20:36,376 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-12-14 16:20:36,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 16:20:36,378 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 146 [2021-12-14 16:20:36,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 16:20:36,381 INFO L134 CoverageAnalysis]: Checked inductivity of 102 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 102 trivial. 0 not checked. [2021-12-14 16:20:36,381 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-14 16:20:36,381 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1131688183] [2021-12-14 16:20:36,381 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1131688183] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-14 16:20:36,381 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-14 16:20:36,381 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-12-14 16:20:36,381 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2061010978] [2021-12-14 16:20:36,382 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-14 16:20:36,382 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-12-14 16:20:36,382 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-14 16:20:36,382 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-12-14 16:20:36,382 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-12-14 16:20:36,383 INFO L87 Difference]: Start difference. First operand 28251 states and 37397 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) [2021-12-14 16:20:37,725 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-14 16:20:37,725 INFO L93 Difference]: Finished difference Result 49844 states and 66334 transitions. [2021-12-14 16:20:37,725 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-12-14 16:20:37,726 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 [2021-12-14 16:20:37,726 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-14 16:20:37,802 INFO L225 Difference]: With dead ends: 49844 [2021-12-14 16:20:37,802 INFO L226 Difference]: Without dead ends: 26053 [2021-12-14 16:20:37,846 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 25 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2021-12-14 16:20:37,848 INFO L933 BasicCegarLoop]: 323 mSDtfsCounter, 431 mSDsluCounter, 360 mSDsCounter, 0 mSdLazyCounter, 245 mSolverCounterSat, 87 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 448 SdHoareTripleChecker+Valid, 683 SdHoareTripleChecker+Invalid, 332 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 87 IncrementalHoareTripleChecker+Valid, 245 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2021-12-14 16:20:37,848 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [448 Valid, 683 Invalid, 332 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [87 Valid, 245 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2021-12-14 16:20:37,869 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26053 states. [2021-12-14 16:20:38,955 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26053 to 24059. [2021-12-14 16:20:38,975 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 24059 states, 19989 states have (on average 1.293211266196408) internal successors, (25850), 20382 states have internal predecessors, (25850), 2061 states have call successors, (2061), 1488 states have call predecessors, (2061), 2007 states have return successors, (3780), 2198 states have call predecessors, (3780), 2057 states have call successors, (3780) [2021-12-14 16:20:39,019 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24059 states to 24059 states and 31691 transitions. [2021-12-14 16:20:39,023 INFO L78 Accepts]: Start accepts. Automaton has 24059 states and 31691 transitions. Word has length 161 [2021-12-14 16:20:39,023 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-14 16:20:39,023 INFO L470 AbstractCegarLoop]: Abstraction has 24059 states and 31691 transitions. [2021-12-14 16:20:39,023 INFO L471 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) [2021-12-14 16:20:39,024 INFO L276 IsEmpty]: Start isEmpty. Operand 24059 states and 31691 transitions. [2021-12-14 16:20:39,038 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 164 [2021-12-14 16:20:39,038 INFO L506 BasicCegarLoop]: Found error trace [2021-12-14 16:20:39,038 INFO L514 BasicCegarLoop]: 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] [2021-12-14 16:20:39,039 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2021-12-14 16:20:39,039 INFO L402 AbstractCegarLoop]: === Iteration 26 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-14 16:20:39,039 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 16:20:39,039 INFO L85 PathProgramCache]: Analyzing trace with hash -423691555, now seen corresponding path program 1 times [2021-12-14 16:20:39,039 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-14 16:20:39,039 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [663740896] [2021-12-14 16:20:39,039 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 16:20:39,039 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-14 16:20:39,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 16:20:39,057 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2021-12-14 16:20:39,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 16:20:39,064 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2021-12-14 16:20:39,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 16:20:39,069 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2021-12-14 16:20:39,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 16:20:39,091 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2021-12-14 16:20:39,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 16:20:39,093 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2021-12-14 16:20:39,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 16:20:39,095 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2021-12-14 16:20:39,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 16:20:39,096 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2021-12-14 16:20:39,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 16:20:39,100 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-12-14 16:20:39,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 16:20:39,104 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2021-12-14 16:20:39,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 16:20:39,107 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-12-14 16:20:39,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 16:20:39,110 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 148 [2021-12-14 16:20:39,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 16:20:39,112 INFO L134 CoverageAnalysis]: Checked inductivity of 103 backedges. 0 proven. 22 refuted. 0 times theorem prover too weak. 81 trivial. 0 not checked. [2021-12-14 16:20:39,112 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-14 16:20:39,112 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [663740896] [2021-12-14 16:20:39,112 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [663740896] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-14 16:20:39,112 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1054990824] [2021-12-14 16:20:39,113 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 16:20:39,113 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-14 16:20:39,113 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-14 16:20:39,114 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) [2021-12-14 16:20:39,115 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2021-12-14 16:20:39,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 16:20:39,198 INFO L263 TraceCheckSpWp]: Trace formula consists of 571 conjuncts, 3 conjunts are in the unsatisfiable core [2021-12-14 16:20:39,199 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-14 16:20:39,368 INFO L134 CoverageAnalysis]: Checked inductivity of 103 backedges. 95 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2021-12-14 16:20:39,368 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-14 16:20:39,369 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1054990824] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-14 16:20:39,369 INFO L186 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2021-12-14 16:20:39,369 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [7] total 8 [2021-12-14 16:20:39,369 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [881528827] [2021-12-14 16:20:39,369 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-14 16:20:39,369 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-12-14 16:20:39,369 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-14 16:20:39,369 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-12-14 16:20:39,370 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2021-12-14 16:20:39,370 INFO L87 Difference]: Start difference. First operand 24059 states and 31691 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) [2021-12-14 16:20:40,514 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-14 16:20:40,514 INFO L93 Difference]: Finished difference Result 37494 states and 51321 transitions. [2021-12-14 16:20:40,514 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-12-14 16:20:40,514 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 [2021-12-14 16:20:40,515 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-14 16:20:40,577 INFO L225 Difference]: With dead ends: 37494 [2021-12-14 16:20:40,577 INFO L226 Difference]: Without dead ends: 24089 [2021-12-14 16:20:40,610 INFO L932 BasicCegarLoop]: 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 [2021-12-14 16:20:40,611 INFO L933 BasicCegarLoop]: 449 mSDtfsCounter, 140 mSDsluCounter, 303 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 140 SdHoareTripleChecker+Valid, 752 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 [2021-12-14 16:20:40,611 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [140 Valid, 752 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-14 16:20:40,625 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24089 states. [2021-12-14 16:20:41,908 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24089 to 24035. [2021-12-14 16:20:41,924 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 24035 states, 19965 states have (on average 1.2731780616078137) internal successors, (25419), 20358 states have internal predecessors, (25419), 2061 states have call successors, (2061), 1488 states have call predecessors, (2061), 2007 states have return successors, (3780), 2198 states have call predecessors, (3780), 2057 states have call successors, (3780) [2021-12-14 16:20:41,964 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24035 states to 24035 states and 31260 transitions. [2021-12-14 16:20:41,968 INFO L78 Accepts]: Start accepts. Automaton has 24035 states and 31260 transitions. Word has length 163 [2021-12-14 16:20:41,968 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-14 16:20:41,968 INFO L470 AbstractCegarLoop]: Abstraction has 24035 states and 31260 transitions. [2021-12-14 16:20:41,968 INFO L471 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) [2021-12-14 16:20:41,968 INFO L276 IsEmpty]: Start isEmpty. Operand 24035 states and 31260 transitions. [2021-12-14 16:20:41,981 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 164 [2021-12-14 16:20:41,981 INFO L506 BasicCegarLoop]: Found error trace [2021-12-14 16:20:41,982 INFO L514 BasicCegarLoop]: 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] [2021-12-14 16:20:41,998 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Ended with exit code 0 [2021-12-14 16:20:42,182 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable25 [2021-12-14 16:20:42,182 INFO L402 AbstractCegarLoop]: === Iteration 27 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-14 16:20:42,183 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 16:20:42,183 INFO L85 PathProgramCache]: Analyzing trace with hash -1271742787, now seen corresponding path program 1 times [2021-12-14 16:20:42,183 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-14 16:20:42,183 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [193754774] [2021-12-14 16:20:42,183 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 16:20:42,184 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-14 16:20:42,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 16:20:42,202 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2021-12-14 16:20:42,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 16:20:42,219 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2021-12-14 16:20:42,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 16:20:42,225 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2021-12-14 16:20:42,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 16:20:42,252 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2021-12-14 16:20:42,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 16:20:42,254 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2021-12-14 16:20:42,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 16:20:42,256 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2021-12-14 16:20:42,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 16:20:42,260 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2021-12-14 16:20:42,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 16:20:42,264 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-12-14 16:20:42,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 16:20:42,266 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2021-12-14 16:20:42,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 16:20:42,269 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-12-14 16:20:42,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 16:20:42,271 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 148 [2021-12-14 16:20:42,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 16:20:42,273 INFO L134 CoverageAnalysis]: Checked inductivity of 101 backedges. 0 proven. 20 refuted. 0 times theorem prover too weak. 81 trivial. 0 not checked. [2021-12-14 16:20:42,273 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-14 16:20:42,273 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [193754774] [2021-12-14 16:20:42,273 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [193754774] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-14 16:20:42,273 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1070087404] [2021-12-14 16:20:42,274 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 16:20:42,274 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-14 16:20:42,274 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-14 16:20:42,275 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) [2021-12-14 16:20:42,280 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2021-12-14 16:20:42,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 16:20:42,354 INFO L263 TraceCheckSpWp]: Trace formula consists of 577 conjuncts, 2 conjunts are in the unsatisfiable core [2021-12-14 16:20:42,356 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-14 16:20:42,545 INFO L134 CoverageAnalysis]: Checked inductivity of 101 backedges. 83 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2021-12-14 16:20:42,545 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-14 16:20:42,545 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1070087404] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-14 16:20:42,545 INFO L186 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2021-12-14 16:20:42,545 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [7] total 8 [2021-12-14 16:20:42,546 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1514813467] [2021-12-14 16:20:42,546 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-14 16:20:42,546 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-12-14 16:20:42,546 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-14 16:20:42,547 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-12-14 16:20:42,547 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2021-12-14 16:20:42,547 INFO L87 Difference]: Start difference. First operand 24035 states and 31260 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) [2021-12-14 16:20:43,528 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-14 16:20:43,528 INFO L93 Difference]: Finished difference Result 45362 states and 60517 transitions. [2021-12-14 16:20:43,529 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-12-14 16:20:43,529 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 [2021-12-14 16:20:43,529 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-14 16:20:43,605 INFO L225 Difference]: With dead ends: 45362 [2021-12-14 16:20:43,605 INFO L226 Difference]: Without dead ends: 25789 [2021-12-14 16:20:43,644 INFO L932 BasicCegarLoop]: 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 [2021-12-14 16:20:43,645 INFO L933 BasicCegarLoop]: 333 mSDtfsCounter, 285 mSDsluCounter, 32 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 285 SdHoareTripleChecker+Valid, 365 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 [2021-12-14 16:20:43,645 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [285 Valid, 365 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-14 16:20:43,663 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25789 states. [2021-12-14 16:20:44,811 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25789 to 25491. [2021-12-14 16:20:44,833 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 25491 states, 21337 states have (on average 1.239349486806955) internal successors, (26444), 21764 states have internal predecessors, (26444), 2061 states have call successors, (2061), 1538 states have call predecessors, (2061), 2091 states have return successors, (3687), 2198 states have call predecessors, (3687), 2057 states have call successors, (3687) [2021-12-14 16:20:44,883 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25491 states to 25491 states and 32192 transitions. [2021-12-14 16:20:44,887 INFO L78 Accepts]: Start accepts. Automaton has 25491 states and 32192 transitions. Word has length 163 [2021-12-14 16:20:44,888 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-14 16:20:44,888 INFO L470 AbstractCegarLoop]: Abstraction has 25491 states and 32192 transitions. [2021-12-14 16:20:44,888 INFO L471 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) [2021-12-14 16:20:44,888 INFO L276 IsEmpty]: Start isEmpty. Operand 25491 states and 32192 transitions. [2021-12-14 16:20:44,903 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 166 [2021-12-14 16:20:44,903 INFO L506 BasicCegarLoop]: Found error trace [2021-12-14 16:20:44,903 INFO L514 BasicCegarLoop]: 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] [2021-12-14 16:20:44,920 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Ended with exit code 0 [2021-12-14 16:20:45,104 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable26 [2021-12-14 16:20:45,104 INFO L402 AbstractCegarLoop]: === Iteration 28 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-14 16:20:45,105 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 16:20:45,105 INFO L85 PathProgramCache]: Analyzing trace with hash 1192837573, now seen corresponding path program 1 times [2021-12-14 16:20:45,105 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-14 16:20:45,105 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [479897596] [2021-12-14 16:20:45,105 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 16:20:45,105 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-14 16:20:45,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 16:20:45,122 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2021-12-14 16:20:45,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 16:20:45,129 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2021-12-14 16:20:45,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 16:20:45,135 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2021-12-14 16:20:45,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 16:20:45,162 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2021-12-14 16:20:45,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 16:20:45,164 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2021-12-14 16:20:45,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 16:20:45,166 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2021-12-14 16:20:45,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 16:20:45,167 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2021-12-14 16:20:45,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 16:20:45,170 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-12-14 16:20:45,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 16:20:45,172 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 120 [2021-12-14 16:20:45,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 16:20:45,174 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-12-14 16:20:45,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 16:20:45,177 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 150 [2021-12-14 16:20:45,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 16:20:45,178 INFO L134 CoverageAnalysis]: Checked inductivity of 104 backedges. 0 proven. 22 refuted. 0 times theorem prover too weak. 82 trivial. 0 not checked. [2021-12-14 16:20:45,179 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-14 16:20:45,179 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [479897596] [2021-12-14 16:20:45,179 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [479897596] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-14 16:20:45,179 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2008240295] [2021-12-14 16:20:45,179 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 16:20:45,179 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-14 16:20:45,179 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-14 16:20:45,180 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) [2021-12-14 16:20:45,182 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2021-12-14 16:20:45,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 16:20:45,270 INFO L263 TraceCheckSpWp]: Trace formula consists of 572 conjuncts, 6 conjunts are in the unsatisfiable core [2021-12-14 16:20:45,272 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-14 16:20:45,493 INFO L134 CoverageAnalysis]: Checked inductivity of 104 backedges. 39 proven. 0 refuted. 0 times theorem prover too weak. 65 trivial. 0 not checked. [2021-12-14 16:20:45,493 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-14 16:20:45,493 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2008240295] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-14 16:20:45,493 INFO L186 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2021-12-14 16:20:45,493 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [7] total 10 [2021-12-14 16:20:45,493 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [648943717] [2021-12-14 16:20:45,493 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-14 16:20:45,494 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-12-14 16:20:45,494 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-14 16:20:45,494 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-12-14 16:20:45,494 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2021-12-14 16:20:45,494 INFO L87 Difference]: Start difference. First operand 25491 states and 32192 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) [2021-12-14 16:20:46,739 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-14 16:20:46,739 INFO L93 Difference]: Finished difference Result 43914 states and 56841 transitions. [2021-12-14 16:20:46,739 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-12-14 16:20:46,740 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 [2021-12-14 16:20:46,740 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-14 16:20:46,805 INFO L225 Difference]: With dead ends: 43914 [2021-12-14 16:20:46,805 INFO L226 Difference]: Without dead ends: 23955 [2021-12-14 16:20:46,841 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 194 GetRequests, 184 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=26, Invalid=106, Unknown=0, NotChecked=0, Total=132 [2021-12-14 16:20:46,842 INFO L933 BasicCegarLoop]: 318 mSDtfsCounter, 408 mSDsluCounter, 314 mSDsCounter, 0 mSdLazyCounter, 289 mSolverCounterSat, 51 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 429 SdHoareTripleChecker+Valid, 632 SdHoareTripleChecker+Invalid, 340 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 51 IncrementalHoareTripleChecker+Valid, 289 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2021-12-14 16:20:46,842 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [429 Valid, 632 Invalid, 340 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [51 Valid, 289 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2021-12-14 16:20:46,861 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23955 states. [2021-12-14 16:20:47,896 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23955 to 21620. [2021-12-14 16:20:47,916 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 21620 states, 18066 states have (on average 1.2082918188863057) internal successors, (21829), 18420 states have internal predecessors, (21829), 1761 states have call successors, (1761), 1318 states have call predecessors, (1761), 1791 states have return successors, (3025), 1887 states have call predecessors, (3025), 1757 states have call successors, (3025) [2021-12-14 16:20:47,954 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21620 states to 21620 states and 26615 transitions. [2021-12-14 16:20:47,959 INFO L78 Accepts]: Start accepts. Automaton has 21620 states and 26615 transitions. Word has length 165 [2021-12-14 16:20:47,959 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-14 16:20:47,959 INFO L470 AbstractCegarLoop]: Abstraction has 21620 states and 26615 transitions. [2021-12-14 16:20:47,959 INFO L471 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) [2021-12-14 16:20:47,959 INFO L276 IsEmpty]: Start isEmpty. Operand 21620 states and 26615 transitions. [2021-12-14 16:20:47,970 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 166 [2021-12-14 16:20:47,970 INFO L506 BasicCegarLoop]: Found error trace [2021-12-14 16:20:47,970 INFO L514 BasicCegarLoop]: 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] [2021-12-14 16:20:47,988 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Ended with exit code 0 [2021-12-14 16:20:48,183 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable27 [2021-12-14 16:20:48,184 INFO L402 AbstractCegarLoop]: === Iteration 29 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-14 16:20:48,184 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 16:20:48,184 INFO L85 PathProgramCache]: Analyzing trace with hash -649638141, now seen corresponding path program 1 times [2021-12-14 16:20:48,184 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-14 16:20:48,184 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1978683577] [2021-12-14 16:20:48,184 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 16:20:48,184 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-14 16:20:48,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 16:20:48,197 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2021-12-14 16:20:48,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 16:20:48,205 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2021-12-14 16:20:48,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 16:20:48,215 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2021-12-14 16:20:48,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 16:20:48,246 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2021-12-14 16:20:48,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 16:20:48,249 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2021-12-14 16:20:48,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 16:20:48,250 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2021-12-14 16:20:48,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 16:20:48,252 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2021-12-14 16:20:48,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 16:20:48,255 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-12-14 16:20:48,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 16:20:48,257 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 120 [2021-12-14 16:20:48,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 16:20:48,260 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-12-14 16:20:48,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 16:20:48,262 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 150 [2021-12-14 16:20:48,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 16:20:48,264 INFO L134 CoverageAnalysis]: Checked inductivity of 104 backedges. 0 proven. 22 refuted. 0 times theorem prover too weak. 82 trivial. 0 not checked. [2021-12-14 16:20:48,264 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-14 16:20:48,264 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1978683577] [2021-12-14 16:20:48,264 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1978683577] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-14 16:20:48,265 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1298740694] [2021-12-14 16:20:48,265 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 16:20:48,265 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-14 16:20:48,265 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-14 16:20:48,266 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) [2021-12-14 16:20:48,267 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2021-12-14 16:20:48,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 16:20:48,344 INFO L263 TraceCheckSpWp]: Trace formula consists of 569 conjuncts, 6 conjunts are in the unsatisfiable core [2021-12-14 16:20:48,346 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-14 16:20:48,550 INFO L134 CoverageAnalysis]: Checked inductivity of 104 backedges. 39 proven. 0 refuted. 0 times theorem prover too weak. 65 trivial. 0 not checked. [2021-12-14 16:20:48,550 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-14 16:20:48,550 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1298740694] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-14 16:20:48,550 INFO L186 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2021-12-14 16:20:48,550 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [7] total 10 [2021-12-14 16:20:48,550 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1761332649] [2021-12-14 16:20:48,551 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-14 16:20:48,551 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-12-14 16:20:48,551 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-14 16:20:48,551 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-12-14 16:20:48,551 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2021-12-14 16:20:48,551 INFO L87 Difference]: Start difference. First operand 21620 states and 26615 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) [2021-12-14 16:20:49,613 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-14 16:20:49,613 INFO L93 Difference]: Finished difference Result 38782 states and 48165 transitions. [2021-12-14 16:20:49,614 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-12-14 16:20:49,614 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 [2021-12-14 16:20:49,614 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-14 16:20:49,668 INFO L225 Difference]: With dead ends: 38782 [2021-12-14 16:20:49,668 INFO L226 Difference]: Without dead ends: 21620 [2021-12-14 16:20:49,697 INFO L932 BasicCegarLoop]: 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 [2021-12-14 16:20:49,698 INFO L933 BasicCegarLoop]: 295 mSDtfsCounter, 371 mSDsluCounter, 309 mSDsCounter, 0 mSdLazyCounter, 227 mSolverCounterSat, 47 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 392 SdHoareTripleChecker+Valid, 604 SdHoareTripleChecker+Invalid, 274 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 47 IncrementalHoareTripleChecker+Valid, 227 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2021-12-14 16:20:49,698 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [392 Valid, 604 Invalid, 274 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [47 Valid, 227 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2021-12-14 16:20:49,713 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21620 states. [2021-12-14 16:20:51,008 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21620 to 21620. [2021-12-14 16:20:51,026 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 21620 states, 18066 states have (on average 1.1862614856636777) internal successors, (21431), 18420 states have internal predecessors, (21431), 1761 states have call successors, (1761), 1318 states have call predecessors, (1761), 1791 states have return successors, (3025), 1887 states have call predecessors, (3025), 1757 states have call successors, (3025) [2021-12-14 16:20:51,062 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21620 states to 21620 states and 26217 transitions. [2021-12-14 16:20:51,065 INFO L78 Accepts]: Start accepts. Automaton has 21620 states and 26217 transitions. Word has length 165 [2021-12-14 16:20:51,065 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-14 16:20:51,066 INFO L470 AbstractCegarLoop]: Abstraction has 21620 states and 26217 transitions. [2021-12-14 16:20:51,066 INFO L471 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) [2021-12-14 16:20:51,066 INFO L276 IsEmpty]: Start isEmpty. Operand 21620 states and 26217 transitions. [2021-12-14 16:20:51,076 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 166 [2021-12-14 16:20:51,076 INFO L506 BasicCegarLoop]: Found error trace [2021-12-14 16:20:51,076 INFO L514 BasicCegarLoop]: 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] [2021-12-14 16:20:51,097 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Forceful destruction successful, exit code 0 [2021-12-14 16:20:51,277 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable28 [2021-12-14 16:20:51,277 INFO L402 AbstractCegarLoop]: === Iteration 30 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-14 16:20:51,277 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 16:20:51,277 INFO L85 PathProgramCache]: Analyzing trace with hash -1742273343, now seen corresponding path program 1 times [2021-12-14 16:20:51,277 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-14 16:20:51,278 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1978933065] [2021-12-14 16:20:51,278 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 16:20:51,278 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-14 16:20:51,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 16:20:51,294 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2021-12-14 16:20:51,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 16:20:51,302 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2021-12-14 16:20:51,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 16:20:51,319 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2021-12-14 16:20:51,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 16:20:51,345 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2021-12-14 16:20:51,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 16:20:51,349 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2021-12-14 16:20:51,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 16:20:51,351 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2021-12-14 16:20:51,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 16:20:51,353 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2021-12-14 16:20:51,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 16:20:51,355 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-12-14 16:20:51,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 16:20:51,358 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 120 [2021-12-14 16:20:51,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 16:20:51,360 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-12-14 16:20:51,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 16:20:51,363 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 150 [2021-12-14 16:20:51,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 16:20:51,365 INFO L134 CoverageAnalysis]: Checked inductivity of 104 backedges. 0 proven. 22 refuted. 0 times theorem prover too weak. 82 trivial. 0 not checked. [2021-12-14 16:20:51,365 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-14 16:20:51,365 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1978933065] [2021-12-14 16:20:51,365 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1978933065] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-14 16:20:51,365 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [351308179] [2021-12-14 16:20:51,365 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 16:20:51,365 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-14 16:20:51,366 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-14 16:20:51,366 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) [2021-12-14 16:20:51,367 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2021-12-14 16:20:51,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 16:20:51,454 INFO L263 TraceCheckSpWp]: Trace formula consists of 566 conjuncts, 7 conjunts are in the unsatisfiable core [2021-12-14 16:20:51,456 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-14 16:20:51,654 INFO L134 CoverageAnalysis]: Checked inductivity of 104 backedges. 23 proven. 0 refuted. 0 times theorem prover too weak. 81 trivial. 0 not checked. [2021-12-14 16:20:51,654 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-14 16:20:51,654 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [351308179] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-14 16:20:51,654 INFO L186 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2021-12-14 16:20:51,654 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [7] total 7 [2021-12-14 16:20:51,654 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1228775655] [2021-12-14 16:20:51,654 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-14 16:20:51,654 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-12-14 16:20:51,655 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-14 16:20:51,655 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-12-14 16:20:51,655 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2021-12-14 16:20:51,655 INFO L87 Difference]: Start difference. First operand 21620 states and 26217 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) [2021-12-14 16:20:52,614 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-14 16:20:52,615 INFO L93 Difference]: Finished difference Result 38636 states and 47608 transitions. [2021-12-14 16:20:52,615 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-12-14 16:20:52,615 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 [2021-12-14 16:20:52,616 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-14 16:20:52,665 INFO L225 Difference]: With dead ends: 38636 [2021-12-14 16:20:52,665 INFO L226 Difference]: Without dead ends: 21476 [2021-12-14 16:20:52,694 INFO L932 BasicCegarLoop]: 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 [2021-12-14 16:20:52,695 INFO L933 BasicCegarLoop]: 325 mSDtfsCounter, 49 mSDsluCounter, 989 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 49 SdHoareTripleChecker+Valid, 1314 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 [2021-12-14 16:20:52,695 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [49 Valid, 1314 Invalid, 14 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-14 16:20:52,709 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21476 states. [2021-12-14 16:20:53,746 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21476 to 20980. [2021-12-14 16:20:53,761 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20980 states, 17451 states have (on average 1.171394189444731) internal successors, (20442), 17788 states have internal predecessors, (20442), 1761 states have call successors, (1761), 1318 states have call predecessors, (1761), 1766 states have return successors, (2879), 1879 states have call predecessors, (2879), 1757 states have call successors, (2879) [2021-12-14 16:20:53,793 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20980 states to 20980 states and 25082 transitions. [2021-12-14 16:20:53,796 INFO L78 Accepts]: Start accepts. Automaton has 20980 states and 25082 transitions. Word has length 165 [2021-12-14 16:20:53,796 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-14 16:20:53,796 INFO L470 AbstractCegarLoop]: Abstraction has 20980 states and 25082 transitions. [2021-12-14 16:20:53,796 INFO L471 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) [2021-12-14 16:20:53,797 INFO L276 IsEmpty]: Start isEmpty. Operand 20980 states and 25082 transitions. [2021-12-14 16:20:53,806 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 166 [2021-12-14 16:20:53,806 INFO L506 BasicCegarLoop]: Found error trace [2021-12-14 16:20:53,806 INFO L514 BasicCegarLoop]: 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] [2021-12-14 16:20:53,828 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Forceful destruction successful, exit code 0 [2021-12-14 16:20:54,007 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29,14 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-14 16:20:54,007 INFO L402 AbstractCegarLoop]: === Iteration 31 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-14 16:20:54,007 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 16:20:54,008 INFO L85 PathProgramCache]: Analyzing trace with hash -1910661765, now seen corresponding path program 1 times [2021-12-14 16:20:54,008 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-14 16:20:54,008 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [677494987] [2021-12-14 16:20:54,008 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 16:20:54,008 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-14 16:20:54,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 16:20:54,028 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2021-12-14 16:20:54,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 16:20:54,037 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2021-12-14 16:20:54,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 16:20:54,044 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2021-12-14 16:20:54,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 16:20:54,071 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2021-12-14 16:20:54,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 16:20:54,073 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2021-12-14 16:20:54,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 16:20:54,075 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2021-12-14 16:20:54,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 16:20:54,077 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2021-12-14 16:20:54,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 16:20:54,079 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-12-14 16:20:54,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 16:20:54,081 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 120 [2021-12-14 16:20:54,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 16:20:54,084 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-12-14 16:20:54,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 16:20:54,086 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 150 [2021-12-14 16:20:54,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 16:20:54,089 INFO L134 CoverageAnalysis]: Checked inductivity of 104 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 94 trivial. 0 not checked. [2021-12-14 16:20:54,089 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-14 16:20:54,089 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [677494987] [2021-12-14 16:20:54,089 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [677494987] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-14 16:20:54,089 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [136173972] [2021-12-14 16:20:54,089 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 16:20:54,089 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-14 16:20:54,090 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-14 16:20:54,090 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) [2021-12-14 16:20:54,091 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Waiting until timeout for monitored process [2021-12-14 16:20:54,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 16:20:54,176 INFO L263 TraceCheckSpWp]: Trace formula consists of 563 conjuncts, 7 conjunts are in the unsatisfiable core [2021-12-14 16:20:54,178 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-14 16:20:54,383 INFO L134 CoverageAnalysis]: Checked inductivity of 104 backedges. 35 proven. 0 refuted. 0 times theorem prover too weak. 69 trivial. 0 not checked. [2021-12-14 16:20:54,383 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-14 16:20:54,383 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [136173972] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-14 16:20:54,383 INFO L186 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2021-12-14 16:20:54,383 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [7] total 7 [2021-12-14 16:20:54,383 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1252086471] [2021-12-14 16:20:54,383 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-14 16:20:54,384 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-12-14 16:20:54,384 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-14 16:20:54,384 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-12-14 16:20:54,384 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2021-12-14 16:20:54,384 INFO L87 Difference]: Start difference. First operand 20980 states and 25082 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) [2021-12-14 16:20:55,219 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-14 16:20:55,219 INFO L93 Difference]: Finished difference Result 31947 states and 38555 transitions. [2021-12-14 16:20:55,219 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-12-14 16:20:55,219 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 [2021-12-14 16:20:55,220 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-14 16:20:55,260 INFO L225 Difference]: With dead ends: 31947 [2021-12-14 16:20:55,260 INFO L226 Difference]: Without dead ends: 15424 [2021-12-14 16:20:55,288 INFO L932 BasicCegarLoop]: 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 [2021-12-14 16:20:55,290 INFO L933 BasicCegarLoop]: 325 mSDtfsCounter, 10 mSDsluCounter, 974 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 1299 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 [2021-12-14 16:20:55,290 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [10 Valid, 1299 Invalid, 14 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-14 16:20:55,301 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15424 states. [2021-12-14 16:20:56,020 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15424 to 15360. [2021-12-14 16:20:56,034 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15360 states, 12785 states have (on average 1.164958936253422) internal successors, (14894), 12966 states have internal predecessors, (14894), 1321 states have call successors, (1321), 987 states have call predecessors, (1321), 1252 states have return successors, (1898), 1410 states have call predecessors, (1898), 1317 states have call successors, (1898) [2021-12-14 16:20:56,065 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15360 states to 15360 states and 18113 transitions. [2021-12-14 16:20:56,069 INFO L78 Accepts]: Start accepts. Automaton has 15360 states and 18113 transitions. Word has length 165 [2021-12-14 16:20:56,069 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-14 16:20:56,069 INFO L470 AbstractCegarLoop]: Abstraction has 15360 states and 18113 transitions. [2021-12-14 16:20:56,069 INFO L471 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) [2021-12-14 16:20:56,069 INFO L276 IsEmpty]: Start isEmpty. Operand 15360 states and 18113 transitions. [2021-12-14 16:20:56,078 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 196 [2021-12-14 16:20:56,078 INFO L506 BasicCegarLoop]: Found error trace [2021-12-14 16:20:56,078 INFO L514 BasicCegarLoop]: trace histogram [5, 5, 5, 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, 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] [2021-12-14 16:20:56,095 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Forceful destruction successful, exit code 0 [2021-12-14 16:20:56,291 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30,15 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-14 16:20:56,291 INFO L402 AbstractCegarLoop]: === Iteration 32 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-14 16:20:56,292 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 16:20:56,292 INFO L85 PathProgramCache]: Analyzing trace with hash -1582737387, now seen corresponding path program 1 times [2021-12-14 16:20:56,292 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-14 16:20:56,292 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [279748167] [2021-12-14 16:20:56,292 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 16:20:56,292 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-14 16:20:56,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 16:20:56,328 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2021-12-14 16:20:56,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 16:20:56,335 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2021-12-14 16:20:56,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 16:20:56,341 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2021-12-14 16:20:56,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 16:20:56,348 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-14 16:20:56,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 16:20:56,351 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2021-12-14 16:20:56,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 16:20:56,353 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2021-12-14 16:20:56,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 16:20:56,354 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2021-12-14 16:20:56,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 16:20:56,355 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2021-12-14 16:20:56,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 16:20:56,386 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2021-12-14 16:20:56,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 16:20:56,389 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2021-12-14 16:20:56,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 16:20:56,390 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2021-12-14 16:20:56,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 16:20:56,394 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-14 16:20:56,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 16:20:56,396 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2021-12-14 16:20:56,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 16:20:56,397 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2021-12-14 16:20:56,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 16:20:56,399 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2021-12-14 16:20:56,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 16:20:56,403 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 127 [2021-12-14 16:20:56,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 16:20:56,408 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-14 16:20:56,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 16:20:56,409 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-12-14 16:20:56,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 16:20:56,411 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 155 [2021-12-14 16:20:56,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 16:20:56,413 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 169 [2021-12-14 16:20:56,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 16:20:56,417 INFO L134 CoverageAnalysis]: Checked inductivity of 150 backedges. 23 proven. 9 refuted. 0 times theorem prover too weak. 118 trivial. 0 not checked. [2021-12-14 16:20:56,417 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-14 16:20:56,417 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [279748167] [2021-12-14 16:20:56,417 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [279748167] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-14 16:20:56,418 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [226481191] [2021-12-14 16:20:56,418 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 16:20:56,418 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-14 16:20:56,418 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-14 16:20:56,445 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) [2021-12-14 16:20:56,446 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Waiting until timeout for monitored process [2021-12-14 16:20:56,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 16:20:56,530 INFO L263 TraceCheckSpWp]: Trace formula consists of 604 conjuncts, 2 conjunts are in the unsatisfiable core [2021-12-14 16:20:56,533 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-14 16:20:56,775 INFO L134 CoverageAnalysis]: Checked inductivity of 150 backedges. 48 proven. 0 refuted. 0 times theorem prover too weak. 102 trivial. 0 not checked. [2021-12-14 16:20:56,775 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-14 16:20:56,775 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [226481191] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-14 16:20:56,775 INFO L186 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2021-12-14 16:20:56,775 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [10] total 11 [2021-12-14 16:20:56,775 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1431639939] [2021-12-14 16:20:56,775 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-14 16:20:56,776 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-12-14 16:20:56,776 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-14 16:20:56,776 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-12-14 16:20:56,776 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=90, Unknown=0, NotChecked=0, Total=110 [2021-12-14 16:20:56,776 INFO L87 Difference]: Start difference. First operand 15360 states and 18113 transitions. Second operand has 3 states, 3 states have (on average 33.333333333333336) internal successors, (100), 3 states have internal predecessors, (100), 2 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2021-12-14 16:20:57,646 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-14 16:20:57,646 INFO L93 Difference]: Finished difference Result 24228 states and 28851 transitions. [2021-12-14 16:20:57,647 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-12-14 16:20:57,647 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 33.333333333333336) internal successors, (100), 3 states have internal predecessors, (100), 2 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) Word has length 195 [2021-12-14 16:20:57,647 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-14 16:20:57,695 INFO L225 Difference]: With dead ends: 24228 [2021-12-14 16:20:57,695 INFO L226 Difference]: Without dead ends: 19794 [2021-12-14 16:20:57,711 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 241 GetRequests, 232 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=20, Invalid=90, Unknown=0, NotChecked=0, Total=110 [2021-12-14 16:20:57,711 INFO L933 BasicCegarLoop]: 336 mSDtfsCounter, 52 mSDsluCounter, 309 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 52 SdHoareTripleChecker+Valid, 645 SdHoareTripleChecker+Invalid, 5 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-14 16:20:57,712 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [52 Valid, 645 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-14 16:20:57,725 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19794 states. [2021-12-14 16:20:58,615 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19794 to 19784. [2021-12-14 16:20:58,631 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19784 states, 16222 states have (on average 1.17186536801874) internal successors, (19010), 16463 states have internal predecessors, (19010), 1821 states have call successors, (1821), 1351 states have call predecessors, (1821), 1739 states have return successors, (2591), 1973 states have call predecessors, (2591), 1817 states have call successors, (2591) [2021-12-14 16:20:58,663 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19784 states to 19784 states and 23422 transitions. [2021-12-14 16:20:58,667 INFO L78 Accepts]: Start accepts. Automaton has 19784 states and 23422 transitions. Word has length 195 [2021-12-14 16:20:58,667 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-14 16:20:58,667 INFO L470 AbstractCegarLoop]: Abstraction has 19784 states and 23422 transitions. [2021-12-14 16:20:58,667 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 33.333333333333336) internal successors, (100), 3 states have internal predecessors, (100), 2 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2021-12-14 16:20:58,668 INFO L276 IsEmpty]: Start isEmpty. Operand 19784 states and 23422 transitions. [2021-12-14 16:20:58,676 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 196 [2021-12-14 16:20:58,677 INFO L506 BasicCegarLoop]: Found error trace [2021-12-14 16:20:58,677 INFO L514 BasicCegarLoop]: trace histogram [5, 5, 5, 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, 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] [2021-12-14 16:20:58,698 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Forceful destruction successful, exit code 0 [2021-12-14 16:20:58,878 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31,16 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-14 16:20:58,878 INFO L402 AbstractCegarLoop]: === Iteration 33 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-14 16:20:58,879 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 16:20:58,879 INFO L85 PathProgramCache]: Analyzing trace with hash 1814836631, now seen corresponding path program 1 times [2021-12-14 16:20:58,879 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-14 16:20:58,879 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [826252682] [2021-12-14 16:20:58,879 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 16:20:58,879 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-14 16:20:58,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 16:20:58,910 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2021-12-14 16:20:58,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 16:20:58,916 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2021-12-14 16:20:58,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 16:20:58,925 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2021-12-14 16:20:58,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 16:20:58,928 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-14 16:20:58,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 16:20:58,929 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2021-12-14 16:20:58,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 16:20:58,930 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2021-12-14 16:20:58,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 16:20:58,932 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2021-12-14 16:20:58,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 16:20:58,933 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2021-12-14 16:20:58,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 16:20:58,947 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2021-12-14 16:20:58,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 16:20:58,949 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2021-12-14 16:20:58,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 16:20:58,951 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2021-12-14 16:20:58,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 16:20:58,953 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-14 16:20:58,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 16:20:58,955 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2021-12-14 16:20:58,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 16:20:58,957 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2021-12-14 16:20:58,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 16:20:58,958 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2021-12-14 16:20:58,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 16:20:58,960 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 127 [2021-12-14 16:20:58,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 16:20:58,962 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-14 16:20:58,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 16:20:58,963 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-12-14 16:20:58,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 16:20:58,965 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 155 [2021-12-14 16:20:58,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 16:20:58,966 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 169 [2021-12-14 16:20:58,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 16:20:58,968 INFO L134 CoverageAnalysis]: Checked inductivity of 150 backedges. 23 proven. 9 refuted. 0 times theorem prover too weak. 118 trivial. 0 not checked. [2021-12-14 16:20:58,968 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-14 16:20:58,968 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [826252682] [2021-12-14 16:20:58,968 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [826252682] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-14 16:20:58,968 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [939080655] [2021-12-14 16:20:58,968 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 16:20:58,968 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-14 16:20:58,968 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-14 16:20:58,971 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) [2021-12-14 16:20:58,973 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Waiting until timeout for monitored process [2021-12-14 16:20:59,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 16:20:59,058 INFO L263 TraceCheckSpWp]: Trace formula consists of 601 conjuncts, 2 conjunts are in the unsatisfiable core [2021-12-14 16:20:59,060 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-14 16:20:59,339 INFO L134 CoverageAnalysis]: Checked inductivity of 150 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 150 trivial. 0 not checked. [2021-12-14 16:20:59,340 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-14 16:20:59,340 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [939080655] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-14 16:20:59,340 INFO L186 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2021-12-14 16:20:59,340 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [10] total 11 [2021-12-14 16:20:59,340 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1052916957] [2021-12-14 16:20:59,340 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-14 16:20:59,340 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-12-14 16:20:59,341 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-14 16:20:59,341 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-12-14 16:20:59,341 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=90, Unknown=0, NotChecked=0, Total=110 [2021-12-14 16:20:59,341 INFO L87 Difference]: Start difference. First operand 19784 states and 23422 transitions. Second operand has 3 states, 3 states have (on average 28.333333333333332) internal successors, (85), 3 states have internal predecessors, (85), 2 states have call successors, (15), 2 states have call predecessors, (15), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2021-12-14 16:21:00,323 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-14 16:21:00,323 INFO L93 Difference]: Finished difference Result 26314 states and 31662 transitions. [2021-12-14 16:21:00,323 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-12-14 16:21:00,323 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 28.333333333333332) internal successors, (85), 3 states have internal predecessors, (85), 2 states have call successors, (15), 2 states have call predecessors, (15), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) Word has length 195 [2021-12-14 16:21:00,324 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-14 16:21:00,341 INFO L225 Difference]: With dead ends: 26314 [2021-12-14 16:21:00,341 INFO L226 Difference]: Without dead ends: 10915 [2021-12-14 16:21:00,355 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 241 GetRequests, 232 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=20, Invalid=90, Unknown=0, NotChecked=0, Total=110 [2021-12-14 16:21:00,356 INFO L933 BasicCegarLoop]: 311 mSDtfsCounter, 207 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 207 SdHoareTripleChecker+Valid, 311 SdHoareTripleChecker+Invalid, 5 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-14 16:21:00,356 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [207 Valid, 311 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-14 16:21:00,361 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10915 states. [2021-12-14 16:21:00,868 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10915 to 10915. [2021-12-14 16:21:00,877 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10915 states, 9336 states have (on average 1.1476006855184233) internal successors, (10714), 9454 states have internal predecessors, (10714), 813 states have call successors, (813), 622 states have call predecessors, (813), 765 states have return successors, (1198), 840 states have call predecessors, (1198), 811 states have call successors, (1198) [2021-12-14 16:21:00,894 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10915 states to 10915 states and 12725 transitions. [2021-12-14 16:21:00,896 INFO L78 Accepts]: Start accepts. Automaton has 10915 states and 12725 transitions. Word has length 195 [2021-12-14 16:21:00,896 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-14 16:21:00,897 INFO L470 AbstractCegarLoop]: Abstraction has 10915 states and 12725 transitions. [2021-12-14 16:21:00,897 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 28.333333333333332) internal successors, (85), 3 states have internal predecessors, (85), 2 states have call successors, (15), 2 states have call predecessors, (15), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2021-12-14 16:21:00,897 INFO L276 IsEmpty]: Start isEmpty. Operand 10915 states and 12725 transitions. [2021-12-14 16:21:00,904 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 201 [2021-12-14 16:21:00,904 INFO L506 BasicCegarLoop]: Found error trace [2021-12-14 16:21:00,904 INFO L514 BasicCegarLoop]: 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] [2021-12-14 16:21:00,920 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Forceful destruction successful, exit code 0 [2021-12-14 16:21:01,104 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable32 [2021-12-14 16:21:01,105 INFO L402 AbstractCegarLoop]: === Iteration 34 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-14 16:21:01,106 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 16:21:01,106 INFO L85 PathProgramCache]: Analyzing trace with hash -55403990, now seen corresponding path program 1 times [2021-12-14 16:21:01,106 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-14 16:21:01,106 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [723409467] [2021-12-14 16:21:01,106 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 16:21:01,106 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-14 16:21:01,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 16:21:01,132 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2021-12-14 16:21:01,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 16:21:01,140 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2021-12-14 16:21:01,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 16:21:01,146 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2021-12-14 16:21:01,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 16:21:01,149 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2021-12-14 16:21:01,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 16:21:01,154 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2021-12-14 16:21:01,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 16:21:01,155 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2021-12-14 16:21:01,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 16:21:01,157 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-12-14 16:21:01,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 16:21:01,167 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2021-12-14 16:21:01,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 16:21:01,173 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 121 [2021-12-14 16:21:01,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 16:21:01,177 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-12-14 16:21:01,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 16:21:01,182 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 155 [2021-12-14 16:21:01,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 16:21:01,186 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-12-14 16:21:01,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 16:21:01,188 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 185 [2021-12-14 16:21:01,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 16:21:01,190 INFO L134 CoverageAnalysis]: Checked inductivity of 169 backedges. 29 proven. 3 refuted. 0 times theorem prover too weak. 137 trivial. 0 not checked. [2021-12-14 16:21:01,190 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-14 16:21:01,190 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [723409467] [2021-12-14 16:21:01,190 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [723409467] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-14 16:21:01,190 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1709180109] [2021-12-14 16:21:01,190 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 16:21:01,191 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-14 16:21:01,191 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-14 16:21:01,192 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) [2021-12-14 16:21:01,193 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Waiting until timeout for monitored process [2021-12-14 16:21:01,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 16:21:01,285 INFO L263 TraceCheckSpWp]: Trace formula consists of 649 conjuncts, 2 conjunts are in the unsatisfiable core [2021-12-14 16:21:01,287 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-14 16:21:01,484 INFO L134 CoverageAnalysis]: Checked inductivity of 169 backedges. 120 proven. 0 refuted. 0 times theorem prover too weak. 49 trivial. 0 not checked. [2021-12-14 16:21:01,485 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-14 16:21:01,485 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1709180109] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-14 16:21:01,485 INFO L186 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2021-12-14 16:21:01,485 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [7] total 8 [2021-12-14 16:21:01,485 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [506537514] [2021-12-14 16:21:01,485 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-14 16:21:01,485 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-12-14 16:21:01,485 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-14 16:21:01,486 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-12-14 16:21:01,486 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2021-12-14 16:21:01,486 INFO L87 Difference]: Start difference. First operand 10915 states and 12725 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) [2021-12-14 16:21:01,746 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-14 16:21:01,746 INFO L93 Difference]: Finished difference Result 14334 states and 16689 transitions. [2021-12-14 16:21:01,746 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-12-14 16:21:01,746 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 [2021-12-14 16:21:01,747 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-14 16:21:01,753 INFO L225 Difference]: With dead ends: 14334 [2021-12-14 16:21:01,753 INFO L226 Difference]: Without dead ends: 3083 [2021-12-14 16:21:01,765 INFO L932 BasicCegarLoop]: 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 [2021-12-14 16:21:01,765 INFO L933 BasicCegarLoop]: 277 mSDtfsCounter, 138 mSDsluCounter, 149 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 138 SdHoareTripleChecker+Valid, 426 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 [2021-12-14 16:21:01,766 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [138 Valid, 426 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-14 16:21:01,767 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3083 states. [2021-12-14 16:21:01,896 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3083 to 3083. [2021-12-14 16:21:01,899 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3083 states, 2619 states have (on average 1.1263841160748378) internal successors, (2950), 2643 states have internal predecessors, (2950), 260 states have call successors, (260), 187 states have call predecessors, (260), 203 states have return successors, (295), 254 states have call predecessors, (295), 258 states have call successors, (295) [2021-12-14 16:21:01,902 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3083 states to 3083 states and 3505 transitions. [2021-12-14 16:21:01,903 INFO L78 Accepts]: Start accepts. Automaton has 3083 states and 3505 transitions. Word has length 200 [2021-12-14 16:21:01,903 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-14 16:21:01,903 INFO L470 AbstractCegarLoop]: Abstraction has 3083 states and 3505 transitions. [2021-12-14 16:21:01,903 INFO L471 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) [2021-12-14 16:21:01,903 INFO L276 IsEmpty]: Start isEmpty. Operand 3083 states and 3505 transitions. [2021-12-14 16:21:01,906 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 202 [2021-12-14 16:21:01,906 INFO L506 BasicCegarLoop]: Found error trace [2021-12-14 16:21:01,906 INFO L514 BasicCegarLoop]: 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] [2021-12-14 16:21:01,923 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Forceful destruction successful, exit code 0 [2021-12-14 16:21:02,106 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33,18 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-14 16:21:02,107 INFO L402 AbstractCegarLoop]: === Iteration 35 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-14 16:21:02,107 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 16:21:02,107 INFO L85 PathProgramCache]: Analyzing trace with hash 135104874, now seen corresponding path program 1 times [2021-12-14 16:21:02,107 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-14 16:21:02,107 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2144831082] [2021-12-14 16:21:02,108 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 16:21:02,108 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-14 16:21:02,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 16:21:02,136 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2021-12-14 16:21:02,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 16:21:02,144 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2021-12-14 16:21:02,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 16:21:02,151 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2021-12-14 16:21:02,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 16:21:02,154 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2021-12-14 16:21:02,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 16:21:02,156 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2021-12-14 16:21:02,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 16:21:02,157 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2021-12-14 16:21:02,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 16:21:02,158 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2021-12-14 16:21:02,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 16:21:02,163 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-12-14 16:21:02,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 16:21:02,176 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2021-12-14 16:21:02,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 16:21:02,188 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-12-14 16:21:02,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 16:21:02,193 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 156 [2021-12-14 16:21:02,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 16:21:02,203 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-12-14 16:21:02,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 16:21:02,206 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 186 [2021-12-14 16:21:02,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 16:21:02,209 INFO L134 CoverageAnalysis]: Checked inductivity of 170 backedges. 53 proven. 41 refuted. 0 times theorem prover too weak. 76 trivial. 0 not checked. [2021-12-14 16:21:02,209 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-14 16:21:02,209 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2144831082] [2021-12-14 16:21:02,209 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2144831082] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-14 16:21:02,209 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1980616509] [2021-12-14 16:21:02,210 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 16:21:02,210 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-14 16:21:02,210 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-14 16:21:02,212 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) [2021-12-14 16:21:02,247 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Waiting until timeout for monitored process [2021-12-14 16:21:02,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 16:21:02,327 INFO L263 TraceCheckSpWp]: Trace formula consists of 661 conjuncts, 3 conjunts are in the unsatisfiable core [2021-12-14 16:21:02,329 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-14 16:21:02,611 INFO L134 CoverageAnalysis]: Checked inductivity of 170 backedges. 147 proven. 0 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2021-12-14 16:21:02,611 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-14 16:21:02,612 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1980616509] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-14 16:21:02,612 INFO L186 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2021-12-14 16:21:02,612 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [6] total 6 [2021-12-14 16:21:02,612 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [442399976] [2021-12-14 16:21:02,612 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-14 16:21:02,612 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-12-14 16:21:02,612 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-14 16:21:02,613 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-12-14 16:21:02,613 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-12-14 16:21:02,613 INFO L87 Difference]: Start difference. First operand 3083 states and 3505 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) [2021-12-14 16:21:02,752 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-14 16:21:02,752 INFO L93 Difference]: Finished difference Result 5467 states and 6252 transitions. [2021-12-14 16:21:02,752 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-12-14 16:21:02,752 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 [2021-12-14 16:21:02,752 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-14 16:21:02,757 INFO L225 Difference]: With dead ends: 5467 [2021-12-14 16:21:02,758 INFO L226 Difference]: Without dead ends: 3083 [2021-12-14 16:21:02,760 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 231 GetRequests, 227 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-12-14 16:21:02,761 INFO L933 BasicCegarLoop]: 259 mSDtfsCounter, 106 mSDsluCounter, 120 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 106 SdHoareTripleChecker+Valid, 379 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 [2021-12-14 16:21:02,761 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [106 Valid, 379 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-14 16:21:02,762 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3083 states. [2021-12-14 16:21:02,897 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3083 to 3083. [2021-12-14 16:21:02,899 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3083 states, 2619 states have (on average 1.1156930126002291) internal successors, (2922), 2643 states have internal predecessors, (2922), 260 states have call successors, (260), 187 states have call predecessors, (260), 203 states have return successors, (295), 254 states have call predecessors, (295), 258 states have call successors, (295) [2021-12-14 16:21:02,902 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3083 states to 3083 states and 3477 transitions. [2021-12-14 16:21:02,903 INFO L78 Accepts]: Start accepts. Automaton has 3083 states and 3477 transitions. Word has length 201 [2021-12-14 16:21:02,903 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-14 16:21:02,903 INFO L470 AbstractCegarLoop]: Abstraction has 3083 states and 3477 transitions. [2021-12-14 16:21:02,903 INFO L471 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) [2021-12-14 16:21:02,903 INFO L276 IsEmpty]: Start isEmpty. Operand 3083 states and 3477 transitions. [2021-12-14 16:21:02,906 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 204 [2021-12-14 16:21:02,906 INFO L506 BasicCegarLoop]: Found error trace [2021-12-14 16:21:02,906 INFO L514 BasicCegarLoop]: 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] [2021-12-14 16:21:02,922 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Forceful destruction successful, exit code 0 [2021-12-14 16:21:03,106 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable34,19 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-14 16:21:03,107 INFO L402 AbstractCegarLoop]: === Iteration 36 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-14 16:21:03,107 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 16:21:03,107 INFO L85 PathProgramCache]: Analyzing trace with hash 171826558, now seen corresponding path program 1 times [2021-12-14 16:21:03,107 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-14 16:21:03,107 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [858063761] [2021-12-14 16:21:03,107 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 16:21:03,107 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-14 16:21:03,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 16:21:03,152 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2021-12-14 16:21:03,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 16:21:03,163 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2021-12-14 16:21:03,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 16:21:03,172 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2021-12-14 16:21:03,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 16:21:03,175 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2021-12-14 16:21:03,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 16:21:03,179 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2021-12-14 16:21:03,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 16:21:03,180 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2021-12-14 16:21:03,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 16:21:03,182 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2021-12-14 16:21:03,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 16:21:03,186 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-12-14 16:21:03,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 16:21:03,188 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2021-12-14 16:21:03,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 16:21:03,192 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-12-14 16:21:03,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 16:21:03,195 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 157 [2021-12-14 16:21:03,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 16:21:03,203 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-12-14 16:21:03,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 16:21:03,212 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 188 [2021-12-14 16:21:03,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 16:21:03,215 INFO L134 CoverageAnalysis]: Checked inductivity of 173 backedges. 25 proven. 0 refuted. 0 times theorem prover too weak. 148 trivial. 0 not checked. [2021-12-14 16:21:03,215 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-14 16:21:03,215 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [858063761] [2021-12-14 16:21:03,215 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [858063761] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-14 16:21:03,215 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-14 16:21:03,215 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-12-14 16:21:03,215 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [78548382] [2021-12-14 16:21:03,215 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-14 16:21:03,216 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2021-12-14 16:21:03,216 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-14 16:21:03,216 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-12-14 16:21:03,216 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2021-12-14 16:21:03,216 INFO L87 Difference]: Start difference. First operand 3083 states and 3477 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) [2021-12-14 16:21:03,982 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-14 16:21:03,982 INFO L93 Difference]: Finished difference Result 3489 states and 3916 transitions. [2021-12-14 16:21:03,982 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2021-12-14 16:21:03,982 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 [2021-12-14 16:21:03,983 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-14 16:21:03,988 INFO L225 Difference]: With dead ends: 3489 [2021-12-14 16:21:03,988 INFO L226 Difference]: Without dead ends: 3486 [2021-12-14 16:21:03,989 INFO L932 BasicCegarLoop]: 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 [2021-12-14 16:21:03,989 INFO L933 BasicCegarLoop]: 333 mSDtfsCounter, 688 mSDsluCounter, 598 mSDsCounter, 0 mSdLazyCounter, 781 mSolverCounterSat, 95 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 721 SdHoareTripleChecker+Valid, 931 SdHoareTripleChecker+Invalid, 876 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 95 IncrementalHoareTripleChecker+Valid, 781 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2021-12-14 16:21:03,989 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [721 Valid, 931 Invalid, 876 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [95 Valid, 781 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2021-12-14 16:21:03,991 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3486 states. [2021-12-14 16:21:04,134 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3486 to 3247. [2021-12-14 16:21:04,136 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3247 states, 2758 states have (on average 1.1153009427121103) internal successors, (3076), 2782 states have internal predecessors, (3076), 274 states have call successors, (274), 197 states have call predecessors, (274), 214 states have return successors, (311), 269 states have call predecessors, (311), 273 states have call successors, (311) [2021-12-14 16:21:04,139 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3247 states to 3247 states and 3661 transitions. [2021-12-14 16:21:04,140 INFO L78 Accepts]: Start accepts. Automaton has 3247 states and 3661 transitions. Word has length 203 [2021-12-14 16:21:04,140 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-14 16:21:04,140 INFO L470 AbstractCegarLoop]: Abstraction has 3247 states and 3661 transitions. [2021-12-14 16:21:04,140 INFO L471 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) [2021-12-14 16:21:04,140 INFO L276 IsEmpty]: Start isEmpty. Operand 3247 states and 3661 transitions. [2021-12-14 16:21:04,143 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 208 [2021-12-14 16:21:04,143 INFO L506 BasicCegarLoop]: Found error trace [2021-12-14 16:21:04,143 INFO L514 BasicCegarLoop]: 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] [2021-12-14 16:21:04,143 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable35 [2021-12-14 16:21:04,143 INFO L402 AbstractCegarLoop]: === Iteration 37 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-14 16:21:04,144 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 16:21:04,144 INFO L85 PathProgramCache]: Analyzing trace with hash -190863834, now seen corresponding path program 1 times [2021-12-14 16:21:04,144 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-14 16:21:04,144 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [692374261] [2021-12-14 16:21:04,144 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 16:21:04,144 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-14 16:21:04,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 16:21:04,164 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2021-12-14 16:21:04,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 16:21:04,171 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2021-12-14 16:21:04,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 16:21:04,177 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2021-12-14 16:21:04,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 16:21:04,179 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2021-12-14 16:21:04,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 16:21:04,180 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2021-12-14 16:21:04,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 16:21:04,182 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2021-12-14 16:21:04,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 16:21:04,183 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2021-12-14 16:21:04,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 16:21:04,185 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-12-14 16:21:04,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 16:21:04,187 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2021-12-14 16:21:04,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 16:21:04,189 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-12-14 16:21:04,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 16:21:04,191 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 157 [2021-12-14 16:21:04,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 16:21:04,193 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-12-14 16:21:04,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 16:21:04,195 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 188 [2021-12-14 16:21:04,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 16:21:04,196 INFO L134 CoverageAnalysis]: Checked inductivity of 173 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 173 trivial. 0 not checked. [2021-12-14 16:21:04,196 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-14 16:21:04,196 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [692374261] [2021-12-14 16:21:04,197 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [692374261] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-14 16:21:04,197 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-14 16:21:04,197 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-12-14 16:21:04,197 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1439087756] [2021-12-14 16:21:04,197 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-14 16:21:04,197 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-12-14 16:21:04,197 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-14 16:21:04,197 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-12-14 16:21:04,198 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-12-14 16:21:04,198 INFO L87 Difference]: Start difference. First operand 3247 states and 3661 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) [2021-12-14 16:21:04,548 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-14 16:21:04,548 INFO L93 Difference]: Finished difference Result 5308 states and 6094 transitions. [2021-12-14 16:21:04,548 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-12-14 16:21:04,548 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 [2021-12-14 16:21:04,548 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-14 16:21:04,556 INFO L225 Difference]: With dead ends: 5308 [2021-12-14 16:21:04,556 INFO L226 Difference]: Without dead ends: 3920 [2021-12-14 16:21:04,558 INFO L932 BasicCegarLoop]: 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 [2021-12-14 16:21:04,559 INFO L933 BasicCegarLoop]: 234 mSDtfsCounter, 197 mSDsluCounter, 358 mSDsCounter, 0 mSdLazyCounter, 250 mSolverCounterSat, 33 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 210 SdHoareTripleChecker+Valid, 592 SdHoareTripleChecker+Invalid, 283 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 33 IncrementalHoareTripleChecker+Valid, 250 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2021-12-14 16:21:04,559 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [210 Valid, 592 Invalid, 283 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [33 Valid, 250 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2021-12-14 16:21:04,561 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3920 states. [2021-12-14 16:21:04,716 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3920 to 3250. [2021-12-14 16:21:04,719 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3250 states, 2761 states have (on average 1.115175660992394) internal successors, (3079), 2785 states have internal predecessors, (3079), 274 states have call successors, (274), 197 states have call predecessors, (274), 214 states have return successors, (311), 269 states have call predecessors, (311), 273 states have call successors, (311) [2021-12-14 16:21:04,723 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3250 states to 3250 states and 3664 transitions. [2021-12-14 16:21:04,723 INFO L78 Accepts]: Start accepts. Automaton has 3250 states and 3664 transitions. Word has length 207 [2021-12-14 16:21:04,724 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-14 16:21:04,724 INFO L470 AbstractCegarLoop]: Abstraction has 3250 states and 3664 transitions. [2021-12-14 16:21:04,724 INFO L471 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) [2021-12-14 16:21:04,724 INFO L276 IsEmpty]: Start isEmpty. Operand 3250 states and 3664 transitions. [2021-12-14 16:21:04,727 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 209 [2021-12-14 16:21:04,727 INFO L506 BasicCegarLoop]: Found error trace [2021-12-14 16:21:04,727 INFO L514 BasicCegarLoop]: 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] [2021-12-14 16:21:04,727 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable36 [2021-12-14 16:21:04,727 INFO L402 AbstractCegarLoop]: === Iteration 38 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-14 16:21:04,727 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 16:21:04,727 INFO L85 PathProgramCache]: Analyzing trace with hash -392769361, now seen corresponding path program 1 times [2021-12-14 16:21:04,727 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-14 16:21:04,727 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1300350927] [2021-12-14 16:21:04,728 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 16:21:04,728 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-14 16:21:04,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-14 16:21:04,738 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-12-14 16:21:04,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-14 16:21:04,807 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-12-14 16:21:04,807 INFO L628 BasicCegarLoop]: Counterexample is feasible [2021-12-14 16:21:04,809 INFO L764 garLoopResultBuilder]: Registering result UNSAFE for location error2Err0ASSERT_VIOLATIONERROR_FUNCTION (1 of 2 remaining) [2021-12-14 16:21:04,810 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location error1Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 2 remaining) [2021-12-14 16:21:04,810 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable37 [2021-12-14 16:21:04,813 INFO L732 BasicCegarLoop]: Path program 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] [2021-12-14 16:21:04,816 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2021-12-14 16:21:04,961 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 14.12 04:21:04 BoogieIcfgContainer [2021-12-14 16:21:04,961 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2021-12-14 16:21:04,962 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2021-12-14 16:21:04,962 INFO L271 PluginConnector]: Initializing Witness Printer... [2021-12-14 16:21:04,962 INFO L275 PluginConnector]: Witness Printer initialized [2021-12-14 16:21:04,963 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.12 04:20:06" (3/4) ... [2021-12-14 16:21:04,964 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2021-12-14 16:21:05,084 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2021-12-14 16:21:05,084 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2021-12-14 16:21:05,085 INFO L158 Benchmark]: Toolchain (without parser) took 60060.24ms. Allocated memory was 92.3MB in the beginning and 5.1GB in the end (delta: 5.0GB). Free memory was 63.8MB in the beginning and 2.2GB in the end (delta: -2.2GB). Peak memory consumption was 2.9GB. Max. memory is 16.1GB. [2021-12-14 16:21:05,085 INFO L158 Benchmark]: CDTParser took 0.19ms. Allocated memory is still 92.3MB. Free memory was 51.5MB in the beginning and 51.5MB in the end (delta: 43.6kB). There was no memory consumed. Max. memory is 16.1GB. [2021-12-14 16:21:05,085 INFO L158 Benchmark]: CACSL2BoogieTranslator took 299.67ms. Allocated memory is still 92.3MB. Free memory was 63.5MB in the beginning and 63.2MB in the end (delta: 335.5kB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2021-12-14 16:21:05,085 INFO L158 Benchmark]: Boogie Procedure Inliner took 56.74ms. Allocated memory is still 92.3MB. Free memory was 63.2MB in the beginning and 60.4MB in the end (delta: 2.8MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2021-12-14 16:21:05,085 INFO L158 Benchmark]: Boogie Preprocessor took 39.68ms. Allocated memory is still 92.3MB. Free memory was 60.4MB in the beginning and 57.9MB in the end (delta: 2.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2021-12-14 16:21:05,085 INFO L158 Benchmark]: RCFGBuilder took 624.43ms. Allocated memory was 92.3MB in the beginning and 119.5MB in the end (delta: 27.3MB). Free memory was 57.9MB in the beginning and 86.1MB in the end (delta: -28.2MB). Peak memory consumption was 22.3MB. Max. memory is 16.1GB. [2021-12-14 16:21:05,085 INFO L158 Benchmark]: TraceAbstraction took 58910.02ms. Allocated memory was 119.5MB in the beginning and 5.1GB in the end (delta: 5.0GB). Free memory was 85.5MB in the beginning and 2.3GB in the end (delta: -2.2GB). Peak memory consumption was 2.8GB. Max. memory is 16.1GB. [2021-12-14 16:21:05,086 INFO L158 Benchmark]: Witness Printer took 122.49ms. Allocated memory is still 5.1GB. Free memory was 2.3GB in the beginning and 2.2GB in the end (delta: 38.8MB). Peak memory consumption was 39.8MB. Max. memory is 16.1GB. [2021-12-14 16:21:05,086 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 92.3MB. Free memory was 51.5MB in the beginning and 51.5MB in the end (delta: 43.6kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 299.67ms. Allocated memory is still 92.3MB. Free memory was 63.5MB in the beginning and 63.2MB in the end (delta: 335.5kB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 56.74ms. Allocated memory is still 92.3MB. Free memory was 63.2MB in the beginning and 60.4MB in the end (delta: 2.8MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 39.68ms. Allocated memory is still 92.3MB. Free memory was 60.4MB in the beginning and 57.9MB in the end (delta: 2.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 624.43ms. Allocated memory was 92.3MB in the beginning and 119.5MB in the end (delta: 27.3MB). Free memory was 57.9MB in the beginning and 86.1MB in the end (delta: -28.2MB). Peak memory consumption was 22.3MB. Max. memory is 16.1GB. * TraceAbstraction took 58910.02ms. Allocated memory was 119.5MB in the beginning and 5.1GB in the end (delta: 5.0GB). Free memory was 85.5MB in the beginning and 2.3GB in the end (delta: -2.2GB). Peak memory consumption was 2.8GB. Max. memory is 16.1GB. * Witness Printer took 122.49ms. Allocated memory is still 5.1GB. Free memory was 2.3GB in the beginning and 2.2GB in the end (delta: 38.8MB). Peak memory consumption was 39.8MB. 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: 599]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L32] int fast_clk_edge ; [L33] int slow_clk_edge ; [L34] int q_buf_0 ; [L35] int q_free ; [L36] int q_read_ev ; [L37] int q_write_ev ; [L38] int q_req_up ; [L39] int q_ev ; [L60] int p_num_write ; [L61] int p_last_write ; [L62] int p_dw_st ; [L63] int p_dw_pc ; [L64] int p_dw_i ; [L65] int c_num_read ; [L66] int c_last_read ; [L67] int c_dr_st ; [L68] int c_dr_pc ; [L69] int c_dr_i ; [L202] static int a_t ; [L352] static int t = 0; [L603] int m_pc = 0; [L604] int t1_pc = 0; [L605] int t2_pc = 0; [L606] int m_st ; [L607] int t1_st ; [L608] int t2_st ; [L609] int m_i ; [L610] int t1_i ; [L611] int t2_i ; [L612] int M_E = 2; [L613] int T1_E = 2; [L614] int T2_E = 2; [L615] int E_M = 2; [L616] int E_1 = 2; [L617] int E_2 = 2; [L622] int token ; [L624] 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, fast_clk_edge=0, 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, slow_clk_edge=0, t=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] [L1202] COND FALSE !(__VERIFIER_nondet_int()) [L1205] CALL main2() [L1189] int __retres1 ; [L1193] CALL init_model2() [L1103] m_i = 1 [L1104] t1_i = 1 [L1105] 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, fast_clk_edge=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, slow_clk_edge=0, t=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] [L1193] RET init_model2() [L1194] CALL start_simulation2() [L1130] int kernel_st ; [L1131] int tmp ; [L1132] int tmp___0 ; [L1136] 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, fast_clk_edge=0, 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, slow_clk_edge=0, t=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] [L1137] 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, fast_clk_edge=0, 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, slow_clk_edge=0, t=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] [L1138] CALL init_threads2() [L822] COND TRUE m_i == 1 [L823] 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, fast_clk_edge=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, slow_clk_edge=0, t=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] [L827] COND TRUE t1_i == 1 [L828] 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, fast_clk_edge=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, slow_clk_edge=0, t=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 TRUE t2_i == 1 [L833] 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, fast_clk_edge=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, slow_clk_edge=0, t=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] [L1138] RET init_threads2() [L1139] 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, fast_clk_edge=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, slow_clk_edge=0, t=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] [L935] 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, fast_clk_edge=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, slow_clk_edge=0, t=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] [L940] 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, fast_clk_edge=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, slow_clk_edge=0, t=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] [L945] 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, fast_clk_edge=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, slow_clk_edge=0, t=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] [L950] 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, fast_clk_edge=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, slow_clk_edge=0, t=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] [L955] 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, fast_clk_edge=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, slow_clk_edge=0, t=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] [L960] 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, fast_clk_edge=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, slow_clk_edge=0, t=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] [L1139] 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, fast_clk_edge=0, 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, slow_clk_edge=0, t=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] [L1140] 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, fast_clk_edge=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, slow_clk_edge=0, t=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] [L1008] int tmp ; [L1009] int tmp___0 ; [L1010] int tmp___1 ; [L1014] CALL, EXPR is_master_triggered() [L754] 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, fast_clk_edge=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, slow_clk_edge=0, t=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] [L757] 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, fast_clk_edge=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, slow_clk_edge=0, t=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] [L767] __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, fast_clk_edge=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, slow_clk_edge=0, t=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] 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, fast_clk_edge=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, slow_clk_edge=0, t=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] [L1014] RET, EXPR is_master_triggered() [L1014] tmp = is_master_triggered() [L1016] 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, fast_clk_edge=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, slow_clk_edge=0, t=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] [L1022] CALL, EXPR is_transmit1_triggered() [L773] 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, fast_clk_edge=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, slow_clk_edge=0, t=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] [L776] 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, fast_clk_edge=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, slow_clk_edge=0, t=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] [L786] __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, fast_clk_edge=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, slow_clk_edge=0, t=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] [L788] 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, fast_clk_edge=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, slow_clk_edge=0, t=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] [L1022] RET, EXPR is_transmit1_triggered() [L1022] tmp___0 = is_transmit1_triggered() [L1024] 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, fast_clk_edge=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, slow_clk_edge=0, t=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] [L1030] CALL, EXPR is_transmit2_triggered() [L792] 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, fast_clk_edge=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, slow_clk_edge=0, t=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] [L795] 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, fast_clk_edge=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, slow_clk_edge=0, t=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] [L805] __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, fast_clk_edge=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, slow_clk_edge=0, t=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] [L807] 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, fast_clk_edge=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, slow_clk_edge=0, t=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] [L1030] RET, EXPR is_transmit2_triggered() [L1030] tmp___1 = is_transmit2_triggered() [L1032] 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, fast_clk_edge=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, slow_clk_edge=0, t=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] [L1140] 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, fast_clk_edge=0, 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, slow_clk_edge=0, t=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] [L1141] 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, fast_clk_edge=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, slow_clk_edge=0, t=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] [L973] 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, fast_clk_edge=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, slow_clk_edge=0, t=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] [L978] 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, fast_clk_edge=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, slow_clk_edge=0, t=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] [L983] 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, fast_clk_edge=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, slow_clk_edge=0, t=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] [L988] 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, fast_clk_edge=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, slow_clk_edge=0, t=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] [L993] 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, fast_clk_edge=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, slow_clk_edge=0, t=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] [L998] 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, fast_clk_edge=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, slow_clk_edge=0, t=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] [L1141] 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, fast_clk_edge=0, 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, slow_clk_edge=0, t=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] [L1144] 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, fast_clk_edge=0, 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, slow_clk_edge=0, t=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] [L1147] kernel_st = 1 [L1148] CALL eval2() [L868] 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, fast_clk_edge=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, slow_clk_edge=0, t=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] [L872] 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, fast_clk_edge=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, slow_clk_edge=0, t=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] 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, fast_clk_edge=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, slow_clk_edge=0, t=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] 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, fast_clk_edge=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, slow_clk_edge=0, t=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] [L845] COND TRUE m_st == 0 [L846] __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, fast_clk_edge=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, slow_clk_edge=0, t=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] [L863] 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, fast_clk_edge=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, slow_clk_edge=0, t=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] 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, fast_clk_edge=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, slow_clk_edge=0, t=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] tmp = exists_runnable_thread2() [L877] 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, fast_clk_edge=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, slow_clk_edge=0, t=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] [L882] COND TRUE m_st == 0 [L883] int tmp_ndt_1; [L884] tmp_ndt_1 = __VERIFIER_nondet_int() [L885] 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, fast_clk_edge=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, slow_clk_edge=0, t=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] [L896] COND TRUE t1_st == 0 [L897] int tmp_ndt_2; [L898] tmp_ndt_2 = __VERIFIER_nondet_int() [L899] COND TRUE \read(tmp_ndt_2) [L901] t1_st = 1 [L902] CALL transmit1() [L685] 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, fast_clk_edge=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, slow_clk_edge=0, t=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] [L696] 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, fast_clk_edge=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, slow_clk_edge=0, t=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] [L698] t1_pc = 1 [L699] 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, fast_clk_edge=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, slow_clk_edge=0, t=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] [L902] RET transmit1() [L910] COND TRUE t2_st == 0 [L911] int tmp_ndt_3; [L912] tmp_ndt_3 = __VERIFIER_nondet_int() [L913] COND TRUE \read(tmp_ndt_3) [L915] t2_st = 1 [L916] CALL transmit2() [L721] 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, fast_clk_edge=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, slow_clk_edge=0, t=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] [L732] 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, fast_clk_edge=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, slow_clk_edge=0, t=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] [L734] t2_pc = 1 [L735] 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, fast_clk_edge=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, slow_clk_edge=0, t=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] [L916] RET transmit2() [L872] 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, fast_clk_edge=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, slow_clk_edge=0, t=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] [L875] 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, fast_clk_edge=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, slow_clk_edge=0, t=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] [L842] 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, fast_clk_edge=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, slow_clk_edge=0, t=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] [L845] COND TRUE m_st == 0 [L846] __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, fast_clk_edge=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, slow_clk_edge=0, t=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] [L863] 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, fast_clk_edge=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, slow_clk_edge=0, t=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] [L875] 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, fast_clk_edge=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, slow_clk_edge=0, t=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] [L875] tmp = exists_runnable_thread2() [L877] 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, fast_clk_edge=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, slow_clk_edge=0, t=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] [L882] COND TRUE m_st == 0 [L883] int tmp_ndt_1; [L884] tmp_ndt_1 = __VERIFIER_nondet_int() [L885] COND TRUE \read(tmp_ndt_1) [L887] m_st = 1 [L888] CALL master() [L627] int tmp_var = __VERIFIER_nondet_int(); [L629] 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, fast_clk_edge=0, 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, slow_clk_edge=0, t=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] [L640] 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, fast_clk_edge=0, 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, slow_clk_edge=0, t=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] [L643] token = __VERIFIER_nondet_int() [L644] local = token [L645] 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, fast_clk_edge=0, 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, slow_clk_edge=0, t=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] [L646] 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, fast_clk_edge=0, 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, slow_clk_edge=0, t=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] [L1046] 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, fast_clk_edge=0, 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, slow_clk_edge=0, t=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] [L1008] int tmp ; [L1009] int tmp___0 ; [L1010] int tmp___1 ; [L1014] CALL, EXPR is_master_triggered() [L754] 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, fast_clk_edge=0, 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, slow_clk_edge=0, t=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] [L757] 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, fast_clk_edge=0, 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, slow_clk_edge=0, t=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] [L767] __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, fast_clk_edge=0, 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, slow_clk_edge=0, t=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] [L769] 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, fast_clk_edge=0, 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, slow_clk_edge=0, t=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] [L1014] RET, EXPR is_master_triggered() [L1014] tmp = is_master_triggered() [L1016] 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, fast_clk_edge=0, 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, slow_clk_edge=0, t=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] [L1022] CALL, EXPR is_transmit1_triggered() [L773] 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, fast_clk_edge=0, 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, slow_clk_edge=0, t=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] [L776] 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, fast_clk_edge=0, 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, slow_clk_edge=0, t=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] [L777] COND TRUE E_1 == 1 [L778] __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, fast_clk_edge=0, 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, slow_clk_edge=0, t=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] [L788] 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, fast_clk_edge=0, 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, slow_clk_edge=0, t=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] [L1022] RET, EXPR is_transmit1_triggered() [L1022] tmp___0 = is_transmit1_triggered() [L1024] COND TRUE \read(tmp___0) [L1025] 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, fast_clk_edge=0, 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, slow_clk_edge=0, t=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] [L1030] CALL, EXPR is_transmit2_triggered() [L792] 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, fast_clk_edge=0, 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, slow_clk_edge=0, t=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] [L795] 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, fast_clk_edge=0, 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, slow_clk_edge=0, t=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] [L796] 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, fast_clk_edge=0, 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, slow_clk_edge=0, t=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] [L805] __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, fast_clk_edge=0, 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, slow_clk_edge=0, t=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] [L807] 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, fast_clk_edge=0, 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, slow_clk_edge=0, t=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] [L1030] RET, EXPR is_transmit2_triggered() [L1030] tmp___1 = is_transmit2_triggered() [L1032] 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, fast_clk_edge=0, 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, slow_clk_edge=0, t=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] [L1046] 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, fast_clk_edge=0, 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, slow_clk_edge=0, t=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] [L646] 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, fast_clk_edge=0, 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, slow_clk_edge=0, t=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] [L647] E_1 = 2 [L648] m_pc = 1 [L649] 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, fast_clk_edge=0, 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, slow_clk_edge=0, t=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] [L888] RET master() [L896] COND TRUE t1_st == 0 [L897] int tmp_ndt_2; [L898] tmp_ndt_2 = __VERIFIER_nondet_int() [L899] COND TRUE \read(tmp_ndt_2) [L901] t1_st = 1 [L902] CALL transmit1() [L685] 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, fast_clk_edge=0, 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, slow_clk_edge=0, t=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] [L688] 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, fast_clk_edge=0, 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, slow_clk_edge=0, t=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] [L704] token += 1 [L705] 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, fast_clk_edge=0, 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, slow_clk_edge=0, t=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] [L706] 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, fast_clk_edge=0, 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, slow_clk_edge=0, t=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] [L1046] 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, fast_clk_edge=0, 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, slow_clk_edge=0, t=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] [L1008] int tmp ; [L1009] int tmp___0 ; [L1010] int tmp___1 ; [L1014] CALL, EXPR is_master_triggered() [L754] 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, fast_clk_edge=0, 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, slow_clk_edge=0, t=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] [L757] 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, fast_clk_edge=0, 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, slow_clk_edge=0, t=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] [L758] 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, fast_clk_edge=0, 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, slow_clk_edge=0, t=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] [L767] __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, fast_clk_edge=0, 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, slow_clk_edge=0, t=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] [L769] 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, fast_clk_edge=0, 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, slow_clk_edge=0, t=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] [L1014] RET, EXPR is_master_triggered() [L1014] tmp = is_master_triggered() [L1016] 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, fast_clk_edge=0, 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, slow_clk_edge=0, t=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] [L1022] CALL, EXPR is_transmit1_triggered() [L773] 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, fast_clk_edge=0, 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, slow_clk_edge=0, t=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] [L776] 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, fast_clk_edge=0, 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, slow_clk_edge=0, t=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] [L777] 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, fast_clk_edge=0, 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, slow_clk_edge=0, t=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] [L786] __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, fast_clk_edge=0, 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, slow_clk_edge=0, t=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] [L788] 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, fast_clk_edge=0, 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, slow_clk_edge=0, t=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] [L1022] RET, EXPR is_transmit1_triggered() [L1022] tmp___0 = is_transmit1_triggered() [L1024] 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, fast_clk_edge=0, 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, slow_clk_edge=0, t=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] [L1030] CALL, EXPR is_transmit2_triggered() [L792] 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, fast_clk_edge=0, 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, slow_clk_edge=0, t=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] [L795] 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, fast_clk_edge=0, 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, slow_clk_edge=0, t=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] [L796] COND TRUE E_2 == 1 [L797] __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, fast_clk_edge=0, 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, slow_clk_edge=0, t=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] [L807] 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, fast_clk_edge=0, 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, slow_clk_edge=0, t=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] [L1030] RET, EXPR is_transmit2_triggered() [L1030] tmp___1 = is_transmit2_triggered() [L1032] COND TRUE \read(tmp___1) [L1033] 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, fast_clk_edge=0, 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, slow_clk_edge=0, t=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] [L1046] 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, fast_clk_edge=0, 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, slow_clk_edge=0, t=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] [L706] 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, fast_clk_edge=0, 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, slow_clk_edge=0, t=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] [L707] 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, fast_clk_edge=0, 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, slow_clk_edge=0, t=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] [L696] 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, fast_clk_edge=0, 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, slow_clk_edge=0, t=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] [L698] t1_pc = 1 [L699] 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, fast_clk_edge=0, 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, slow_clk_edge=0, t=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] [L902] RET transmit1() [L910] COND TRUE t2_st == 0 [L911] int tmp_ndt_3; [L912] tmp_ndt_3 = __VERIFIER_nondet_int() [L913] COND TRUE \read(tmp_ndt_3) [L915] t2_st = 1 [L916] CALL transmit2() [L721] 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, fast_clk_edge=0, 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, slow_clk_edge=0, t=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] [L724] 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, fast_clk_edge=0, 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, slow_clk_edge=0, t=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] [L740] token += 1 [L741] 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, fast_clk_edge=0, 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, slow_clk_edge=0, t=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] [L742] 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, fast_clk_edge=0, 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, slow_clk_edge=0, t=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] [L1046] 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, fast_clk_edge=0, 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, slow_clk_edge=0, t=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] [L1008] int tmp ; [L1009] int tmp___0 ; [L1010] int tmp___1 ; [L1014] CALL, EXPR is_master_triggered() [L754] 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, fast_clk_edge=0, 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, slow_clk_edge=0, t=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] [L757] 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, fast_clk_edge=0, 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, slow_clk_edge=0, t=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] [L758] COND TRUE E_M == 1 [L759] __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, fast_clk_edge=0, 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, slow_clk_edge=0, t=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] [L769] 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, fast_clk_edge=0, 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, slow_clk_edge=0, t=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] [L1014] RET, EXPR is_master_triggered() [L1014] tmp = is_master_triggered() [L1016] COND TRUE \read(tmp) [L1017] 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, fast_clk_edge=0, 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, slow_clk_edge=0, t=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] [L1022] CALL, EXPR is_transmit1_triggered() [L773] 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, fast_clk_edge=0, 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, slow_clk_edge=0, t=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] [L776] 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, fast_clk_edge=0, 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, slow_clk_edge=0, t=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] [L777] 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, fast_clk_edge=0, 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, slow_clk_edge=0, t=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] [L786] __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, fast_clk_edge=0, 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, slow_clk_edge=0, t=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] [L788] 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, fast_clk_edge=0, 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, slow_clk_edge=0, t=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] [L1022] RET, EXPR is_transmit1_triggered() [L1022] tmp___0 = is_transmit1_triggered() [L1024] 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, fast_clk_edge=0, 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, slow_clk_edge=0, t=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] [L1030] CALL, EXPR is_transmit2_triggered() [L792] 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, fast_clk_edge=0, 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, slow_clk_edge=0, t=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] [L795] 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, fast_clk_edge=0, 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, slow_clk_edge=0, t=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] [L796] 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, fast_clk_edge=0, 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, slow_clk_edge=0, t=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] [L805] __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, fast_clk_edge=0, 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, slow_clk_edge=0, t=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] [L807] 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, fast_clk_edge=0, 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, slow_clk_edge=0, t=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] [L1030] RET, EXPR is_transmit2_triggered() [L1030] tmp___1 = is_transmit2_triggered() [L1032] 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, fast_clk_edge=0, 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, slow_clk_edge=0, t=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] [L1046] 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, fast_clk_edge=0, 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, slow_clk_edge=0, t=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] [L742] 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, fast_clk_edge=0, 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, slow_clk_edge=0, t=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] [L743] 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, fast_clk_edge=0, 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, slow_clk_edge=0, t=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] [L732] 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, fast_clk_edge=0, 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, slow_clk_edge=0, t=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] [L734] t2_pc = 1 [L735] 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, fast_clk_edge=0, 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, slow_clk_edge=0, t=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] [L916] RET transmit2() [L872] 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, fast_clk_edge=0, 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, slow_clk_edge=0, t=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=-2, tmp_ndt_2=1, tmp_ndt_3=-3, token=2] [L875] 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, fast_clk_edge=0, 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, slow_clk_edge=0, t=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] [L842] 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, fast_clk_edge=0, 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, slow_clk_edge=0, t=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] [L845] COND TRUE m_st == 0 [L846] __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, fast_clk_edge=0, 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, slow_clk_edge=0, t=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] [L863] 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, fast_clk_edge=0, 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, slow_clk_edge=0, t=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] [L875] 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, fast_clk_edge=0, 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, slow_clk_edge=0, t=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=-2, tmp_ndt_2=1, tmp_ndt_3=-3, token=2] [L875] tmp = exists_runnable_thread2() [L877] 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, fast_clk_edge=0, 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, slow_clk_edge=0, t=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=-2, tmp_ndt_2=1, tmp_ndt_3=-3, token=2] [L882] COND TRUE m_st == 0 [L883] int tmp_ndt_1; [L884] tmp_ndt_1 = __VERIFIER_nondet_int() [L885] COND TRUE \read(tmp_ndt_1) [L887] m_st = 1 [L888] CALL master() [L627] int tmp_var = __VERIFIER_nondet_int(); [L629] 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, fast_clk_edge=0, 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, slow_clk_edge=0, t=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] [L632] 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, fast_clk_edge=0, 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, slow_clk_edge=0, t=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] [L654] 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, fast_clk_edge=0, 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, slow_clk_edge=0, t=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] [L659] 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, fast_clk_edge=0, 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, slow_clk_edge=0, t=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] [L660] 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, fast_clk_edge=0, 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, slow_clk_edge=0, t=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] [L665] 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, fast_clk_edge=0, 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, slow_clk_edge=0, t=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] [L666] 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, fast_clk_edge=0, 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, slow_clk_edge=0, t=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] [L667] 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, fast_clk_edge=0, 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, slow_clk_edge=0, t=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] [L668] 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, fast_clk_edge=0, 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, slow_clk_edge=0, t=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] [L599] 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, fast_clk_edge=0, 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, slow_clk_edge=0, t=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: 27]: 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, 257 locations, 2 error locations. Started 1 CEGAR loops. OverallTime: 58.7s, OverallIterations: 38, TraceHistogramMax: 5, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.3s, AutomataDifference: 28.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, PartialOrderReductionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 19451 SdHoareTripleChecker+Valid, 10.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 19071 mSDsluCounter, 34787 SdHoareTripleChecker+Invalid, 8.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 21321 mSDsCounter, 3925 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 15302 IncrementalHoareTripleChecker+Invalid, 19227 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 3925 mSolverCounterUnsat, 13466 mSDtfsCounter, 15302 mSolverCounterSat, 0.2s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 4189 GetRequests, 3763 SyntacticMatches, 4 SemanticMatches, 422 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1376 ImplicationChecksByTransitivity, 2.8s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=28251occurred in iteration=24, InterpolantAutomatonStates: 342, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 16.7s AutomataMinimizationTime, 37 MinimizatonAttempts, 10789 StatesRemovedByMinimization, 32 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.4s SsaConstructionTime, 1.0s SatisfiabilityAnalysisTime, 6.8s InterpolantComputationTime, 7938 NumberOfCodeBlocks, 7938 NumberOfCodeBlocksAsserted, 56 NumberOfCheckSat, 7675 ConstructedInterpolants, 0 QuantifiedInterpolants, 13666 SizeOfPredicates, 6 NumberOfNonLiveVariables, 10138 ConjunctsInSsa, 58 ConjunctsInUnsatCore, 55 InterpolantComputations, 37 PerfectInterpolantSequences, 4071/4403 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! [2021-12-14 16:21:05,122 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