./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/combinations/pc_sfifo_2.cil-1+token_ring.02.cil-2.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 35987657 Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/combinations/pc_sfifo_2.cil-1+token_ring.02.cil-2.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 4ea93d7c6d06d46004840cc5fcb436c7c307334e6ee754b8ee507b78f644445d --- Real Ultimate output --- This is Ultimate 0.2.2-?-3598765 [2022-07-21 08:05:14,440 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-07-21 08:05:14,443 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-07-21 08:05:14,483 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-07-21 08:05:14,484 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-07-21 08:05:14,485 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-07-21 08:05:14,488 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-07-21 08:05:14,491 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-07-21 08:05:14,492 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-07-21 08:05:14,496 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-07-21 08:05:14,497 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-07-21 08:05:14,501 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-07-21 08:05:14,502 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-07-21 08:05:14,503 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-07-21 08:05:14,504 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-07-21 08:05:14,507 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-07-21 08:05:14,508 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-07-21 08:05:14,509 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-07-21 08:05:14,511 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-07-21 08:05:14,516 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-07-21 08:05:14,517 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-07-21 08:05:14,518 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-07-21 08:05:14,519 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-07-21 08:05:14,520 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-07-21 08:05:14,521 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-07-21 08:05:14,528 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-07-21 08:05:14,528 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-07-21 08:05:14,529 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-07-21 08:05:14,529 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-07-21 08:05:14,530 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-07-21 08:05:14,530 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-07-21 08:05:14,531 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-07-21 08:05:14,532 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-07-21 08:05:14,533 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-07-21 08:05:14,534 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-07-21 08:05:14,535 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-07-21 08:05:14,535 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-07-21 08:05:14,536 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-07-21 08:05:14,536 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-07-21 08:05:14,536 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-07-21 08:05:14,537 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-07-21 08:05:14,538 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-07-21 08:05:14,546 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2022-07-21 08:05:14,578 INFO L113 SettingsManager]: Loading preferences was successful [2022-07-21 08:05:14,578 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-07-21 08:05:14,578 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-07-21 08:05:14,579 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-07-21 08:05:14,579 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-07-21 08:05:14,580 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-07-21 08:05:14,580 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-07-21 08:05:14,580 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-07-21 08:05:14,580 INFO L138 SettingsManager]: * Use SBE=true [2022-07-21 08:05:14,581 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-07-21 08:05:14,581 INFO L138 SettingsManager]: * sizeof long=4 [2022-07-21 08:05:14,582 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-07-21 08:05:14,582 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-07-21 08:05:14,582 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-07-21 08:05:14,582 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-07-21 08:05:14,590 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-07-21 08:05:14,591 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-07-21 08:05:14,591 INFO L138 SettingsManager]: * sizeof long double=12 [2022-07-21 08:05:14,591 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-07-21 08:05:14,591 INFO L138 SettingsManager]: * Use constant arrays=true [2022-07-21 08:05:14,591 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-07-21 08:05:14,592 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-07-21 08:05:14,592 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-07-21 08:05:14,592 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-07-21 08:05:14,592 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-21 08:05:14,593 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-07-21 08:05:14,593 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-07-21 08:05:14,593 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-07-21 08:05:14,593 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-07-21 08:05:14,593 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-07-21 08:05:14,594 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-07-21 08:05:14,594 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-07-21 08:05:14,594 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-07-21 08:05:14,594 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 4ea93d7c6d06d46004840cc5fcb436c7c307334e6ee754b8ee507b78f644445d [2022-07-21 08:05:14,886 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-07-21 08:05:14,904 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-07-21 08:05:14,906 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-07-21 08:05:14,907 INFO L271 PluginConnector]: Initializing CDTParser... [2022-07-21 08:05:14,908 INFO L275 PluginConnector]: CDTParser initialized [2022-07-21 08:05:14,909 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/combinations/pc_sfifo_2.cil-1+token_ring.02.cil-2.c [2022-07-21 08:05:14,964 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0f9acca1b/9c3fb5ef21b44bb0934787b2fde0e4ae/FLAG81d90ef1d [2022-07-21 08:05:15,391 INFO L306 CDTParser]: Found 1 translation units. [2022-07-21 08:05:15,392 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/combinations/pc_sfifo_2.cil-1+token_ring.02.cil-2.c [2022-07-21 08:05:15,407 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0f9acca1b/9c3fb5ef21b44bb0934787b2fde0e4ae/FLAG81d90ef1d [2022-07-21 08:05:15,800 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0f9acca1b/9c3fb5ef21b44bb0934787b2fde0e4ae [2022-07-21 08:05:15,802 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-07-21 08:05:15,803 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-07-21 08:05:15,805 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-07-21 08:05:15,805 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-07-21 08:05:15,807 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-07-21 08:05:15,808 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.07 08:05:15" (1/1) ... [2022-07-21 08:05:15,809 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7a096308 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 08:05:15, skipping insertion in model container [2022-07-21 08:05:15,809 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.07 08:05:15" (1/1) ... [2022-07-21 08:05:15,815 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-07-21 08:05:15,854 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-07-21 08:05:15,959 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/combinations/pc_sfifo_2.cil-1+token_ring.02.cil-2.c[914,927] [2022-07-21 08:05:16,039 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/combinations/pc_sfifo_2.cil-1+token_ring.02.cil-2.c[7115,7128] [2022-07-21 08:05:16,093 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-21 08:05:16,137 INFO L203 MainTranslator]: Completed pre-run [2022-07-21 08:05:16,147 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/combinations/pc_sfifo_2.cil-1+token_ring.02.cil-2.c[914,927] [2022-07-21 08:05:16,174 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/combinations/pc_sfifo_2.cil-1+token_ring.02.cil-2.c[7115,7128] [2022-07-21 08:05:16,195 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-21 08:05:16,212 INFO L208 MainTranslator]: Completed translation [2022-07-21 08:05:16,213 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 08:05:16 WrapperNode [2022-07-21 08:05:16,213 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-07-21 08:05:16,214 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-07-21 08:05:16,214 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-07-21 08:05:16,214 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-07-21 08:05:16,220 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 08:05:16" (1/1) ... [2022-07-21 08:05:16,230 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 08:05:16" (1/1) ... [2022-07-21 08:05:16,266 INFO L137 Inliner]: procedures = 57, calls = 64, calls flagged for inlining = 25, calls inlined = 25, statements flattened = 465 [2022-07-21 08:05:16,267 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-07-21 08:05:16,267 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-07-21 08:05:16,267 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-07-21 08:05:16,268 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-07-21 08:05:16,274 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 08:05:16" (1/1) ... [2022-07-21 08:05:16,274 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 08:05:16" (1/1) ... [2022-07-21 08:05:16,278 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 08:05:16" (1/1) ... [2022-07-21 08:05:16,278 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 08:05:16" (1/1) ... [2022-07-21 08:05:16,286 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 08:05:16" (1/1) ... [2022-07-21 08:05:16,295 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 08:05:16" (1/1) ... [2022-07-21 08:05:16,298 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 08:05:16" (1/1) ... [2022-07-21 08:05:16,302 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-07-21 08:05:16,303 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-07-21 08:05:16,304 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-07-21 08:05:16,304 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-07-21 08:05:16,304 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 08:05:16" (1/1) ... [2022-07-21 08:05:16,311 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-21 08:05:16,323 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-21 08:05:16,335 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-07-21 08:05:16,343 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-07-21 08:05:16,370 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-07-21 08:05:16,370 INFO L130 BoogieDeclarations]: Found specification of procedure immediate_notify [2022-07-21 08:05:16,371 INFO L138 BoogieDeclarations]: Found implementation of procedure immediate_notify [2022-07-21 08:05:16,371 INFO L130 BoogieDeclarations]: Found specification of procedure is_do_write_p_triggered [2022-07-21 08:05:16,371 INFO L138 BoogieDeclarations]: Found implementation of procedure is_do_write_p_triggered [2022-07-21 08:05:16,371 INFO L130 BoogieDeclarations]: Found specification of procedure exists_runnable_thread1 [2022-07-21 08:05:16,371 INFO L138 BoogieDeclarations]: Found implementation of procedure exists_runnable_thread1 [2022-07-21 08:05:16,371 INFO L130 BoogieDeclarations]: Found specification of procedure exists_runnable_thread2 [2022-07-21 08:05:16,372 INFO L138 BoogieDeclarations]: Found implementation of procedure exists_runnable_thread2 [2022-07-21 08:05:16,372 INFO L130 BoogieDeclarations]: Found specification of procedure reset_delta_events1 [2022-07-21 08:05:16,372 INFO L138 BoogieDeclarations]: Found implementation of procedure reset_delta_events1 [2022-07-21 08:05:16,372 INFO L130 BoogieDeclarations]: Found specification of procedure reset_delta_events2 [2022-07-21 08:05:16,372 INFO L138 BoogieDeclarations]: Found implementation of procedure reset_delta_events2 [2022-07-21 08:05:16,373 INFO L130 BoogieDeclarations]: Found specification of procedure activate_threads2 [2022-07-21 08:05:16,373 INFO L138 BoogieDeclarations]: Found implementation of procedure activate_threads2 [2022-07-21 08:05:16,373 INFO L130 BoogieDeclarations]: Found specification of procedure activate_threads1 [2022-07-21 08:05:16,373 INFO L138 BoogieDeclarations]: Found implementation of procedure activate_threads1 [2022-07-21 08:05:16,373 INFO L130 BoogieDeclarations]: Found specification of procedure is_do_read_c_triggered [2022-07-21 08:05:16,373 INFO L138 BoogieDeclarations]: Found implementation of procedure is_do_read_c_triggered [2022-07-21 08:05:16,374 INFO L130 BoogieDeclarations]: Found specification of procedure update_channels1 [2022-07-21 08:05:16,374 INFO L138 BoogieDeclarations]: Found implementation of procedure update_channels1 [2022-07-21 08:05:16,374 INFO L130 BoogieDeclarations]: Found specification of procedure update_channels2 [2022-07-21 08:05:16,374 INFO L138 BoogieDeclarations]: Found implementation of procedure update_channels2 [2022-07-21 08:05:16,374 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-07-21 08:05:16,374 INFO L130 BoogieDeclarations]: Found specification of procedure fire_delta_events2 [2022-07-21 08:05:16,375 INFO L138 BoogieDeclarations]: Found implementation of procedure fire_delta_events2 [2022-07-21 08:05:16,375 INFO L130 BoogieDeclarations]: Found specification of procedure fire_delta_events1 [2022-07-21 08:05:16,375 INFO L138 BoogieDeclarations]: Found implementation of procedure fire_delta_events1 [2022-07-21 08:05:16,375 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-07-21 08:05:16,375 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-07-21 08:05:16,376 INFO L130 BoogieDeclarations]: Found specification of procedure error1 [2022-07-21 08:05:16,376 INFO L138 BoogieDeclarations]: Found implementation of procedure error1 [2022-07-21 08:05:16,376 INFO L130 BoogieDeclarations]: Found specification of procedure error2 [2022-07-21 08:05:16,376 INFO L138 BoogieDeclarations]: Found implementation of procedure error2 [2022-07-21 08:05:16,458 INFO L234 CfgBuilder]: Building ICFG [2022-07-21 08:05:16,460 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-07-21 08:05:16,975 INFO L275 CfgBuilder]: Performing block encoding [2022-07-21 08:05:16,984 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-07-21 08:05:16,984 INFO L299 CfgBuilder]: Removed 9 assume(true) statements. [2022-07-21 08:05:16,986 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.07 08:05:16 BoogieIcfgContainer [2022-07-21 08:05:16,986 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-07-21 08:05:16,988 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-07-21 08:05:16,988 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-07-21 08:05:16,990 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-07-21 08:05:16,990 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 21.07 08:05:15" (1/3) ... [2022-07-21 08:05:16,991 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2fe7b7c9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 21.07 08:05:16, skipping insertion in model container [2022-07-21 08:05:16,991 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 08:05:16" (2/3) ... [2022-07-21 08:05:16,991 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2fe7b7c9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 21.07 08:05:16, skipping insertion in model container [2022-07-21 08:05:16,992 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.07 08:05:16" (3/3) ... [2022-07-21 08:05:16,993 INFO L111 eAbstractionObserver]: Analyzing ICFG pc_sfifo_2.cil-1+token_ring.02.cil-2.c [2022-07-21 08:05:17,004 INFO L201 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-07-21 08:05:17,005 INFO L160 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2022-07-21 08:05:17,052 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-07-21 08:05:17,057 INFO L357 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@398b64f1, mLbeIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@56d65f24 [2022-07-21 08:05:17,057 INFO L358 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2022-07-21 08:05:17,061 INFO L276 IsEmpty]: Start isEmpty. Operand has 241 states, 191 states have (on average 1.5654450261780104) internal successors, (299), 199 states have internal predecessors, (299), 32 states have call successors, (32), 15 states have call predecessors, (32), 15 states have return successors, (32), 30 states have call predecessors, (32), 32 states have call successors, (32) [2022-07-21 08:05:17,079 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2022-07-21 08:05:17,079 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 08:05:17,080 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-21 08:05:17,080 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-21 08:05:17,085 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 08:05:17,085 INFO L85 PathProgramCache]: Analyzing trace with hash -448089429, now seen corresponding path program 1 times [2022-07-21 08:05:17,092 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 08:05:17,093 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1145471154] [2022-07-21 08:05:17,093 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 08:05:17,094 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 08:05:17,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 08:05:17,287 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-07-21 08:05:17,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 08:05:17,319 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-07-21 08:05:17,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 08:05:17,345 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-07-21 08:05:17,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 08:05:17,362 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 08:05:17,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 08:05:17,371 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-21 08:05:17,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 08:05:17,380 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2022-07-21 08:05:17,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 08:05:17,393 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2022-07-21 08:05:17,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 08:05:17,402 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-21 08:05:17,404 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 08:05:17,404 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1145471154] [2022-07-21 08:05:17,405 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1145471154] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-21 08:05:17,405 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-21 08:05:17,405 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-21 08:05:17,406 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [798731558] [2022-07-21 08:05:17,408 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-21 08:05:17,415 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-21 08:05:17,416 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 08:05:17,448 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-21 08:05:17,448 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-07-21 08:05:17,453 INFO L87 Difference]: Start difference. First operand has 241 states, 191 states have (on average 1.5654450261780104) internal successors, (299), 199 states have internal predecessors, (299), 32 states have call successors, (32), 15 states have call predecessors, (32), 15 states have return successors, (32), 30 states have call predecessors, (32), 32 states have call successors, (32) Second operand has 6 states, 6 states have (on average 8.333333333333334) internal successors, (50), 3 states have internal predecessors, (50), 3 states have call successors, (8), 5 states have call predecessors, (8), 1 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2022-07-21 08:05:18,011 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 08:05:18,012 INFO L93 Difference]: Finished difference Result 482 states and 727 transitions. [2022-07-21 08:05:18,013 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-07-21 08:05:18,014 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 8.333333333333334) internal successors, (50), 3 states have internal predecessors, (50), 3 states have call successors, (8), 5 states have call predecessors, (8), 1 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) Word has length 65 [2022-07-21 08:05:18,015 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 08:05:18,033 INFO L225 Difference]: With dead ends: 482 [2022-07-21 08:05:18,033 INFO L226 Difference]: Without dead ends: 248 [2022-07-21 08:05:18,038 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2022-07-21 08:05:18,042 INFO L413 NwaCegarLoop]: 333 mSDtfsCounter, 351 mSDsluCounter, 564 mSDsCounter, 0 mSdLazyCounter, 265 mSolverCounterSat, 82 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 361 SdHoareTripleChecker+Valid, 897 SdHoareTripleChecker+Invalid, 347 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 82 IncrementalHoareTripleChecker+Valid, 265 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-07-21 08:05:18,042 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [361 Valid, 897 Invalid, 347 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [82 Valid, 265 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-07-21 08:05:18,055 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 248 states. [2022-07-21 08:05:18,097 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 248 to 230. [2022-07-21 08:05:18,100 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 230 states, 183 states have (on average 1.46448087431694) internal successors, (268), 188 states have internal predecessors, (268), 32 states have call successors, (32), 15 states have call predecessors, (32), 13 states have return successors, (28), 28 states have call predecessors, (28), 28 states have call successors, (28) [2022-07-21 08:05:18,104 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 230 states to 230 states and 328 transitions. [2022-07-21 08:05:18,105 INFO L78 Accepts]: Start accepts. Automaton has 230 states and 328 transitions. Word has length 65 [2022-07-21 08:05:18,106 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 08:05:18,106 INFO L495 AbstractCegarLoop]: Abstraction has 230 states and 328 transitions. [2022-07-21 08:05:18,106 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 8.333333333333334) internal successors, (50), 3 states have internal predecessors, (50), 3 states have call successors, (8), 5 states have call predecessors, (8), 1 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2022-07-21 08:05:18,106 INFO L276 IsEmpty]: Start isEmpty. Operand 230 states and 328 transitions. [2022-07-21 08:05:18,109 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2022-07-21 08:05:18,109 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 08:05:18,109 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-21 08:05:18,110 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-07-21 08:05:18,110 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-21 08:05:18,111 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 08:05:18,111 INFO L85 PathProgramCache]: Analyzing trace with hash -488764179, now seen corresponding path program 1 times [2022-07-21 08:05:18,111 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 08:05:18,111 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [226018993] [2022-07-21 08:05:18,111 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 08:05:18,112 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 08:05:18,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 08:05:18,217 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-07-21 08:05:18,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 08:05:18,244 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-07-21 08:05:18,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 08:05:18,265 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-07-21 08:05:18,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 08:05:18,288 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 08:05:18,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 08:05:18,290 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-21 08:05:18,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 08:05:18,292 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2022-07-21 08:05:18,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 08:05:18,295 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2022-07-21 08:05:18,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 08:05:18,306 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-21 08:05:18,306 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 08:05:18,306 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [226018993] [2022-07-21 08:05:18,307 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [226018993] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-21 08:05:18,307 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-21 08:05:18,307 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-07-21 08:05:18,307 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [737594415] [2022-07-21 08:05:18,307 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-21 08:05:18,309 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-07-21 08:05:18,309 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 08:05:18,310 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-07-21 08:05:18,314 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2022-07-21 08:05:18,315 INFO L87 Difference]: Start difference. First operand 230 states and 328 transitions. Second operand has 8 states, 8 states have (on average 6.25) internal successors, (50), 5 states have internal predecessors, (50), 3 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2022-07-21 08:05:19,009 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 08:05:19,010 INFO L93 Difference]: Finished difference Result 453 states and 642 transitions. [2022-07-21 08:05:19,010 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-07-21 08:05:19,011 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 6.25) internal successors, (50), 5 states have internal predecessors, (50), 3 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) Word has length 65 [2022-07-21 08:05:19,011 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 08:05:19,017 INFO L225 Difference]: With dead ends: 453 [2022-07-21 08:05:19,017 INFO L226 Difference]: Without dead ends: 365 [2022-07-21 08:05:19,020 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=79, Invalid=193, Unknown=0, NotChecked=0, Total=272 [2022-07-21 08:05:19,021 INFO L413 NwaCegarLoop]: 341 mSDtfsCounter, 592 mSDsluCounter, 627 mSDsCounter, 0 mSdLazyCounter, 582 mSolverCounterSat, 172 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 597 SdHoareTripleChecker+Valid, 968 SdHoareTripleChecker+Invalid, 754 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 172 IncrementalHoareTripleChecker+Valid, 582 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-07-21 08:05:19,022 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [597 Valid, 968 Invalid, 754 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [172 Valid, 582 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-07-21 08:05:19,026 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 365 states. [2022-07-21 08:05:19,082 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 365 to 326. [2022-07-21 08:05:19,083 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 326 states, 259 states have (on average 1.4362934362934363) internal successors, (372), 266 states have internal predecessors, (372), 43 states have call successors, (43), 22 states have call predecessors, (43), 22 states have return successors, (44), 40 states have call predecessors, (44), 39 states have call successors, (44) [2022-07-21 08:05:19,086 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 326 states to 326 states and 459 transitions. [2022-07-21 08:05:19,086 INFO L78 Accepts]: Start accepts. Automaton has 326 states and 459 transitions. Word has length 65 [2022-07-21 08:05:19,087 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 08:05:19,087 INFO L495 AbstractCegarLoop]: Abstraction has 326 states and 459 transitions. [2022-07-21 08:05:19,087 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 6.25) internal successors, (50), 5 states have internal predecessors, (50), 3 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2022-07-21 08:05:19,087 INFO L276 IsEmpty]: Start isEmpty. Operand 326 states and 459 transitions. [2022-07-21 08:05:19,098 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2022-07-21 08:05:19,098 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 08:05:19,099 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-21 08:05:19,099 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-07-21 08:05:19,099 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-21 08:05:19,100 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 08:05:19,100 INFO L85 PathProgramCache]: Analyzing trace with hash 1049575851, now seen corresponding path program 1 times [2022-07-21 08:05:19,100 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 08:05:19,101 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2135271971] [2022-07-21 08:05:19,102 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 08:05:19,102 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 08:05:19,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 08:05:19,163 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-07-21 08:05:19,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 08:05:19,170 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-07-21 08:05:19,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 08:05:19,182 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-07-21 08:05:19,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 08:05:19,241 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 08:05:19,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 08:05:19,269 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-21 08:05:19,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 08:05:19,273 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2022-07-21 08:05:19,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 08:05:19,276 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2022-07-21 08:05:19,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 08:05:19,279 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-21 08:05:19,280 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 08:05:19,280 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2135271971] [2022-07-21 08:05:19,280 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2135271971] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-21 08:05:19,280 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-21 08:05:19,280 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-07-21 08:05:19,280 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1854049873] [2022-07-21 08:05:19,280 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-21 08:05:19,281 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-07-21 08:05:19,281 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 08:05:19,281 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-07-21 08:05:19,281 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2022-07-21 08:05:19,282 INFO L87 Difference]: Start difference. First operand 326 states and 459 transitions. Second operand has 9 states, 9 states have (on average 5.555555555555555) internal successors, (50), 5 states have internal predecessors, (50), 2 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 2 states have call successors, (7) [2022-07-21 08:05:19,988 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 08:05:19,988 INFO L93 Difference]: Finished difference Result 540 states and 753 transitions. [2022-07-21 08:05:19,989 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-07-21 08:05:19,989 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 5.555555555555555) internal successors, (50), 5 states have internal predecessors, (50), 2 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 2 states have call successors, (7) Word has length 65 [2022-07-21 08:05:19,989 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 08:05:19,992 INFO L225 Difference]: With dead ends: 540 [2022-07-21 08:05:19,992 INFO L226 Difference]: Without dead ends: 363 [2022-07-21 08:05:19,993 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=66, Invalid=174, Unknown=0, NotChecked=0, Total=240 [2022-07-21 08:05:19,993 INFO L413 NwaCegarLoop]: 315 mSDtfsCounter, 252 mSDsluCounter, 1134 mSDsCounter, 0 mSdLazyCounter, 820 mSolverCounterSat, 81 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 253 SdHoareTripleChecker+Valid, 1449 SdHoareTripleChecker+Invalid, 901 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 81 IncrementalHoareTripleChecker+Valid, 820 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-07-21 08:05:19,994 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [253 Valid, 1449 Invalid, 901 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [81 Valid, 820 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-07-21 08:05:19,995 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 363 states. [2022-07-21 08:05:20,013 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 363 to 331. [2022-07-21 08:05:20,014 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 331 states, 263 states have (on average 1.4258555133079849) internal successors, (375), 270 states have internal predecessors, (375), 43 states have call successors, (43), 22 states have call predecessors, (43), 23 states have return successors, (45), 41 states have call predecessors, (45), 39 states have call successors, (45) [2022-07-21 08:05:20,016 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 331 states to 331 states and 463 transitions. [2022-07-21 08:05:20,016 INFO L78 Accepts]: Start accepts. Automaton has 331 states and 463 transitions. Word has length 65 [2022-07-21 08:05:20,017 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 08:05:20,017 INFO L495 AbstractCegarLoop]: Abstraction has 331 states and 463 transitions. [2022-07-21 08:05:20,017 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 5.555555555555555) internal successors, (50), 5 states have internal predecessors, (50), 2 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 2 states have call successors, (7) [2022-07-21 08:05:20,017 INFO L276 IsEmpty]: Start isEmpty. Operand 331 states and 463 transitions. [2022-07-21 08:05:20,018 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2022-07-21 08:05:20,018 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 08:05:20,018 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-21 08:05:20,019 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-07-21 08:05:20,019 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-21 08:05:20,019 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 08:05:20,019 INFO L85 PathProgramCache]: Analyzing trace with hash 20216553, now seen corresponding path program 1 times [2022-07-21 08:05:20,020 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 08:05:20,020 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [249043418] [2022-07-21 08:05:20,020 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 08:05:20,020 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 08:05:20,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 08:05:20,057 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-07-21 08:05:20,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 08:05:20,073 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-07-21 08:05:20,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 08:05:20,084 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-07-21 08:05:20,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 08:05:20,098 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 08:05:20,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 08:05:20,101 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-21 08:05:20,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 08:05:20,105 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2022-07-21 08:05:20,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 08:05:20,107 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2022-07-21 08:05:20,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 08:05:20,109 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-21 08:05:20,109 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 08:05:20,109 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [249043418] [2022-07-21 08:05:20,110 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [249043418] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-21 08:05:20,110 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-21 08:05:20,110 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-07-21 08:05:20,110 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1782721772] [2022-07-21 08:05:20,110 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-21 08:05:20,110 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-07-21 08:05:20,111 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 08:05:20,111 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-07-21 08:05:20,111 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2022-07-21 08:05:20,111 INFO L87 Difference]: Start difference. First operand 331 states and 463 transitions. Second operand has 10 states, 10 states have (on average 5.0) internal successors, (50), 7 states have internal predecessors, (50), 4 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 4 states have call predecessors, (7), 4 states have call successors, (7) [2022-07-21 08:05:21,653 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 08:05:21,654 INFO L93 Difference]: Finished difference Result 1231 states and 1681 transitions. [2022-07-21 08:05:21,654 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2022-07-21 08:05:21,654 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 5.0) internal successors, (50), 7 states have internal predecessors, (50), 4 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 4 states have call predecessors, (7), 4 states have call successors, (7) Word has length 65 [2022-07-21 08:05:21,656 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 08:05:21,663 INFO L225 Difference]: With dead ends: 1231 [2022-07-21 08:05:21,663 INFO L226 Difference]: Without dead ends: 1037 [2022-07-21 08:05:21,665 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 341 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=257, Invalid=1075, Unknown=0, NotChecked=0, Total=1332 [2022-07-21 08:05:21,673 INFO L413 NwaCegarLoop]: 437 mSDtfsCounter, 1873 mSDsluCounter, 1260 mSDsCounter, 0 mSdLazyCounter, 1411 mSolverCounterSat, 532 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1889 SdHoareTripleChecker+Valid, 1697 SdHoareTripleChecker+Invalid, 1943 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 532 IncrementalHoareTripleChecker+Valid, 1411 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2022-07-21 08:05:21,675 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1889 Valid, 1697 Invalid, 1943 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [532 Valid, 1411 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2022-07-21 08:05:21,678 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1037 states. [2022-07-21 08:05:21,733 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1037 to 912. [2022-07-21 08:05:21,735 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 912 states, 725 states have (on average 1.3655172413793104) internal successors, (990), 740 states have internal predecessors, (990), 100 states have call successors, (100), 75 states have call predecessors, (100), 85 states have return successors, (114), 98 states have call predecessors, (114), 96 states have call successors, (114) [2022-07-21 08:05:21,741 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 912 states to 912 states and 1204 transitions. [2022-07-21 08:05:21,741 INFO L78 Accepts]: Start accepts. Automaton has 912 states and 1204 transitions. Word has length 65 [2022-07-21 08:05:21,741 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 08:05:21,741 INFO L495 AbstractCegarLoop]: Abstraction has 912 states and 1204 transitions. [2022-07-21 08:05:21,742 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 5.0) internal successors, (50), 7 states have internal predecessors, (50), 4 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 4 states have call predecessors, (7), 4 states have call successors, (7) [2022-07-21 08:05:21,742 INFO L276 IsEmpty]: Start isEmpty. Operand 912 states and 1204 transitions. [2022-07-21 08:05:21,743 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2022-07-21 08:05:21,743 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 08:05:21,743 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-21 08:05:21,743 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-07-21 08:05:21,744 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-21 08:05:21,745 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 08:05:21,745 INFO L85 PathProgramCache]: Analyzing trace with hash 1071665642, now seen corresponding path program 1 times [2022-07-21 08:05:21,745 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 08:05:21,745 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [408468390] [2022-07-21 08:05:21,745 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 08:05:21,745 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 08:05:21,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 08:05:21,784 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-07-21 08:05:21,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 08:05:21,793 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-07-21 08:05:21,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 08:05:21,800 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-07-21 08:05:21,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 08:05:21,845 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 08:05:21,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 08:05:21,851 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-21 08:05:21,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 08:05:21,885 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2022-07-21 08:05:21,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 08:05:21,888 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2022-07-21 08:05:21,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 08:05:21,892 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-21 08:05:21,892 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 08:05:21,893 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [408468390] [2022-07-21 08:05:21,893 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [408468390] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-21 08:05:21,893 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-21 08:05:21,893 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-07-21 08:05:21,894 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [485786987] [2022-07-21 08:05:21,894 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-21 08:05:21,894 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-07-21 08:05:21,894 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 08:05:21,895 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-07-21 08:05:21,895 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2022-07-21 08:05:21,895 INFO L87 Difference]: Start difference. First operand 912 states and 1204 transitions. Second operand has 9 states, 9 states have (on average 5.555555555555555) internal successors, (50), 5 states have internal predecessors, (50), 2 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 2 states have call successors, (7) [2022-07-21 08:05:22,516 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 08:05:22,516 INFO L93 Difference]: Finished difference Result 1793 states and 2347 transitions. [2022-07-21 08:05:22,516 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-07-21 08:05:22,517 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 5.555555555555555) internal successors, (50), 5 states have internal predecessors, (50), 2 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 2 states have call successors, (7) Word has length 65 [2022-07-21 08:05:22,517 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 08:05:22,522 INFO L225 Difference]: With dead ends: 1793 [2022-07-21 08:05:22,522 INFO L226 Difference]: Without dead ends: 1024 [2022-07-21 08:05:22,525 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=72, Invalid=200, Unknown=0, NotChecked=0, Total=272 [2022-07-21 08:05:22,525 INFO L413 NwaCegarLoop]: 312 mSDtfsCounter, 372 mSDsluCounter, 990 mSDsCounter, 0 mSdLazyCounter, 758 mSolverCounterSat, 121 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 374 SdHoareTripleChecker+Valid, 1302 SdHoareTripleChecker+Invalid, 879 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 121 IncrementalHoareTripleChecker+Valid, 758 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-07-21 08:05:22,526 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [374 Valid, 1302 Invalid, 879 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [121 Valid, 758 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-07-21 08:05:22,527 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1024 states. [2022-07-21 08:05:22,584 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1024 to 932. [2022-07-21 08:05:22,585 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 932 states, 741 states have (on average 1.3508771929824561) internal successors, (1001), 756 states have internal predecessors, (1001), 100 states have call successors, (100), 75 states have call predecessors, (100), 89 states have return successors, (118), 102 states have call predecessors, (118), 96 states have call successors, (118) [2022-07-21 08:05:22,589 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 932 states to 932 states and 1219 transitions. [2022-07-21 08:05:22,590 INFO L78 Accepts]: Start accepts. Automaton has 932 states and 1219 transitions. Word has length 65 [2022-07-21 08:05:22,590 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 08:05:22,590 INFO L495 AbstractCegarLoop]: Abstraction has 932 states and 1219 transitions. [2022-07-21 08:05:22,591 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 5.555555555555555) internal successors, (50), 5 states have internal predecessors, (50), 2 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 2 states have call successors, (7) [2022-07-21 08:05:22,591 INFO L276 IsEmpty]: Start isEmpty. Operand 932 states and 1219 transitions. [2022-07-21 08:05:22,592 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2022-07-21 08:05:22,592 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 08:05:22,593 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-21 08:05:22,593 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-07-21 08:05:22,593 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-21 08:05:22,594 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 08:05:22,594 INFO L85 PathProgramCache]: Analyzing trace with hash -1837098260, now seen corresponding path program 1 times [2022-07-21 08:05:22,594 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 08:05:22,594 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [701096619] [2022-07-21 08:05:22,594 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 08:05:22,594 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 08:05:22,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 08:05:22,642 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-07-21 08:05:22,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 08:05:22,652 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-07-21 08:05:22,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 08:05:22,663 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-07-21 08:05:22,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 08:05:22,668 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 08:05:22,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 08:05:22,670 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-21 08:05:22,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 08:05:22,671 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2022-07-21 08:05:22,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 08:05:22,691 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2022-07-21 08:05:22,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 08:05:22,695 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-21 08:05:22,695 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 08:05:22,696 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [701096619] [2022-07-21 08:05:22,696 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [701096619] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-21 08:05:22,696 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-21 08:05:22,696 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-07-21 08:05:22,696 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [214525874] [2022-07-21 08:05:22,697 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-21 08:05:22,697 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-07-21 08:05:22,697 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 08:05:22,698 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-07-21 08:05:22,698 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2022-07-21 08:05:22,698 INFO L87 Difference]: Start difference. First operand 932 states and 1219 transitions. Second operand has 8 states, 8 states have (on average 6.25) internal successors, (50), 6 states have internal predecessors, (50), 3 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2022-07-21 08:05:23,467 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 08:05:23,468 INFO L93 Difference]: Finished difference Result 2500 states and 3166 transitions. [2022-07-21 08:05:23,468 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-07-21 08:05:23,468 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 6.25) internal successors, (50), 6 states have internal predecessors, (50), 3 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) Word has length 65 [2022-07-21 08:05:23,469 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 08:05:23,476 INFO L225 Difference]: With dead ends: 2500 [2022-07-21 08:05:23,477 INFO L226 Difference]: Without dead ends: 1712 [2022-07-21 08:05:23,479 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 57 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=95, Invalid=247, Unknown=0, NotChecked=0, Total=342 [2022-07-21 08:05:23,479 INFO L413 NwaCegarLoop]: 334 mSDtfsCounter, 650 mSDsluCounter, 811 mSDsCounter, 0 mSdLazyCounter, 802 mSolverCounterSat, 133 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 669 SdHoareTripleChecker+Valid, 1145 SdHoareTripleChecker+Invalid, 935 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 133 IncrementalHoareTripleChecker+Valid, 802 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-07-21 08:05:23,480 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [669 Valid, 1145 Invalid, 935 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [133 Valid, 802 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-07-21 08:05:23,482 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1712 states. [2022-07-21 08:05:23,541 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1712 to 1380. [2022-07-21 08:05:23,543 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1380 states, 1094 states have (on average 1.3254113345521024) internal successors, (1450), 1118 states have internal predecessors, (1450), 146 states have call successors, (146), 114 states have call predecessors, (146), 138 states have return successors, (190), 150 states have call predecessors, (190), 142 states have call successors, (190) [2022-07-21 08:05:23,570 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1380 states to 1380 states and 1786 transitions. [2022-07-21 08:05:23,571 INFO L78 Accepts]: Start accepts. Automaton has 1380 states and 1786 transitions. Word has length 65 [2022-07-21 08:05:23,572 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 08:05:23,573 INFO L495 AbstractCegarLoop]: Abstraction has 1380 states and 1786 transitions. [2022-07-21 08:05:23,573 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 6.25) internal successors, (50), 6 states have internal predecessors, (50), 3 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2022-07-21 08:05:23,573 INFO L276 IsEmpty]: Start isEmpty. Operand 1380 states and 1786 transitions. [2022-07-21 08:05:23,574 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2022-07-21 08:05:23,574 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 08:05:23,574 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-21 08:05:23,575 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-07-21 08:05:23,575 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-21 08:05:23,575 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 08:05:23,576 INFO L85 PathProgramCache]: Analyzing trace with hash -1971111766, now seen corresponding path program 1 times [2022-07-21 08:05:23,576 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 08:05:23,576 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2039935429] [2022-07-21 08:05:23,576 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 08:05:23,576 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 08:05:23,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 08:05:23,621 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-07-21 08:05:23,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 08:05:23,629 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-07-21 08:05:23,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 08:05:23,640 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-07-21 08:05:23,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 08:05:23,653 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 08:05:23,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 08:05:23,656 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-21 08:05:23,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 08:05:23,661 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2022-07-21 08:05:23,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 08:05:23,664 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2022-07-21 08:05:23,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 08:05:23,675 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-21 08:05:23,675 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 08:05:23,675 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2039935429] [2022-07-21 08:05:23,675 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2039935429] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-21 08:05:23,676 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-21 08:05:23,676 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-07-21 08:05:23,676 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [693190141] [2022-07-21 08:05:23,676 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-21 08:05:23,676 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-07-21 08:05:23,677 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 08:05:23,677 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-07-21 08:05:23,677 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2022-07-21 08:05:23,677 INFO L87 Difference]: Start difference. First operand 1380 states and 1786 transitions. Second operand has 7 states, 7 states have (on average 7.142857142857143) internal successors, (50), 4 states have internal predecessors, (50), 4 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2022-07-21 08:05:24,083 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 08:05:24,084 INFO L93 Difference]: Finished difference Result 3851 states and 4925 transitions. [2022-07-21 08:05:24,084 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-07-21 08:05:24,084 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 7.142857142857143) internal successors, (50), 4 states have internal predecessors, (50), 4 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) Word has length 65 [2022-07-21 08:05:24,085 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 08:05:24,096 INFO L225 Difference]: With dead ends: 3851 [2022-07-21 08:05:24,096 INFO L226 Difference]: Without dead ends: 2617 [2022-07-21 08:05:24,099 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=71, Invalid=139, Unknown=0, NotChecked=0, Total=210 [2022-07-21 08:05:24,100 INFO L413 NwaCegarLoop]: 299 mSDtfsCounter, 772 mSDsluCounter, 481 mSDsCounter, 0 mSdLazyCounter, 273 mSolverCounterSat, 167 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 795 SdHoareTripleChecker+Valid, 780 SdHoareTripleChecker+Invalid, 440 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 167 IncrementalHoareTripleChecker+Valid, 273 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-07-21 08:05:24,100 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [795 Valid, 780 Invalid, 440 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [167 Valid, 273 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-07-21 08:05:24,103 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2617 states. [2022-07-21 08:05:24,200 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2617 to 2509. [2022-07-21 08:05:24,203 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2509 states, 1963 states have (on average 1.2745797249108508) internal successors, (2502), 2008 states have internal predecessors, (2502), 270 states have call successors, (270), 220 states have call predecessors, (270), 274 states have return successors, (398), 283 states have call predecessors, (398), 266 states have call successors, (398) [2022-07-21 08:05:24,213 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2509 states to 2509 states and 3170 transitions. [2022-07-21 08:05:24,214 INFO L78 Accepts]: Start accepts. Automaton has 2509 states and 3170 transitions. Word has length 65 [2022-07-21 08:05:24,214 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 08:05:24,214 INFO L495 AbstractCegarLoop]: Abstraction has 2509 states and 3170 transitions. [2022-07-21 08:05:24,215 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 7.142857142857143) internal successors, (50), 4 states have internal predecessors, (50), 4 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2022-07-21 08:05:24,215 INFO L276 IsEmpty]: Start isEmpty. Operand 2509 states and 3170 transitions. [2022-07-21 08:05:24,216 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2022-07-21 08:05:24,216 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 08:05:24,216 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-21 08:05:24,216 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-07-21 08:05:24,216 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-21 08:05:24,217 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 08:05:24,217 INFO L85 PathProgramCache]: Analyzing trace with hash -291684510, now seen corresponding path program 1 times [2022-07-21 08:05:24,217 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 08:05:24,217 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [242401536] [2022-07-21 08:05:24,217 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 08:05:24,218 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 08:05:24,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 08:05:24,242 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-07-21 08:05:24,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 08:05:24,249 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-07-21 08:05:24,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 08:05:24,259 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-07-21 08:05:24,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 08:05:24,263 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 08:05:24,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 08:05:24,264 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-21 08:05:24,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 08:05:24,266 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2022-07-21 08:05:24,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 08:05:24,276 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2022-07-21 08:05:24,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 08:05:24,278 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-21 08:05:24,278 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 08:05:24,279 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [242401536] [2022-07-21 08:05:24,279 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [242401536] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-21 08:05:24,279 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-21 08:05:24,279 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-21 08:05:24,279 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1527865281] [2022-07-21 08:05:24,279 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-21 08:05:24,280 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-21 08:05:24,280 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 08:05:24,280 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-21 08:05:24,280 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-07-21 08:05:24,281 INFO L87 Difference]: Start difference. First operand 2509 states and 3170 transitions. Second operand has 6 states, 6 states have (on average 8.5) internal successors, (51), 3 states have internal predecessors, (51), 3 states have call successors, (8), 5 states have call predecessors, (8), 1 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2022-07-21 08:05:24,792 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 08:05:24,792 INFO L93 Difference]: Finished difference Result 5831 states and 7344 transitions. [2022-07-21 08:05:24,792 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-07-21 08:05:24,793 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 8.5) internal successors, (51), 3 states have internal predecessors, (51), 3 states have call successors, (8), 5 states have call predecessors, (8), 1 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) Word has length 66 [2022-07-21 08:05:24,793 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 08:05:24,808 INFO L225 Difference]: With dead ends: 5831 [2022-07-21 08:05:24,808 INFO L226 Difference]: Without dead ends: 3468 [2022-07-21 08:05:24,814 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=39, Invalid=71, Unknown=0, NotChecked=0, Total=110 [2022-07-21 08:05:24,814 INFO L413 NwaCegarLoop]: 321 mSDtfsCounter, 421 mSDsluCounter, 583 mSDsCounter, 0 mSdLazyCounter, 353 mSolverCounterSat, 119 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 430 SdHoareTripleChecker+Valid, 904 SdHoareTripleChecker+Invalid, 472 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 119 IncrementalHoareTripleChecker+Valid, 353 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-07-21 08:05:24,815 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [430 Valid, 904 Invalid, 472 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [119 Valid, 353 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-07-21 08:05:24,818 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3468 states. [2022-07-21 08:05:24,957 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3468 to 3214. [2022-07-21 08:05:24,962 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3214 states, 2511 states have (on average 1.2652329749103943) internal successors, (3177), 2562 states have internal predecessors, (3177), 346 states have call successors, (346), 286 states have call predecessors, (346), 355 states have return successors, (494), 368 states have call predecessors, (494), 342 states have call successors, (494) [2022-07-21 08:05:24,975 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3214 states to 3214 states and 4017 transitions. [2022-07-21 08:05:24,976 INFO L78 Accepts]: Start accepts. Automaton has 3214 states and 4017 transitions. Word has length 66 [2022-07-21 08:05:24,977 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 08:05:24,977 INFO L495 AbstractCegarLoop]: Abstraction has 3214 states and 4017 transitions. [2022-07-21 08:05:24,977 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 8.5) internal successors, (51), 3 states have internal predecessors, (51), 3 states have call successors, (8), 5 states have call predecessors, (8), 1 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2022-07-21 08:05:24,977 INFO L276 IsEmpty]: Start isEmpty. Operand 3214 states and 4017 transitions. [2022-07-21 08:05:24,979 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2022-07-21 08:05:24,979 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 08:05:24,979 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-21 08:05:24,979 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-07-21 08:05:24,980 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-21 08:05:24,980 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 08:05:24,980 INFO L85 PathProgramCache]: Analyzing trace with hash 342944188, now seen corresponding path program 1 times [2022-07-21 08:05:24,980 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 08:05:24,980 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1113341150] [2022-07-21 08:05:24,981 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 08:05:24,981 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 08:05:24,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 08:05:25,009 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-07-21 08:05:25,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 08:05:25,021 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-07-21 08:05:25,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 08:05:25,030 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2022-07-21 08:05:25,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 08:05:25,035 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2022-07-21 08:05:25,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 08:05:25,037 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2022-07-21 08:05:25,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 08:05:25,039 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-21 08:05:25,039 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 08:05:25,039 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1113341150] [2022-07-21 08:05:25,039 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1113341150] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-21 08:05:25,040 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-21 08:05:25,040 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-07-21 08:05:25,040 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [646887625] [2022-07-21 08:05:25,040 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-21 08:05:25,040 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-07-21 08:05:25,041 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 08:05:25,041 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-21 08:05:25,041 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-07-21 08:05:25,041 INFO L87 Difference]: Start difference. First operand 3214 states and 4017 transitions. Second operand has 5 states, 5 states have (on average 11.6) internal successors, (58), 3 states have internal predecessors, (58), 2 states have call successors, (6), 4 states have call predecessors, (6), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-07-21 08:05:25,544 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 08:05:25,544 INFO L93 Difference]: Finished difference Result 3374 states and 4261 transitions. [2022-07-21 08:05:25,545 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-21 08:05:25,545 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 11.6) internal successors, (58), 3 states have internal predecessors, (58), 2 states have call successors, (6), 4 states have call predecessors, (6), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 69 [2022-07-21 08:05:25,545 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 08:05:25,559 INFO L225 Difference]: With dead ends: 3374 [2022-07-21 08:05:25,559 INFO L226 Difference]: Without dead ends: 3246 [2022-07-21 08:05:25,560 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2022-07-21 08:05:25,561 INFO L413 NwaCegarLoop]: 337 mSDtfsCounter, 396 mSDsluCounter, 321 mSDsCounter, 0 mSdLazyCounter, 280 mSolverCounterSat, 76 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 410 SdHoareTripleChecker+Valid, 658 SdHoareTripleChecker+Invalid, 356 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 76 IncrementalHoareTripleChecker+Valid, 280 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-07-21 08:05:25,561 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [410 Valid, 658 Invalid, 356 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [76 Valid, 280 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-07-21 08:05:25,564 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3246 states. [2022-07-21 08:05:25,713 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3246 to 3214. [2022-07-21 08:05:25,720 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3214 states, 2511 states have (on average 1.2648347272003186) internal successors, (3176), 2562 states have internal predecessors, (3176), 346 states have call successors, (346), 286 states have call predecessors, (346), 355 states have return successors, (494), 368 states have call predecessors, (494), 342 states have call successors, (494) [2022-07-21 08:05:25,729 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3214 states to 3214 states and 4016 transitions. [2022-07-21 08:05:25,730 INFO L78 Accepts]: Start accepts. Automaton has 3214 states and 4016 transitions. Word has length 69 [2022-07-21 08:05:25,730 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 08:05:25,731 INFO L495 AbstractCegarLoop]: Abstraction has 3214 states and 4016 transitions. [2022-07-21 08:05:25,731 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 11.6) internal successors, (58), 3 states have internal predecessors, (58), 2 states have call successors, (6), 4 states have call predecessors, (6), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-07-21 08:05:25,731 INFO L276 IsEmpty]: Start isEmpty. Operand 3214 states and 4016 transitions. [2022-07-21 08:05:25,732 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2022-07-21 08:05:25,732 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 08:05:25,732 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-21 08:05:25,733 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-07-21 08:05:25,733 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-21 08:05:25,733 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 08:05:25,733 INFO L85 PathProgramCache]: Analyzing trace with hash -1618630470, now seen corresponding path program 1 times [2022-07-21 08:05:25,734 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 08:05:25,734 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1521068250] [2022-07-21 08:05:25,734 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 08:05:25,734 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 08:05:25,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 08:05:25,770 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-07-21 08:05:25,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 08:05:25,783 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-07-21 08:05:25,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 08:05:25,803 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2022-07-21 08:05:25,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 08:05:25,810 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2022-07-21 08:05:25,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 08:05:25,813 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2022-07-21 08:05:25,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 08:05:25,815 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-21 08:05:25,815 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 08:05:25,815 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1521068250] [2022-07-21 08:05:25,815 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1521068250] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-21 08:05:25,815 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-21 08:05:25,816 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-21 08:05:25,816 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1095308833] [2022-07-21 08:05:25,816 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-21 08:05:25,816 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-21 08:05:25,816 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 08:05:25,817 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-21 08:05:25,817 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-21 08:05:25,817 INFO L87 Difference]: Start difference. First operand 3214 states and 4016 transitions. Second operand has 6 states, 6 states have (on average 9.666666666666666) internal successors, (58), 4 states have internal predecessors, (58), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-07-21 08:05:26,561 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 08:05:26,562 INFO L93 Difference]: Finished difference Result 3524 states and 4487 transitions. [2022-07-21 08:05:26,562 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-07-21 08:05:26,562 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 9.666666666666666) internal successors, (58), 4 states have internal predecessors, (58), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 69 [2022-07-21 08:05:26,563 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 08:05:26,576 INFO L225 Difference]: With dead ends: 3524 [2022-07-21 08:05:26,576 INFO L226 Difference]: Without dead ends: 3400 [2022-07-21 08:05:26,578 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=33, Invalid=77, Unknown=0, NotChecked=0, Total=110 [2022-07-21 08:05:26,579 INFO L413 NwaCegarLoop]: 339 mSDtfsCounter, 637 mSDsluCounter, 514 mSDsCounter, 0 mSdLazyCounter, 668 mSolverCounterSat, 120 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 656 SdHoareTripleChecker+Valid, 853 SdHoareTripleChecker+Invalid, 788 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 120 IncrementalHoareTripleChecker+Valid, 668 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-07-21 08:05:26,580 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [656 Valid, 853 Invalid, 788 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [120 Valid, 668 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-07-21 08:05:26,583 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3400 states. [2022-07-21 08:05:26,766 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3400 to 3335. [2022-07-21 08:05:26,773 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3335 states, 2614 states have (on average 1.2746748278500382) internal successors, (3332), 2666 states have internal predecessors, (3332), 357 states have call successors, (357), 292 states have call predecessors, (357), 362 states have return successors, (508), 379 states have call predecessors, (508), 353 states have call successors, (508) [2022-07-21 08:05:26,781 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3335 states to 3335 states and 4197 transitions. [2022-07-21 08:05:26,782 INFO L78 Accepts]: Start accepts. Automaton has 3335 states and 4197 transitions. Word has length 69 [2022-07-21 08:05:26,782 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 08:05:26,782 INFO L495 AbstractCegarLoop]: Abstraction has 3335 states and 4197 transitions. [2022-07-21 08:05:26,782 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 9.666666666666666) internal successors, (58), 4 states have internal predecessors, (58), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-07-21 08:05:26,783 INFO L276 IsEmpty]: Start isEmpty. Operand 3335 states and 4197 transitions. [2022-07-21 08:05:26,784 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2022-07-21 08:05:26,784 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 08:05:26,784 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-21 08:05:26,784 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-07-21 08:05:26,785 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-21 08:05:26,785 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 08:05:26,786 INFO L85 PathProgramCache]: Analyzing trace with hash -1515916106, now seen corresponding path program 1 times [2022-07-21 08:05:26,786 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 08:05:26,786 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [212981821] [2022-07-21 08:05:26,786 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 08:05:26,786 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 08:05:26,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 08:05:26,806 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-07-21 08:05:26,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 08:05:26,815 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-07-21 08:05:26,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 08:05:26,841 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2022-07-21 08:05:26,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 08:05:26,849 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2022-07-21 08:05:26,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 08:05:26,852 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2022-07-21 08:05:26,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 08:05:26,854 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-21 08:05:26,855 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 08:05:26,855 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [212981821] [2022-07-21 08:05:26,855 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [212981821] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-21 08:05:26,855 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-21 08:05:26,855 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-07-21 08:05:26,855 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1656079658] [2022-07-21 08:05:26,856 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-21 08:05:26,856 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-07-21 08:05:26,856 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 08:05:26,857 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-07-21 08:05:26,857 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-07-21 08:05:26,857 INFO L87 Difference]: Start difference. First operand 3335 states and 4197 transitions. Second operand has 7 states, 7 states have (on average 8.285714285714286) internal successors, (58), 5 states have internal predecessors, (58), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-07-21 08:05:27,808 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 08:05:27,808 INFO L93 Difference]: Finished difference Result 3797 states and 4891 transitions. [2022-07-21 08:05:27,809 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-07-21 08:05:27,809 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 8.285714285714286) internal successors, (58), 5 states have internal predecessors, (58), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 69 [2022-07-21 08:05:27,809 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 08:05:27,823 INFO L225 Difference]: With dead ends: 3797 [2022-07-21 08:05:27,824 INFO L226 Difference]: Without dead ends: 3552 [2022-07-21 08:05:27,826 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=66, Invalid=174, Unknown=0, NotChecked=0, Total=240 [2022-07-21 08:05:27,826 INFO L413 NwaCegarLoop]: 430 mSDtfsCounter, 629 mSDsluCounter, 891 mSDsCounter, 0 mSdLazyCounter, 1056 mSolverCounterSat, 100 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 648 SdHoareTripleChecker+Valid, 1321 SdHoareTripleChecker+Invalid, 1156 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 100 IncrementalHoareTripleChecker+Valid, 1056 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2022-07-21 08:05:27,827 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [648 Valid, 1321 Invalid, 1156 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [100 Valid, 1056 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2022-07-21 08:05:27,830 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3552 states. [2022-07-21 08:05:28,003 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3552 to 3449. [2022-07-21 08:05:28,009 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3449 states, 2710 states have (on average 1.2819188191881918) internal successors, (3474), 2763 states have internal predecessors, (3474), 368 states have call successors, (368), 298 states have call predecessors, (368), 369 states have return successors, (521), 391 states have call predecessors, (521), 364 states have call successors, (521) [2022-07-21 08:05:28,017 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3449 states to 3449 states and 4363 transitions. [2022-07-21 08:05:28,018 INFO L78 Accepts]: Start accepts. Automaton has 3449 states and 4363 transitions. Word has length 69 [2022-07-21 08:05:28,019 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 08:05:28,019 INFO L495 AbstractCegarLoop]: Abstraction has 3449 states and 4363 transitions. [2022-07-21 08:05:28,019 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 8.285714285714286) internal successors, (58), 5 states have internal predecessors, (58), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-07-21 08:05:28,019 INFO L276 IsEmpty]: Start isEmpty. Operand 3449 states and 4363 transitions. [2022-07-21 08:05:28,021 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2022-07-21 08:05:28,021 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 08:05:28,022 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-21 08:05:28,022 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-07-21 08:05:28,022 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-21 08:05:28,022 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 08:05:28,023 INFO L85 PathProgramCache]: Analyzing trace with hash -129130696, now seen corresponding path program 1 times [2022-07-21 08:05:28,023 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 08:05:28,023 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [492116077] [2022-07-21 08:05:28,023 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 08:05:28,023 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 08:05:28,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 08:05:28,052 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-07-21 08:05:28,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 08:05:28,067 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-07-21 08:05:28,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 08:05:28,095 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2022-07-21 08:05:28,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 08:05:28,100 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2022-07-21 08:05:28,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 08:05:28,103 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2022-07-21 08:05:28,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 08:05:28,106 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-21 08:05:28,106 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 08:05:28,106 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [492116077] [2022-07-21 08:05:28,106 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [492116077] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-21 08:05:28,106 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-21 08:05:28,106 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-07-21 08:05:28,107 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1256406082] [2022-07-21 08:05:28,107 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-21 08:05:28,107 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-07-21 08:05:28,107 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 08:05:28,108 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-07-21 08:05:28,108 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2022-07-21 08:05:28,108 INFO L87 Difference]: Start difference. First operand 3449 states and 4363 transitions. Second operand has 7 states, 7 states have (on average 8.285714285714286) internal successors, (58), 5 states have internal predecessors, (58), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-07-21 08:05:28,682 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 08:05:28,682 INFO L93 Difference]: Finished difference Result 3907 states and 5057 transitions. [2022-07-21 08:05:28,682 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-21 08:05:28,683 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 8.285714285714286) internal successors, (58), 5 states have internal predecessors, (58), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 69 [2022-07-21 08:05:28,683 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 08:05:28,698 INFO L225 Difference]: With dead ends: 3907 [2022-07-21 08:05:28,698 INFO L226 Difference]: Without dead ends: 3548 [2022-07-21 08:05:28,701 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=36, Invalid=74, Unknown=0, NotChecked=0, Total=110 [2022-07-21 08:05:28,701 INFO L413 NwaCegarLoop]: 289 mSDtfsCounter, 637 mSDsluCounter, 414 mSDsCounter, 0 mSdLazyCounter, 458 mSolverCounterSat, 142 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 657 SdHoareTripleChecker+Valid, 703 SdHoareTripleChecker+Invalid, 600 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 142 IncrementalHoareTripleChecker+Valid, 458 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-07-21 08:05:28,702 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [657 Valid, 703 Invalid, 600 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [142 Valid, 458 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-07-21 08:05:28,705 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3548 states. [2022-07-21 08:05:28,879 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3548 to 3449. [2022-07-21 08:05:28,897 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3449 states, 2710 states have (on average 1.2808118081180813) internal successors, (3471), 2763 states have internal predecessors, (3471), 368 states have call successors, (368), 298 states have call predecessors, (368), 369 states have return successors, (521), 391 states have call predecessors, (521), 364 states have call successors, (521) [2022-07-21 08:05:28,906 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3449 states to 3449 states and 4360 transitions. [2022-07-21 08:05:28,908 INFO L78 Accepts]: Start accepts. Automaton has 3449 states and 4360 transitions. Word has length 69 [2022-07-21 08:05:28,909 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 08:05:28,909 INFO L495 AbstractCegarLoop]: Abstraction has 3449 states and 4360 transitions. [2022-07-21 08:05:28,910 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 8.285714285714286) internal successors, (58), 5 states have internal predecessors, (58), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-07-21 08:05:28,910 INFO L276 IsEmpty]: Start isEmpty. Operand 3449 states and 4360 transitions. [2022-07-21 08:05:28,912 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2022-07-21 08:05:28,912 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 08:05:28,912 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-21 08:05:28,913 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-07-21 08:05:28,913 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-21 08:05:28,913 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 08:05:28,913 INFO L85 PathProgramCache]: Analyzing trace with hash 314769978, now seen corresponding path program 1 times [2022-07-21 08:05:28,914 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 08:05:28,914 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1220279159] [2022-07-21 08:05:28,914 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 08:05:28,914 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 08:05:28,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 08:05:28,931 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-07-21 08:05:28,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 08:05:28,943 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-07-21 08:05:28,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 08:05:28,968 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2022-07-21 08:05:28,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 08:05:28,975 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2022-07-21 08:05:28,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 08:05:28,978 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2022-07-21 08:05:28,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 08:05:28,982 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-21 08:05:28,983 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 08:05:28,983 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1220279159] [2022-07-21 08:05:28,983 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1220279159] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-21 08:05:28,983 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-21 08:05:28,983 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-07-21 08:05:28,983 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1103370427] [2022-07-21 08:05:28,983 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-21 08:05:28,984 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-07-21 08:05:28,984 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 08:05:28,984 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-07-21 08:05:28,985 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-07-21 08:05:28,985 INFO L87 Difference]: Start difference. First operand 3449 states and 4360 transitions. Second operand has 7 states, 7 states have (on average 8.285714285714286) internal successors, (58), 5 states have internal predecessors, (58), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-07-21 08:05:29,943 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 08:05:29,944 INFO L93 Difference]: Finished difference Result 4243 states and 5535 transitions. [2022-07-21 08:05:29,944 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-07-21 08:05:29,944 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 8.285714285714286) internal successors, (58), 5 states have internal predecessors, (58), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 69 [2022-07-21 08:05:29,944 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 08:05:29,962 INFO L225 Difference]: With dead ends: 4243 [2022-07-21 08:05:29,962 INFO L226 Difference]: Without dead ends: 3884 [2022-07-21 08:05:29,965 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=73, Invalid=199, Unknown=0, NotChecked=0, Total=272 [2022-07-21 08:05:29,966 INFO L413 NwaCegarLoop]: 409 mSDtfsCounter, 672 mSDsluCounter, 880 mSDsCounter, 0 mSdLazyCounter, 1018 mSolverCounterSat, 107 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 694 SdHoareTripleChecker+Valid, 1289 SdHoareTripleChecker+Invalid, 1125 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 107 IncrementalHoareTripleChecker+Valid, 1018 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2022-07-21 08:05:29,966 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [694 Valid, 1289 Invalid, 1125 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [107 Valid, 1018 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2022-07-21 08:05:29,970 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3884 states. [2022-07-21 08:05:30,159 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3884 to 3658. [2022-07-21 08:05:30,164 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3658 states, 2885 states have (on average 1.2908145580589254) internal successors, (3724), 2940 states have internal predecessors, (3724), 388 states have call successors, (388), 310 states have call predecessors, (388), 383 states have return successors, (549), 413 states have call predecessors, (549), 384 states have call successors, (549) [2022-07-21 08:05:30,173 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3658 states to 3658 states and 4661 transitions. [2022-07-21 08:05:30,174 INFO L78 Accepts]: Start accepts. Automaton has 3658 states and 4661 transitions. Word has length 69 [2022-07-21 08:05:30,175 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 08:05:30,175 INFO L495 AbstractCegarLoop]: Abstraction has 3658 states and 4661 transitions. [2022-07-21 08:05:30,175 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 8.285714285714286) internal successors, (58), 5 states have internal predecessors, (58), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-07-21 08:05:30,175 INFO L276 IsEmpty]: Start isEmpty. Operand 3658 states and 4661 transitions. [2022-07-21 08:05:30,177 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2022-07-21 08:05:30,177 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 08:05:30,177 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-21 08:05:30,177 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-07-21 08:05:30,177 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-21 08:05:30,178 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 08:05:30,178 INFO L85 PathProgramCache]: Analyzing trace with hash 1853110008, now seen corresponding path program 1 times [2022-07-21 08:05:30,178 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 08:05:30,178 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [430664016] [2022-07-21 08:05:30,178 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 08:05:30,178 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 08:05:30,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 08:05:30,197 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-07-21 08:05:30,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 08:05:30,207 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-07-21 08:05:30,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 08:05:30,229 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2022-07-21 08:05:30,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 08:05:30,235 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2022-07-21 08:05:30,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 08:05:30,238 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2022-07-21 08:05:30,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 08:05:30,239 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-21 08:05:30,239 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 08:05:30,239 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [430664016] [2022-07-21 08:05:30,239 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [430664016] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-21 08:05:30,240 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-21 08:05:30,240 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-07-21 08:05:30,240 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1674015166] [2022-07-21 08:05:30,240 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-21 08:05:30,240 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-07-21 08:05:30,240 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 08:05:30,241 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-07-21 08:05:30,241 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-07-21 08:05:30,241 INFO L87 Difference]: Start difference. First operand 3658 states and 4661 transitions. Second operand has 7 states, 7 states have (on average 8.285714285714286) internal successors, (58), 5 states have internal predecessors, (58), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-07-21 08:05:31,165 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 08:05:31,165 INFO L93 Difference]: Finished difference Result 4946 states and 6542 transitions. [2022-07-21 08:05:31,165 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-07-21 08:05:31,166 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 8.285714285714286) internal successors, (58), 5 states have internal predecessors, (58), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 69 [2022-07-21 08:05:31,167 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 08:05:31,181 INFO L225 Difference]: With dead ends: 4946 [2022-07-21 08:05:31,182 INFO L226 Difference]: Without dead ends: 4378 [2022-07-21 08:05:31,186 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=73, Invalid=199, Unknown=0, NotChecked=0, Total=272 [2022-07-21 08:05:31,186 INFO L413 NwaCegarLoop]: 418 mSDtfsCounter, 618 mSDsluCounter, 883 mSDsCounter, 0 mSdLazyCounter, 1072 mSolverCounterSat, 102 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 636 SdHoareTripleChecker+Valid, 1301 SdHoareTripleChecker+Invalid, 1174 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 102 IncrementalHoareTripleChecker+Valid, 1072 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-07-21 08:05:31,187 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [636 Valid, 1301 Invalid, 1174 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [102 Valid, 1072 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-07-21 08:05:31,192 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4378 states. [2022-07-21 08:05:31,376 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4378 to 4089. [2022-07-21 08:05:31,380 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4089 states, 3250 states have (on average 1.3101538461538462) internal successors, (4258), 3309 states have internal predecessors, (4258), 426 states have call successors, (426), 334 states have call predecessors, (426), 411 states have return successors, (609), 455 states have call predecessors, (609), 422 states have call successors, (609) [2022-07-21 08:05:31,388 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4089 states to 4089 states and 5293 transitions. [2022-07-21 08:05:31,389 INFO L78 Accepts]: Start accepts. Automaton has 4089 states and 5293 transitions. Word has length 69 [2022-07-21 08:05:31,389 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 08:05:31,389 INFO L495 AbstractCegarLoop]: Abstraction has 4089 states and 5293 transitions. [2022-07-21 08:05:31,390 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 8.285714285714286) internal successors, (58), 5 states have internal predecessors, (58), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-07-21 08:05:31,390 INFO L276 IsEmpty]: Start isEmpty. Operand 4089 states and 5293 transitions. [2022-07-21 08:05:31,391 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2022-07-21 08:05:31,392 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 08:05:31,392 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-21 08:05:31,392 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2022-07-21 08:05:31,392 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-21 08:05:31,392 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 08:05:31,393 INFO L85 PathProgramCache]: Analyzing trace with hash -175476102, now seen corresponding path program 1 times [2022-07-21 08:05:31,393 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 08:05:31,393 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1578934202] [2022-07-21 08:05:31,393 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 08:05:31,393 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 08:05:31,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 08:05:31,413 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-07-21 08:05:31,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 08:05:31,421 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-07-21 08:05:31,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 08:05:31,428 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2022-07-21 08:05:31,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 08:05:31,462 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2022-07-21 08:05:31,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 08:05:31,465 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2022-07-21 08:05:31,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 08:05:31,467 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-21 08:05:31,468 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 08:05:31,468 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1578934202] [2022-07-21 08:05:31,468 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1578934202] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-21 08:05:31,468 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-21 08:05:31,468 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-07-21 08:05:31,468 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [831468296] [2022-07-21 08:05:31,468 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-21 08:05:31,469 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-07-21 08:05:31,469 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 08:05:31,469 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-07-21 08:05:31,469 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-07-21 08:05:31,470 INFO L87 Difference]: Start difference. First operand 4089 states and 5293 transitions. Second operand has 7 states, 7 states have (on average 8.285714285714286) internal successors, (58), 5 states have internal predecessors, (58), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-07-21 08:05:32,244 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 08:05:32,245 INFO L93 Difference]: Finished difference Result 5625 states and 7572 transitions. [2022-07-21 08:05:32,245 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-07-21 08:05:32,245 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 8.285714285714286) internal successors, (58), 5 states have internal predecessors, (58), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 69 [2022-07-21 08:05:32,245 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 08:05:32,267 INFO L225 Difference]: With dead ends: 5625 [2022-07-21 08:05:32,267 INFO L226 Difference]: Without dead ends: 4627 [2022-07-21 08:05:32,273 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=60, Invalid=122, Unknown=0, NotChecked=0, Total=182 [2022-07-21 08:05:32,274 INFO L413 NwaCegarLoop]: 314 mSDtfsCounter, 365 mSDsluCounter, 784 mSDsCounter, 0 mSdLazyCounter, 777 mSolverCounterSat, 76 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 365 SdHoareTripleChecker+Valid, 1098 SdHoareTripleChecker+Invalid, 853 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 76 IncrementalHoareTripleChecker+Valid, 777 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-07-21 08:05:32,274 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [365 Valid, 1098 Invalid, 853 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [76 Valid, 777 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-07-21 08:05:32,279 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4627 states. [2022-07-21 08:05:32,486 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4627 to 4116. [2022-07-21 08:05:32,490 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4116 states, 3277 states have (on average 1.3075984131827891) internal successors, (4285), 3336 states have internal predecessors, (4285), 426 states have call successors, (426), 334 states have call predecessors, (426), 411 states have return successors, (609), 455 states have call predecessors, (609), 422 states have call successors, (609) [2022-07-21 08:05:32,498 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4116 states to 4116 states and 5320 transitions. [2022-07-21 08:05:32,499 INFO L78 Accepts]: Start accepts. Automaton has 4116 states and 5320 transitions. Word has length 69 [2022-07-21 08:05:32,499 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 08:05:32,499 INFO L495 AbstractCegarLoop]: Abstraction has 4116 states and 5320 transitions. [2022-07-21 08:05:32,499 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 8.285714285714286) internal successors, (58), 5 states have internal predecessors, (58), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-07-21 08:05:32,500 INFO L276 IsEmpty]: Start isEmpty. Operand 4116 states and 5320 transitions. [2022-07-21 08:05:32,501 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2022-07-21 08:05:32,501 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 08:05:32,501 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-21 08:05:32,502 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2022-07-21 08:05:32,502 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-21 08:05:32,502 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 08:05:32,502 INFO L85 PathProgramCache]: Analyzing trace with hash 72670392, now seen corresponding path program 1 times [2022-07-21 08:05:32,503 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 08:05:32,503 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [458157623] [2022-07-21 08:05:32,503 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 08:05:32,503 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 08:05:32,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 08:05:32,523 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-07-21 08:05:32,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 08:05:32,536 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-07-21 08:05:32,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 08:05:32,544 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2022-07-21 08:05:32,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 08:05:32,599 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2022-07-21 08:05:32,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 08:05:32,605 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2022-07-21 08:05:32,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 08:05:32,608 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-21 08:05:32,608 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 08:05:32,608 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [458157623] [2022-07-21 08:05:32,608 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [458157623] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-21 08:05:32,608 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-21 08:05:32,609 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-07-21 08:05:32,609 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1051288058] [2022-07-21 08:05:32,609 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-21 08:05:32,609 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-07-21 08:05:32,609 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 08:05:32,610 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-07-21 08:05:32,610 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2022-07-21 08:05:32,610 INFO L87 Difference]: Start difference. First operand 4116 states and 5320 transitions. Second operand has 7 states, 7 states have (on average 8.285714285714286) internal successors, (58), 5 states have internal predecessors, (58), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-07-21 08:05:34,035 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 08:05:34,035 INFO L93 Difference]: Finished difference Result 7610 states and 10576 transitions. [2022-07-21 08:05:34,035 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2022-07-21 08:05:34,035 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 8.285714285714286) internal successors, (58), 5 states have internal predecessors, (58), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 69 [2022-07-21 08:05:34,036 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 08:05:34,055 INFO L225 Difference]: With dead ends: 7610 [2022-07-21 08:05:34,055 INFO L226 Difference]: Without dead ends: 6585 [2022-07-21 08:05:34,062 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 52 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=87, Invalid=219, Unknown=0, NotChecked=0, Total=306 [2022-07-21 08:05:34,062 INFO L413 NwaCegarLoop]: 491 mSDtfsCounter, 1371 mSDsluCounter, 618 mSDsCounter, 0 mSdLazyCounter, 1038 mSolverCounterSat, 348 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1395 SdHoareTripleChecker+Valid, 1109 SdHoareTripleChecker+Invalid, 1386 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 348 IncrementalHoareTripleChecker+Valid, 1038 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2022-07-21 08:05:34,063 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1395 Valid, 1109 Invalid, 1386 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [348 Valid, 1038 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2022-07-21 08:05:34,068 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6585 states. [2022-07-21 08:05:34,406 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6585 to 6034. [2022-07-21 08:05:34,413 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6034 states, 4873 states have (on average 1.3435255489431561) internal successors, (6547), 4963 states have internal predecessors, (6547), 618 states have call successors, (618), 448 states have call predecessors, (618), 541 states have return successors, (918), 632 states have call predecessors, (918), 614 states have call successors, (918) [2022-07-21 08:05:34,428 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6034 states to 6034 states and 8083 transitions. [2022-07-21 08:05:34,429 INFO L78 Accepts]: Start accepts. Automaton has 6034 states and 8083 transitions. Word has length 69 [2022-07-21 08:05:34,430 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 08:05:34,430 INFO L495 AbstractCegarLoop]: Abstraction has 6034 states and 8083 transitions. [2022-07-21 08:05:34,430 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 8.285714285714286) internal successors, (58), 5 states have internal predecessors, (58), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-07-21 08:05:34,430 INFO L276 IsEmpty]: Start isEmpty. Operand 6034 states and 8083 transitions. [2022-07-21 08:05:34,432 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2022-07-21 08:05:34,432 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 08:05:34,432 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-21 08:05:34,433 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2022-07-21 08:05:34,433 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-21 08:05:34,433 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 08:05:34,433 INFO L85 PathProgramCache]: Analyzing trace with hash 867157537, now seen corresponding path program 1 times [2022-07-21 08:05:34,433 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 08:05:34,434 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [167524593] [2022-07-21 08:05:34,434 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 08:05:34,434 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 08:05:34,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 08:05:34,455 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-07-21 08:05:34,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 08:05:34,461 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-07-21 08:05:34,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 08:05:34,467 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-07-21 08:05:34,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 08:05:34,470 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 08:05:34,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 08:05:34,471 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-21 08:05:34,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 08:05:34,473 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2022-07-21 08:05:34,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 08:05:34,474 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2022-07-21 08:05:34,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 08:05:34,476 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-21 08:05:34,477 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 08:05:34,477 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [167524593] [2022-07-21 08:05:34,477 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [167524593] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-21 08:05:34,477 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-21 08:05:34,477 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-21 08:05:34,477 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1018334880] [2022-07-21 08:05:34,477 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-21 08:05:34,478 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-21 08:05:34,478 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 08:05:34,478 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-21 08:05:34,478 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-07-21 08:05:34,479 INFO L87 Difference]: Start difference. First operand 6034 states and 8083 transitions. Second operand has 6 states, 6 states have (on average 9.5) internal successors, (57), 3 states have internal predecessors, (57), 3 states have call successors, (8), 5 states have call predecessors, (8), 1 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2022-07-21 08:05:35,006 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 08:05:35,006 INFO L93 Difference]: Finished difference Result 9620 states and 12513 transitions. [2022-07-21 08:05:35,007 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-07-21 08:05:35,007 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 9.5) internal successors, (57), 3 states have internal predecessors, (57), 3 states have call successors, (8), 5 states have call predecessors, (8), 1 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) Word has length 72 [2022-07-21 08:05:35,007 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 08:05:35,027 INFO L225 Difference]: With dead ends: 9620 [2022-07-21 08:05:35,027 INFO L226 Difference]: Without dead ends: 6550 [2022-07-21 08:05:35,036 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=39, Invalid=71, Unknown=0, NotChecked=0, Total=110 [2022-07-21 08:05:35,037 INFO L413 NwaCegarLoop]: 333 mSDtfsCounter, 572 mSDsluCounter, 504 mSDsCounter, 0 mSdLazyCounter, 272 mSolverCounterSat, 110 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 596 SdHoareTripleChecker+Valid, 837 SdHoareTripleChecker+Invalid, 382 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 110 IncrementalHoareTripleChecker+Valid, 272 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-07-21 08:05:35,037 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [596 Valid, 837 Invalid, 382 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [110 Valid, 272 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-07-21 08:05:35,042 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6550 states. [2022-07-21 08:05:35,335 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6550 to 6317. [2022-07-21 08:05:35,341 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6317 states, 5098 states have (on average 1.3367987446057277) internal successors, (6815), 5191 states have internal predecessors, (6815), 646 states have call successors, (646), 473 states have call predecessors, (646), 571 states have return successors, (952), 662 states have call predecessors, (952), 642 states have call successors, (952) [2022-07-21 08:05:35,356 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6317 states to 6317 states and 8413 transitions. [2022-07-21 08:05:35,357 INFO L78 Accepts]: Start accepts. Automaton has 6317 states and 8413 transitions. Word has length 72 [2022-07-21 08:05:35,357 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 08:05:35,357 INFO L495 AbstractCegarLoop]: Abstraction has 6317 states and 8413 transitions. [2022-07-21 08:05:35,358 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 9.5) internal successors, (57), 3 states have internal predecessors, (57), 3 states have call successors, (8), 5 states have call predecessors, (8), 1 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2022-07-21 08:05:35,358 INFO L276 IsEmpty]: Start isEmpty. Operand 6317 states and 8413 transitions. [2022-07-21 08:05:35,360 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2022-07-21 08:05:35,360 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 08:05:35,360 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-21 08:05:35,360 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2022-07-21 08:05:35,360 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-21 08:05:35,361 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 08:05:35,361 INFO L85 PathProgramCache]: Analyzing trace with hash 595856072, now seen corresponding path program 1 times [2022-07-21 08:05:35,361 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 08:05:35,361 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1625867571] [2022-07-21 08:05:35,361 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 08:05:35,361 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 08:05:35,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 08:05:35,389 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-07-21 08:05:35,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 08:05:35,395 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-07-21 08:05:35,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 08:05:35,402 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-07-21 08:05:35,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 08:05:35,404 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 08:05:35,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 08:05:35,405 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-21 08:05:35,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 08:05:35,406 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2022-07-21 08:05:35,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 08:05:35,407 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2022-07-21 08:05:35,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 08:05:35,409 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-21 08:05:35,409 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 08:05:35,409 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1625867571] [2022-07-21 08:05:35,409 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1625867571] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-21 08:05:35,409 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-21 08:05:35,410 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-07-21 08:05:35,410 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [962051523] [2022-07-21 08:05:35,410 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-21 08:05:35,410 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-07-21 08:05:35,410 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 08:05:35,411 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-07-21 08:05:35,411 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2022-07-21 08:05:35,411 INFO L87 Difference]: Start difference. First operand 6317 states and 8413 transitions. Second operand has 7 states, 7 states have (on average 8.285714285714286) internal successors, (58), 4 states have internal predecessors, (58), 2 states have call successors, (8), 5 states have call predecessors, (8), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) [2022-07-21 08:05:36,066 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 08:05:36,066 INFO L93 Difference]: Finished difference Result 7371 states and 9680 transitions. [2022-07-21 08:05:36,066 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-07-21 08:05:36,067 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 8.285714285714286) internal successors, (58), 4 states have internal predecessors, (58), 2 states have call successors, (8), 5 states have call predecessors, (8), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) Word has length 73 [2022-07-21 08:05:36,067 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 08:05:36,085 INFO L225 Difference]: With dead ends: 7371 [2022-07-21 08:05:36,085 INFO L226 Difference]: Without dead ends: 7368 [2022-07-21 08:05:36,087 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=69, Invalid=141, Unknown=0, NotChecked=0, Total=210 [2022-07-21 08:05:36,088 INFO L413 NwaCegarLoop]: 329 mSDtfsCounter, 890 mSDsluCounter, 487 mSDsCounter, 0 mSdLazyCounter, 290 mSolverCounterSat, 246 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 900 SdHoareTripleChecker+Valid, 816 SdHoareTripleChecker+Invalid, 536 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 246 IncrementalHoareTripleChecker+Valid, 290 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-07-21 08:05:36,088 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [900 Valid, 816 Invalid, 536 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [246 Valid, 290 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-07-21 08:05:36,093 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7368 states. [2022-07-21 08:05:36,428 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7368 to 7074. [2022-07-21 08:05:36,436 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7074 states, 5676 states have (on average 1.3238195912614517) internal successors, (7514), 5776 states have internal predecessors, (7514), 729 states have call successors, (729), 545 states have call predecessors, (729), 667 states have return successors, (1080), 762 states have call predecessors, (1080), 726 states have call successors, (1080) [2022-07-21 08:05:36,454 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7074 states to 7074 states and 9323 transitions. [2022-07-21 08:05:36,456 INFO L78 Accepts]: Start accepts. Automaton has 7074 states and 9323 transitions. Word has length 73 [2022-07-21 08:05:36,456 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 08:05:36,456 INFO L495 AbstractCegarLoop]: Abstraction has 7074 states and 9323 transitions. [2022-07-21 08:05:36,456 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 8.285714285714286) internal successors, (58), 4 states have internal predecessors, (58), 2 states have call successors, (8), 5 states have call predecessors, (8), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) [2022-07-21 08:05:36,456 INFO L276 IsEmpty]: Start isEmpty. Operand 7074 states and 9323 transitions. [2022-07-21 08:05:36,458 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2022-07-21 08:05:36,459 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 08:05:36,459 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-21 08:05:36,459 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2022-07-21 08:05:36,459 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-21 08:05:36,459 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 08:05:36,459 INFO L85 PathProgramCache]: Analyzing trace with hash 1290941259, now seen corresponding path program 1 times [2022-07-21 08:05:36,460 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 08:05:36,460 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [254416537] [2022-07-21 08:05:36,460 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 08:05:36,460 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 08:05:36,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 08:05:36,514 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-07-21 08:05:36,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 08:05:36,522 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-07-21 08:05:36,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 08:05:36,530 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-07-21 08:05:36,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 08:05:36,537 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 08:05:36,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 08:05:36,539 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-21 08:05:36,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 08:05:36,540 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2022-07-21 08:05:36,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 08:05:36,541 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2022-07-21 08:05:36,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 08:05:36,543 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-21 08:05:36,544 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 08:05:36,544 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [254416537] [2022-07-21 08:05:36,544 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [254416537] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-21 08:05:36,544 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1479439653] [2022-07-21 08:05:36,544 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 08:05:36,544 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-21 08:05:36,545 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-21 08:05:36,551 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-21 08:05:36,580 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-07-21 08:05:36,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 08:05:36,653 INFO L263 TraceCheckSpWp]: Trace formula consists of 305 conjuncts, 9 conjunts are in the unsatisfiable core [2022-07-21 08:05:36,660 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-21 08:05:37,063 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-21 08:05:37,063 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-21 08:05:37,201 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-21 08:05:37,202 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1479439653] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-21 08:05:37,202 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-21 08:05:37,202 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 5, 4] total 10 [2022-07-21 08:05:37,202 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1942201748] [2022-07-21 08:05:37,202 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-21 08:05:37,203 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-07-21 08:05:37,203 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 08:05:37,203 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-07-21 08:05:37,204 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2022-07-21 08:05:37,204 INFO L87 Difference]: Start difference. First operand 7074 states and 9323 transitions. Second operand has 10 states, 10 states have (on average 12.0) internal successors, (120), 7 states have internal predecessors, (120), 4 states have call successors, (20), 6 states have call predecessors, (20), 2 states have return successors, (19), 3 states have call predecessors, (19), 3 states have call successors, (19) [2022-07-21 08:05:38,966 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 08:05:38,966 INFO L93 Difference]: Finished difference Result 11493 states and 14697 transitions. [2022-07-21 08:05:38,966 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2022-07-21 08:05:38,966 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 12.0) internal successors, (120), 7 states have internal predecessors, (120), 4 states have call successors, (20), 6 states have call predecessors, (20), 2 states have return successors, (19), 3 states have call predecessors, (19), 3 states have call successors, (19) Word has length 74 [2022-07-21 08:05:38,967 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 08:05:39,006 INFO L225 Difference]: With dead ends: 11493 [2022-07-21 08:05:39,007 INFO L226 Difference]: Without dead ends: 11490 [2022-07-21 08:05:39,014 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 203 GetRequests, 174 SyntacticMatches, 2 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 189 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=170, Invalid=642, Unknown=0, NotChecked=0, Total=812 [2022-07-21 08:05:39,015 INFO L413 NwaCegarLoop]: 479 mSDtfsCounter, 1263 mSDsluCounter, 1221 mSDsCounter, 0 mSdLazyCounter, 1398 mSolverCounterSat, 264 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1319 SdHoareTripleChecker+Valid, 1700 SdHoareTripleChecker+Invalid, 1662 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 264 IncrementalHoareTripleChecker+Valid, 1398 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2022-07-21 08:05:39,015 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1319 Valid, 1700 Invalid, 1662 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [264 Valid, 1398 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2022-07-21 08:05:39,025 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11490 states. [2022-07-21 08:05:39,728 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11490 to 10633. [2022-07-21 08:05:39,738 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10633 states, 8461 states have (on average 1.2938186975534807) internal successors, (10947), 8612 states have internal predecessors, (10947), 1099 states have call successors, (1099), 870 states have call predecessors, (1099), 1071 states have return successors, (1626), 1160 states have call predecessors, (1626), 1096 states have call successors, (1626) [2022-07-21 08:05:39,763 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10633 states to 10633 states and 13672 transitions. [2022-07-21 08:05:39,766 INFO L78 Accepts]: Start accepts. Automaton has 10633 states and 13672 transitions. Word has length 74 [2022-07-21 08:05:39,766 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 08:05:39,766 INFO L495 AbstractCegarLoop]: Abstraction has 10633 states and 13672 transitions. [2022-07-21 08:05:39,767 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 12.0) internal successors, (120), 7 states have internal predecessors, (120), 4 states have call successors, (20), 6 states have call predecessors, (20), 2 states have return successors, (19), 3 states have call predecessors, (19), 3 states have call successors, (19) [2022-07-21 08:05:39,767 INFO L276 IsEmpty]: Start isEmpty. Operand 10633 states and 13672 transitions. [2022-07-21 08:05:39,771 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2022-07-21 08:05:39,771 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 08:05:39,772 INFO L195 NwaCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-21 08:05:39,803 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-07-21 08:05:39,990 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-21 08:05:39,990 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-21 08:05:39,990 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 08:05:39,990 INFO L85 PathProgramCache]: Analyzing trace with hash 372887048, now seen corresponding path program 2 times [2022-07-21 08:05:39,991 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 08:05:39,991 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [710573920] [2022-07-21 08:05:39,991 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 08:05:39,991 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 08:05:40,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 08:05:40,028 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-07-21 08:05:40,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 08:05:40,035 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-07-21 08:05:40,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 08:05:40,041 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-07-21 08:05:40,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 08:05:40,043 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 08:05:40,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 08:05:40,044 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-21 08:05:40,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 08:05:40,045 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2022-07-21 08:05:40,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 08:05:40,046 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2022-07-21 08:05:40,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 08:05:40,049 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-21 08:05:40,049 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 08:05:40,049 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [710573920] [2022-07-21 08:05:40,049 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [710573920] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-21 08:05:40,049 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-21 08:05:40,049 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-21 08:05:40,050 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [156498443] [2022-07-21 08:05:40,050 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-21 08:05:40,050 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-21 08:05:40,050 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 08:05:40,051 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-21 08:05:40,051 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-07-21 08:05:40,051 INFO L87 Difference]: Start difference. First operand 10633 states and 13672 transitions. Second operand has 6 states, 6 states have (on average 10.333333333333334) internal successors, (62), 3 states have internal predecessors, (62), 2 states have call successors, (8), 5 states have call predecessors, (8), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) [2022-07-21 08:05:40,783 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 08:05:40,783 INFO L93 Difference]: Finished difference Result 13642 states and 17396 transitions. [2022-07-21 08:05:40,784 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-07-21 08:05:40,784 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 10.333333333333334) internal successors, (62), 3 states have internal predecessors, (62), 2 states have call successors, (8), 5 states have call predecessors, (8), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) Word has length 77 [2022-07-21 08:05:40,785 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 08:05:40,805 INFO L225 Difference]: With dead ends: 13642 [2022-07-21 08:05:40,806 INFO L226 Difference]: Without dead ends: 6844 [2022-07-21 08:05:40,819 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2022-07-21 08:05:40,820 INFO L413 NwaCegarLoop]: 362 mSDtfsCounter, 522 mSDsluCounter, 532 mSDsCounter, 0 mSdLazyCounter, 292 mSolverCounterSat, 96 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 548 SdHoareTripleChecker+Valid, 894 SdHoareTripleChecker+Invalid, 388 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 96 IncrementalHoareTripleChecker+Valid, 292 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-07-21 08:05:40,820 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [548 Valid, 894 Invalid, 388 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [96 Valid, 292 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-07-21 08:05:40,825 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6844 states. [2022-07-21 08:05:41,144 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6844 to 5818. [2022-07-21 08:05:41,149 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5818 states, 4712 states have (on average 1.330220713073005) internal successors, (6268), 4785 states have internal predecessors, (6268), 599 states have call successors, (599), 435 states have call predecessors, (599), 505 states have return successors, (852), 607 states have call predecessors, (852), 596 states have call successors, (852) [2022-07-21 08:05:41,157 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5818 states to 5818 states and 7719 transitions. [2022-07-21 08:05:41,159 INFO L78 Accepts]: Start accepts. Automaton has 5818 states and 7719 transitions. Word has length 77 [2022-07-21 08:05:41,159 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 08:05:41,159 INFO L495 AbstractCegarLoop]: Abstraction has 5818 states and 7719 transitions. [2022-07-21 08:05:41,159 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 10.333333333333334) internal successors, (62), 3 states have internal predecessors, (62), 2 states have call successors, (8), 5 states have call predecessors, (8), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) [2022-07-21 08:05:41,159 INFO L276 IsEmpty]: Start isEmpty. Operand 5818 states and 7719 transitions. [2022-07-21 08:05:41,163 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2022-07-21 08:05:41,163 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 08:05:41,163 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-21 08:05:41,164 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2022-07-21 08:05:41,164 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-21 08:05:41,164 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 08:05:41,164 INFO L85 PathProgramCache]: Analyzing trace with hash -1502182211, now seen corresponding path program 1 times [2022-07-21 08:05:41,165 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 08:05:41,165 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1205431400] [2022-07-21 08:05:41,165 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 08:05:41,165 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 08:05:41,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 08:05:41,194 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-07-21 08:05:41,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 08:05:41,207 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-07-21 08:05:41,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 08:05:41,214 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-07-21 08:05:41,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 08:05:41,216 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 08:05:41,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 08:05:41,217 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-21 08:05:41,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 08:05:41,218 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2022-07-21 08:05:41,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 08:05:41,219 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2022-07-21 08:05:41,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 08:05:41,221 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2022-07-21 08:05:41,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 08:05:41,222 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2022-07-21 08:05:41,222 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 08:05:41,223 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1205431400] [2022-07-21 08:05:41,223 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1205431400] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-21 08:05:41,223 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-21 08:05:41,223 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-07-21 08:05:41,223 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1937907164] [2022-07-21 08:05:41,223 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-21 08:05:41,224 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-07-21 08:05:41,224 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 08:05:41,224 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-07-21 08:05:41,224 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2022-07-21 08:05:41,225 INFO L87 Difference]: Start difference. First operand 5818 states and 7719 transitions. Second operand has 8 states, 8 states have (on average 7.875) internal successors, (63), 5 states have internal predecessors, (63), 4 states have call successors, (9), 5 states have call predecessors, (9), 2 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) [2022-07-21 08:05:42,363 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 08:05:42,363 INFO L93 Difference]: Finished difference Result 11542 states and 14643 transitions. [2022-07-21 08:05:42,365 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2022-07-21 08:05:42,365 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 7.875) internal successors, (63), 5 states have internal predecessors, (63), 4 states have call successors, (9), 5 states have call predecessors, (9), 2 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) Word has length 84 [2022-07-21 08:05:42,366 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 08:05:42,390 INFO L225 Difference]: With dead ends: 11542 [2022-07-21 08:05:42,390 INFO L226 Difference]: Without dead ends: 7746 [2022-07-21 08:05:42,401 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 94 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=131, Invalid=331, Unknown=0, NotChecked=0, Total=462 [2022-07-21 08:05:42,402 INFO L413 NwaCegarLoop]: 364 mSDtfsCounter, 711 mSDsluCounter, 834 mSDsCounter, 0 mSdLazyCounter, 691 mSolverCounterSat, 211 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 723 SdHoareTripleChecker+Valid, 1198 SdHoareTripleChecker+Invalid, 902 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 211 IncrementalHoareTripleChecker+Valid, 691 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-07-21 08:05:42,402 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [723 Valid, 1198 Invalid, 902 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [211 Valid, 691 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-07-21 08:05:42,407 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7746 states. [2022-07-21 08:05:42,955 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7746 to 7515. [2022-07-21 08:05:42,961 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7515 states, 6006 states have (on average 1.2938727938727939) internal successors, (7771), 6116 states have internal predecessors, (7771), 783 states have call successors, (783), 593 states have call predecessors, (783), 724 states have return successors, (1173), 815 states have call predecessors, (1173), 780 states have call successors, (1173) [2022-07-21 08:05:42,975 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7515 states to 7515 states and 9727 transitions. [2022-07-21 08:05:42,977 INFO L78 Accepts]: Start accepts. Automaton has 7515 states and 9727 transitions. Word has length 84 [2022-07-21 08:05:42,977 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 08:05:42,977 INFO L495 AbstractCegarLoop]: Abstraction has 7515 states and 9727 transitions. [2022-07-21 08:05:42,977 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 7.875) internal successors, (63), 5 states have internal predecessors, (63), 4 states have call successors, (9), 5 states have call predecessors, (9), 2 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) [2022-07-21 08:05:42,977 INFO L276 IsEmpty]: Start isEmpty. Operand 7515 states and 9727 transitions. [2022-07-21 08:05:42,982 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2022-07-21 08:05:42,983 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 08:05:42,983 INFO L195 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-21 08:05:42,983 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2022-07-21 08:05:42,984 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-21 08:05:42,984 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 08:05:42,984 INFO L85 PathProgramCache]: Analyzing trace with hash 905485990, now seen corresponding path program 1 times [2022-07-21 08:05:42,984 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 08:05:42,984 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [40025105] [2022-07-21 08:05:42,985 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 08:05:42,985 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 08:05:42,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 08:05:43,017 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-07-21 08:05:43,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 08:05:43,030 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-07-21 08:05:43,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 08:05:43,037 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-07-21 08:05:43,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 08:05:43,041 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 08:05:43,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 08:05:43,042 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-21 08:05:43,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 08:05:43,043 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2022-07-21 08:05:43,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 08:05:43,045 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2022-07-21 08:05:43,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 08:05:43,047 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2022-07-21 08:05:43,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 08:05:43,054 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 18 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-07-21 08:05:43,054 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 08:05:43,054 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [40025105] [2022-07-21 08:05:43,055 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [40025105] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-21 08:05:43,055 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-21 08:05:43,055 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-07-21 08:05:43,055 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [131783350] [2022-07-21 08:05:43,055 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-21 08:05:43,056 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-07-21 08:05:43,056 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 08:05:43,056 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-07-21 08:05:43,057 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2022-07-21 08:05:43,057 INFO L87 Difference]: Start difference. First operand 7515 states and 9727 transitions. Second operand has 9 states, 9 states have (on average 8.222222222222221) internal successors, (74), 6 states have internal predecessors, (74), 4 states have call successors, (9), 5 states have call predecessors, (9), 3 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) [2022-07-21 08:05:44,211 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 08:05:44,211 INFO L93 Difference]: Finished difference Result 10394 states and 13211 transitions. [2022-07-21 08:05:44,213 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2022-07-21 08:05:44,213 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 8.222222222222221) internal successors, (74), 6 states have internal predecessors, (74), 4 states have call successors, (9), 5 states have call predecessors, (9), 3 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) Word has length 93 [2022-07-21 08:05:44,213 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 08:05:44,234 INFO L225 Difference]: With dead ends: 10394 [2022-07-21 08:05:44,234 INFO L226 Difference]: Without dead ends: 6580 [2022-07-21 08:05:44,246 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 156 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=162, Invalid=540, Unknown=0, NotChecked=0, Total=702 [2022-07-21 08:05:44,246 INFO L413 NwaCegarLoop]: 352 mSDtfsCounter, 1360 mSDsluCounter, 702 mSDsCounter, 0 mSdLazyCounter, 787 mSolverCounterSat, 364 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1389 SdHoareTripleChecker+Valid, 1054 SdHoareTripleChecker+Invalid, 1151 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 364 IncrementalHoareTripleChecker+Valid, 787 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-07-21 08:05:44,247 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1389 Valid, 1054 Invalid, 1151 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [364 Valid, 787 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-07-21 08:05:44,252 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6580 states. [2022-07-21 08:05:44,706 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6580 to 6203. [2022-07-21 08:05:44,713 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6203 states, 4978 states have (on average 1.3045399758939333) internal successors, (6494), 5071 states have internal predecessors, (6494), 641 states have call successors, (641), 469 states have call predecessors, (641), 582 states have return successors, (938), 672 states have call predecessors, (938), 638 states have call successors, (938) [2022-07-21 08:05:44,724 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6203 states to 6203 states and 8073 transitions. [2022-07-21 08:05:44,725 INFO L78 Accepts]: Start accepts. Automaton has 6203 states and 8073 transitions. Word has length 93 [2022-07-21 08:05:44,725 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 08:05:44,726 INFO L495 AbstractCegarLoop]: Abstraction has 6203 states and 8073 transitions. [2022-07-21 08:05:44,726 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 8.222222222222221) internal successors, (74), 6 states have internal predecessors, (74), 4 states have call successors, (9), 5 states have call predecessors, (9), 3 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) [2022-07-21 08:05:44,726 INFO L276 IsEmpty]: Start isEmpty. Operand 6203 states and 8073 transitions. [2022-07-21 08:05:44,732 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2022-07-21 08:05:44,732 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 08:05:44,733 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-21 08:05:44,733 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2022-07-21 08:05:44,733 INFO L420 AbstractCegarLoop]: === Iteration 23 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-21 08:05:44,733 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 08:05:44,734 INFO L85 PathProgramCache]: Analyzing trace with hash -33791116, now seen corresponding path program 1 times [2022-07-21 08:05:44,734 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 08:05:44,734 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [651799125] [2022-07-21 08:05:44,734 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 08:05:44,734 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 08:05:44,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 08:05:44,749 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-07-21 08:05:44,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 08:05:44,757 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-07-21 08:05:44,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 08:05:44,764 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2022-07-21 08:05:44,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 08:05:44,796 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2022-07-21 08:05:44,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 08:05:44,799 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2022-07-21 08:05:44,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 08:05:44,801 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2022-07-21 08:05:44,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 08:05:44,804 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-07-21 08:05:44,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 08:05:44,807 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2022-07-21 08:05:44,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 08:05:44,808 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2022-07-21 08:05:44,808 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 08:05:44,808 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [651799125] [2022-07-21 08:05:44,809 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [651799125] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-21 08:05:44,809 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [408662211] [2022-07-21 08:05:44,809 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 08:05:44,809 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-21 08:05:44,809 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-21 08:05:44,811 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-21 08:05:44,845 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-07-21 08:05:44,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 08:05:44,910 INFO L263 TraceCheckSpWp]: Trace formula consists of 414 conjuncts, 2 conjunts are in the unsatisfiable core [2022-07-21 08:05:44,913 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-21 08:05:44,931 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2022-07-21 08:05:44,932 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-21 08:05:44,932 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [408662211] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-21 08:05:44,932 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-07-21 08:05:44,932 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [7] total 8 [2022-07-21 08:05:44,932 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1392198294] [2022-07-21 08:05:44,934 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-21 08:05:44,935 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-21 08:05:44,935 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 08:05:44,935 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-21 08:05:44,935 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2022-07-21 08:05:44,935 INFO L87 Difference]: Start difference. First operand 6203 states and 8073 transitions. Second operand has 3 states, 3 states have (on average 25.0) internal successors, (75), 3 states have internal predecessors, (75), 3 states have call successors, (9), 3 states have call predecessors, (9), 2 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2022-07-21 08:05:45,254 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 08:05:45,254 INFO L93 Difference]: Finished difference Result 9369 states and 12759 transitions. [2022-07-21 08:05:45,255 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-21 08:05:45,255 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 25.0) internal successors, (75), 3 states have internal predecessors, (75), 3 states have call successors, (9), 3 states have call predecessors, (9), 2 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) Word has length 111 [2022-07-21 08:05:45,255 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 08:05:45,276 INFO L225 Difference]: With dead ends: 9369 [2022-07-21 08:05:45,276 INFO L226 Difference]: Without dead ends: 6733 [2022-07-21 08:05:45,287 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 132 GetRequests, 126 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2022-07-21 08:05:45,288 INFO L413 NwaCegarLoop]: 465 mSDtfsCounter, 142 mSDsluCounter, 318 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 142 SdHoareTripleChecker+Valid, 783 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-21 08:05:45,288 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [142 Valid, 783 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-21 08:05:45,294 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6733 states. [2022-07-21 08:05:45,792 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6733 to 6733. [2022-07-21 08:05:45,797 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6733 states, 5425 states have (on average 1.3133640552995391) internal successors, (7125), 5522 states have internal predecessors, (7125), 690 states have call successors, (690), 499 states have call predecessors, (690), 616 states have return successors, (1016), 721 states have call predecessors, (1016), 687 states have call successors, (1016) [2022-07-21 08:05:45,810 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6733 states to 6733 states and 8831 transitions. [2022-07-21 08:05:45,812 INFO L78 Accepts]: Start accepts. Automaton has 6733 states and 8831 transitions. Word has length 111 [2022-07-21 08:05:45,812 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 08:05:45,812 INFO L495 AbstractCegarLoop]: Abstraction has 6733 states and 8831 transitions. [2022-07-21 08:05:45,812 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 25.0) internal successors, (75), 3 states have internal predecessors, (75), 3 states have call successors, (9), 3 states have call predecessors, (9), 2 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2022-07-21 08:05:45,812 INFO L276 IsEmpty]: Start isEmpty. Operand 6733 states and 8831 transitions. [2022-07-21 08:05:45,822 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 146 [2022-07-21 08:05:45,822 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 08:05:45,822 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-21 08:05:45,850 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2022-07-21 08:05:46,035 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable22 [2022-07-21 08:05:46,036 INFO L420 AbstractCegarLoop]: === Iteration 24 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-21 08:05:46,036 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 08:05:46,036 INFO L85 PathProgramCache]: Analyzing trace with hash -878802759, now seen corresponding path program 1 times [2022-07-21 08:05:46,036 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 08:05:46,036 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [512567245] [2022-07-21 08:05:46,036 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 08:05:46,036 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 08:05:46,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 08:05:46,074 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-07-21 08:05:46,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 08:05:46,083 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-07-21 08:05:46,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 08:05:46,092 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-07-21 08:05:46,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 08:05:46,096 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 08:05:46,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 08:05:46,097 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-21 08:05:46,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 08:05:46,098 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2022-07-21 08:05:46,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 08:05:46,099 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2022-07-21 08:05:46,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 08:05:46,100 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2022-07-21 08:05:46,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 08:05:46,115 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2022-07-21 08:05:46,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 08:05:46,117 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2022-07-21 08:05:46,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 08:05:46,118 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2022-07-21 08:05:46,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 08:05:46,129 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 08:05:46,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 08:05:46,131 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-21 08:05:46,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 08:05:46,132 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2022-07-21 08:05:46,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 08:05:46,133 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2022-07-21 08:05:46,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 08:05:46,134 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 125 [2022-07-21 08:05:46,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 08:05:46,136 INFO L134 CoverageAnalysis]: Checked inductivity of 80 backedges. 20 proven. 6 refuted. 0 times theorem prover too weak. 54 trivial. 0 not checked. [2022-07-21 08:05:46,137 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 08:05:46,137 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [512567245] [2022-07-21 08:05:46,137 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [512567245] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-21 08:05:46,137 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1890024128] [2022-07-21 08:05:46,137 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 08:05:46,138 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-21 08:05:46,138 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-21 08:05:46,139 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-21 08:05:46,140 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-07-21 08:05:46,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 08:05:46,231 INFO L263 TraceCheckSpWp]: Trace formula consists of 483 conjuncts, 5 conjunts are in the unsatisfiable core [2022-07-21 08:05:46,235 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-21 08:05:46,274 INFO L134 CoverageAnalysis]: Checked inductivity of 80 backedges. 71 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2022-07-21 08:05:46,279 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-21 08:05:46,280 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1890024128] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-21 08:05:46,280 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-07-21 08:05:46,280 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [10] total 12 [2022-07-21 08:05:46,280 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [501060308] [2022-07-21 08:05:46,280 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-21 08:05:46,281 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-21 08:05:46,281 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 08:05:46,281 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-21 08:05:46,281 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=108, Unknown=0, NotChecked=0, Total=132 [2022-07-21 08:05:46,282 INFO L87 Difference]: Start difference. First operand 6733 states and 8831 transitions. Second operand has 6 states, 6 states have (on average 17.666666666666668) internal successors, (106), 5 states have internal predecessors, (106), 2 states have call successors, (16), 2 states have call predecessors, (16), 3 states have return successors, (16), 3 states have call predecessors, (16), 2 states have call successors, (16) [2022-07-21 08:05:46,571 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 08:05:46,572 INFO L93 Difference]: Finished difference Result 8412 states and 10844 transitions. [2022-07-21 08:05:46,572 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-21 08:05:46,572 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 17.666666666666668) internal successors, (106), 5 states have internal predecessors, (106), 2 states have call successors, (16), 2 states have call predecessors, (16), 3 states have return successors, (16), 3 states have call predecessors, (16), 2 states have call successors, (16) Word has length 145 [2022-07-21 08:05:46,572 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 08:05:46,586 INFO L225 Difference]: With dead ends: 8412 [2022-07-21 08:05:46,586 INFO L226 Difference]: Without dead ends: 5175 [2022-07-21 08:05:46,593 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 185 GetRequests, 173 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=34, Invalid=148, Unknown=0, NotChecked=0, Total=182 [2022-07-21 08:05:46,594 INFO L413 NwaCegarLoop]: 323 mSDtfsCounter, 34 mSDsluCounter, 1252 mSDsCounter, 0 mSdLazyCounter, 27 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 36 SdHoareTripleChecker+Valid, 1575 SdHoareTripleChecker+Invalid, 28 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 27 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-21 08:05:46,594 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [36 Valid, 1575 Invalid, 28 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 27 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-21 08:05:46,598 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5175 states. [2022-07-21 08:05:46,919 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5175 to 5052. [2022-07-21 08:05:46,923 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5052 states, 4186 states have (on average 1.3509316770186335) internal successors, (5655), 4244 states have internal predecessors, (5655), 482 states have call successors, (482), 316 states have call predecessors, (482), 382 states have return successors, (722), 499 states have call predecessors, (722), 479 states have call successors, (722) [2022-07-21 08:05:46,930 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5052 states to 5052 states and 6859 transitions. [2022-07-21 08:05:46,931 INFO L78 Accepts]: Start accepts. Automaton has 5052 states and 6859 transitions. Word has length 145 [2022-07-21 08:05:46,931 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 08:05:46,931 INFO L495 AbstractCegarLoop]: Abstraction has 5052 states and 6859 transitions. [2022-07-21 08:05:46,931 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 17.666666666666668) internal successors, (106), 5 states have internal predecessors, (106), 2 states have call successors, (16), 2 states have call predecessors, (16), 3 states have return successors, (16), 3 states have call predecessors, (16), 2 states have call successors, (16) [2022-07-21 08:05:46,931 INFO L276 IsEmpty]: Start isEmpty. Operand 5052 states and 6859 transitions. [2022-07-21 08:05:46,938 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2022-07-21 08:05:46,938 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 08:05:46,938 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-21 08:05:46,955 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2022-07-21 08:05:47,143 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-21 08:05:47,144 INFO L420 AbstractCegarLoop]: === Iteration 25 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-21 08:05:47,144 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 08:05:47,144 INFO L85 PathProgramCache]: Analyzing trace with hash -1647944136, now seen corresponding path program 1 times [2022-07-21 08:05:47,144 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 08:05:47,144 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1746368800] [2022-07-21 08:05:47,144 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 08:05:47,144 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 08:05:47,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 08:05:47,159 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-07-21 08:05:47,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 08:05:47,168 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-07-21 08:05:47,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 08:05:47,175 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2022-07-21 08:05:47,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 08:05:47,204 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2022-07-21 08:05:47,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 08:05:47,207 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2022-07-21 08:05:47,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 08:05:47,208 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2022-07-21 08:05:47,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 08:05:47,211 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-07-21 08:05:47,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 08:05:47,214 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2022-07-21 08:05:47,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 08:05:47,217 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-07-21 08:05:47,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 08:05:47,219 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2022-07-21 08:05:47,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 08:05:47,221 INFO L134 CoverageAnalysis]: Checked inductivity of 71 backedges. 0 proven. 22 refuted. 0 times theorem prover too weak. 49 trivial. 0 not checked. [2022-07-21 08:05:47,221 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 08:05:47,221 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1746368800] [2022-07-21 08:05:47,221 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1746368800] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-21 08:05:47,222 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1043079447] [2022-07-21 08:05:47,222 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 08:05:47,222 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-21 08:05:47,222 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-21 08:05:47,223 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-21 08:05:47,239 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2022-07-21 08:05:47,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 08:05:47,318 INFO L263 TraceCheckSpWp]: Trace formula consists of 512 conjuncts, 2 conjunts are in the unsatisfiable core [2022-07-21 08:05:47,323 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-21 08:05:47,428 INFO L134 CoverageAnalysis]: Checked inductivity of 71 backedges. 51 proven. 0 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2022-07-21 08:05:47,428 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-21 08:05:47,429 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1043079447] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-21 08:05:47,429 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-07-21 08:05:47,429 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [7] total 8 [2022-07-21 08:05:47,429 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [802463796] [2022-07-21 08:05:47,429 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-21 08:05:47,430 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-21 08:05:47,430 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 08:05:47,430 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-21 08:05:47,430 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2022-07-21 08:05:47,431 INFO L87 Difference]: Start difference. First operand 5052 states and 6859 transitions. Second operand has 3 states, 3 states have (on average 34.333333333333336) internal successors, (103), 2 states have internal predecessors, (103), 2 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) [2022-07-21 08:05:47,797 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 08:05:47,797 INFO L93 Difference]: Finished difference Result 11808 states and 16744 transitions. [2022-07-21 08:05:47,797 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-21 08:05:47,798 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 34.333333333333336) internal successors, (103), 2 states have internal predecessors, (103), 2 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) Word has length 143 [2022-07-21 08:05:47,798 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 08:05:47,821 INFO L225 Difference]: With dead ends: 11808 [2022-07-21 08:05:47,822 INFO L226 Difference]: Without dead ends: 8335 [2022-07-21 08:05:47,835 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 168 GetRequests, 162 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2022-07-21 08:05:47,836 INFO L413 NwaCegarLoop]: 331 mSDtfsCounter, 235 mSDsluCounter, 170 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 235 SdHoareTripleChecker+Valid, 501 SdHoareTripleChecker+Invalid, 12 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-21 08:05:47,837 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [235 Valid, 501 Invalid, 12 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-21 08:05:47,843 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8335 states. [2022-07-21 08:05:48,427 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8335 to 8265. [2022-07-21 08:05:48,433 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8265 states, 6889 states have (on average 1.379445492814632) internal successors, (9503), 6990 states have internal predecessors, (9503), 774 states have call successors, (774), 506 states have call predecessors, (774), 600 states have return successors, (1166), 776 states have call predecessors, (1166), 771 states have call successors, (1166) [2022-07-21 08:05:48,450 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8265 states to 8265 states and 11443 transitions. [2022-07-21 08:05:48,451 INFO L78 Accepts]: Start accepts. Automaton has 8265 states and 11443 transitions. Word has length 143 [2022-07-21 08:05:48,452 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 08:05:48,452 INFO L495 AbstractCegarLoop]: Abstraction has 8265 states and 11443 transitions. [2022-07-21 08:05:48,452 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 34.333333333333336) internal successors, (103), 2 states have internal predecessors, (103), 2 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) [2022-07-21 08:05:48,452 INFO L276 IsEmpty]: Start isEmpty. Operand 8265 states and 11443 transitions. [2022-07-21 08:05:48,464 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2022-07-21 08:05:48,464 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 08:05:48,464 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-21 08:05:48,481 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2022-07-21 08:05:48,665 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-21 08:05:48,665 INFO L420 AbstractCegarLoop]: === Iteration 26 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-21 08:05:48,665 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 08:05:48,665 INFO L85 PathProgramCache]: Analyzing trace with hash -1613614096, now seen corresponding path program 1 times [2022-07-21 08:05:48,666 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 08:05:48,666 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [192831143] [2022-07-21 08:05:48,666 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 08:05:48,666 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 08:05:48,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 08:05:48,687 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-07-21 08:05:48,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 08:05:48,696 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-07-21 08:05:48,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 08:05:48,703 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2022-07-21 08:05:48,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 08:05:48,735 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2022-07-21 08:05:48,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 08:05:48,737 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2022-07-21 08:05:48,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 08:05:48,739 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2022-07-21 08:05:48,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 08:05:48,742 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-07-21 08:05:48,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 08:05:48,745 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2022-07-21 08:05:48,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 08:05:48,749 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-07-21 08:05:48,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 08:05:48,753 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2022-07-21 08:05:48,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 08:05:48,755 INFO L134 CoverageAnalysis]: Checked inductivity of 71 backedges. 0 proven. 22 refuted. 0 times theorem prover too weak. 49 trivial. 0 not checked. [2022-07-21 08:05:48,755 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 08:05:48,756 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [192831143] [2022-07-21 08:05:48,756 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [192831143] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-21 08:05:48,756 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1218527629] [2022-07-21 08:05:48,756 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 08:05:48,756 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-21 08:05:48,757 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-21 08:05:48,758 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-21 08:05:48,759 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2022-07-21 08:05:48,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 08:05:48,849 INFO L263 TraceCheckSpWp]: Trace formula consists of 512 conjuncts, 2 conjunts are in the unsatisfiable core [2022-07-21 08:05:48,852 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-21 08:05:48,972 INFO L134 CoverageAnalysis]: Checked inductivity of 71 backedges. 51 proven. 0 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2022-07-21 08:05:48,972 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-21 08:05:48,973 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1218527629] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-21 08:05:48,973 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-07-21 08:05:48,973 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [7] total 8 [2022-07-21 08:05:48,973 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1535371583] [2022-07-21 08:05:48,973 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-21 08:05:48,974 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-21 08:05:48,974 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 08:05:48,974 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-21 08:05:48,975 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2022-07-21 08:05:48,975 INFO L87 Difference]: Start difference. First operand 8265 states and 11443 transitions. Second operand has 3 states, 3 states have (on average 34.333333333333336) internal successors, (103), 2 states have internal predecessors, (103), 2 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) [2022-07-21 08:05:49,548 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 08:05:49,548 INFO L93 Difference]: Finished difference Result 15601 states and 22203 transitions. [2022-07-21 08:05:49,548 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-21 08:05:49,548 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 34.333333333333336) internal successors, (103), 2 states have internal predecessors, (103), 2 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) Word has length 143 [2022-07-21 08:05:49,549 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 08:05:49,576 INFO L225 Difference]: With dead ends: 15601 [2022-07-21 08:05:49,577 INFO L226 Difference]: Without dead ends: 11391 [2022-07-21 08:05:49,591 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 168 GetRequests, 162 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2022-07-21 08:05:49,592 INFO L413 NwaCegarLoop]: 351 mSDtfsCounter, 236 mSDsluCounter, 170 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 236 SdHoareTripleChecker+Valid, 521 SdHoareTripleChecker+Invalid, 12 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-21 08:05:49,592 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [236 Valid, 521 Invalid, 12 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-21 08:05:49,601 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11391 states. [2022-07-21 08:05:50,139 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11391 to 11291. [2022-07-21 08:05:50,148 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11291 states, 9440 states have (on average 1.3933262711864407) internal successors, (13153), 9575 states have internal predecessors, (13153), 1050 states have call successors, (1050), 681 states have call predecessors, (1050), 799 states have return successors, (1561), 1042 states have call predecessors, (1561), 1047 states have call successors, (1561) [2022-07-21 08:05:50,169 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11291 states to 11291 states and 15764 transitions. [2022-07-21 08:05:50,170 INFO L78 Accepts]: Start accepts. Automaton has 11291 states and 15764 transitions. Word has length 143 [2022-07-21 08:05:50,171 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 08:05:50,171 INFO L495 AbstractCegarLoop]: Abstraction has 11291 states and 15764 transitions. [2022-07-21 08:05:50,171 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 34.333333333333336) internal successors, (103), 2 states have internal predecessors, (103), 2 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) [2022-07-21 08:05:50,171 INFO L276 IsEmpty]: Start isEmpty. Operand 11291 states and 15764 transitions. [2022-07-21 08:05:50,224 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 160 [2022-07-21 08:05:50,225 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 08:05:50,225 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-21 08:05:50,241 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2022-07-21 08:05:50,425 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable25 [2022-07-21 08:05:50,425 INFO L420 AbstractCegarLoop]: === Iteration 27 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-21 08:05:50,426 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 08:05:50,426 INFO L85 PathProgramCache]: Analyzing trace with hash 50370099, now seen corresponding path program 1 times [2022-07-21 08:05:50,426 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 08:05:50,426 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1230172088] [2022-07-21 08:05:50,426 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 08:05:50,426 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 08:05:50,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 08:05:50,457 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-07-21 08:05:50,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 08:05:50,465 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-07-21 08:05:50,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 08:05:50,471 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-07-21 08:05:50,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 08:05:50,473 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 08:05:50,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 08:05:50,474 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-21 08:05:50,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 08:05:50,475 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2022-07-21 08:05:50,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 08:05:50,476 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2022-07-21 08:05:50,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 08:05:50,477 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2022-07-21 08:05:50,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 08:05:50,479 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2022-07-21 08:05:50,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 08:05:50,486 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2022-07-21 08:05:50,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 08:05:50,487 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2022-07-21 08:05:50,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 08:05:50,490 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 08:05:50,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 08:05:50,491 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-21 08:05:50,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 08:05:50,492 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 118 [2022-07-21 08:05:50,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 08:05:50,493 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 124 [2022-07-21 08:05:50,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 08:05:50,494 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 139 [2022-07-21 08:05:50,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 08:05:50,496 INFO L134 CoverageAnalysis]: Checked inductivity of 89 backedges. 25 proven. 0 refuted. 0 times theorem prover too weak. 64 trivial. 0 not checked. [2022-07-21 08:05:50,496 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 08:05:50,496 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1230172088] [2022-07-21 08:05:50,496 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1230172088] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-21 08:05:50,496 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-21 08:05:50,496 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-07-21 08:05:50,497 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [757989678] [2022-07-21 08:05:50,497 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-21 08:05:50,497 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-07-21 08:05:50,497 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 08:05:50,498 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-07-21 08:05:50,498 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2022-07-21 08:05:50,498 INFO L87 Difference]: Start difference. First operand 11291 states and 15764 transitions. Second operand has 7 states, 7 states have (on average 13.428571428571429) internal successors, (94), 4 states have internal predecessors, (94), 3 states have call successors, (15), 5 states have call predecessors, (15), 2 states have return successors, (14), 3 states have call predecessors, (14), 3 states have call successors, (14) [2022-07-21 08:05:51,311 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 08:05:51,312 INFO L93 Difference]: Finished difference Result 12574 states and 17284 transitions. [2022-07-21 08:05:51,312 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-07-21 08:05:51,312 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 13.428571428571429) internal successors, (94), 4 states have internal predecessors, (94), 3 states have call successors, (15), 5 states have call predecessors, (15), 2 states have return successors, (14), 3 states have call predecessors, (14), 3 states have call successors, (14) Word has length 159 [2022-07-21 08:05:51,312 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 08:05:51,342 INFO L225 Difference]: With dead ends: 12574 [2022-07-21 08:05:51,343 INFO L226 Difference]: Without dead ends: 11184 [2022-07-21 08:05:51,352 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=36, Invalid=74, Unknown=0, NotChecked=0, Total=110 [2022-07-21 08:05:51,353 INFO L413 NwaCegarLoop]: 333 mSDtfsCounter, 280 mSDsluCounter, 812 mSDsCounter, 0 mSdLazyCounter, 510 mSolverCounterSat, 77 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 281 SdHoareTripleChecker+Valid, 1145 SdHoareTripleChecker+Invalid, 587 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 77 IncrementalHoareTripleChecker+Valid, 510 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-07-21 08:05:51,353 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [281 Valid, 1145 Invalid, 587 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [77 Valid, 510 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-07-21 08:05:51,361 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11184 states. [2022-07-21 08:05:51,901 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11184 to 11038. [2022-07-21 08:05:51,909 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11038 states, 9238 states have (on average 1.3988958649058238) internal successors, (12923), 9373 states have internal predecessors, (12923), 1025 states have call successors, (1025), 660 states have call predecessors, (1025), 773 states have return successors, (1523), 1012 states have call predecessors, (1523), 1022 states have call successors, (1523) [2022-07-21 08:05:51,928 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11038 states to 11038 states and 15471 transitions. [2022-07-21 08:05:51,930 INFO L78 Accepts]: Start accepts. Automaton has 11038 states and 15471 transitions. Word has length 159 [2022-07-21 08:05:51,930 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 08:05:51,930 INFO L495 AbstractCegarLoop]: Abstraction has 11038 states and 15471 transitions. [2022-07-21 08:05:51,930 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 13.428571428571429) internal successors, (94), 4 states have internal predecessors, (94), 3 states have call successors, (15), 5 states have call predecessors, (15), 2 states have return successors, (14), 3 states have call predecessors, (14), 3 states have call successors, (14) [2022-07-21 08:05:51,931 INFO L276 IsEmpty]: Start isEmpty. Operand 11038 states and 15471 transitions. [2022-07-21 08:05:51,941 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 163 [2022-07-21 08:05:51,941 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 08:05:51,942 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-21 08:05:51,942 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2022-07-21 08:05:51,942 INFO L420 AbstractCegarLoop]: === Iteration 28 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-21 08:05:51,942 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 08:05:51,943 INFO L85 PathProgramCache]: Analyzing trace with hash 2115413199, now seen corresponding path program 1 times [2022-07-21 08:05:51,943 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 08:05:51,943 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1686239745] [2022-07-21 08:05:51,943 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 08:05:51,943 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 08:05:51,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 08:05:51,981 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-07-21 08:05:51,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 08:05:51,991 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-07-21 08:05:51,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 08:05:52,000 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-07-21 08:05:52,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 08:05:52,003 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 08:05:52,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 08:05:52,005 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-21 08:05:52,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 08:05:52,005 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2022-07-21 08:05:52,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 08:05:52,008 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2022-07-21 08:05:52,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 08:05:52,009 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2022-07-21 08:05:52,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 08:05:52,011 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2022-07-21 08:05:52,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 08:05:52,019 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2022-07-21 08:05:52,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 08:05:52,022 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2022-07-21 08:05:52,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 08:05:52,031 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 08:05:52,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 08:05:52,032 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-21 08:05:52,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 08:05:52,034 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2022-07-21 08:05:52,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 08:05:52,035 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2022-07-21 08:05:52,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 08:05:52,036 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 142 [2022-07-21 08:05:52,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 08:05:52,038 INFO L134 CoverageAnalysis]: Checked inductivity of 86 backedges. 25 proven. 7 refuted. 0 times theorem prover too weak. 54 trivial. 0 not checked. [2022-07-21 08:05:52,038 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 08:05:52,039 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1686239745] [2022-07-21 08:05:52,039 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1686239745] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-21 08:05:52,039 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [826523543] [2022-07-21 08:05:52,039 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 08:05:52,039 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-21 08:05:52,039 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-21 08:05:52,041 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-21 08:05:52,065 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2022-07-21 08:05:52,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 08:05:52,144 INFO L263 TraceCheckSpWp]: Trace formula consists of 545 conjuncts, 12 conjunts are in the unsatisfiable core [2022-07-21 08:05:52,148 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-21 08:05:52,284 INFO L134 CoverageAnalysis]: Checked inductivity of 86 backedges. 49 proven. 0 refuted. 0 times theorem prover too weak. 37 trivial. 0 not checked. [2022-07-21 08:05:52,284 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-21 08:05:52,284 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [826523543] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-21 08:05:52,284 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-07-21 08:05:52,284 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [9] total 11 [2022-07-21 08:05:52,285 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [126297805] [2022-07-21 08:05:52,285 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-21 08:05:52,285 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-21 08:05:52,285 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 08:05:52,286 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-21 08:05:52,286 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=84, Unknown=0, NotChecked=0, Total=110 [2022-07-21 08:05:52,286 INFO L87 Difference]: Start difference. First operand 11038 states and 15471 transitions. Second operand has 4 states, 4 states have (on average 27.25) internal successors, (109), 4 states have internal predecessors, (109), 2 states have call successors, (14), 3 states have call predecessors, (14), 3 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2022-07-21 08:05:52,930 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 08:05:52,930 INFO L93 Difference]: Finished difference Result 13364 states and 18279 transitions. [2022-07-21 08:05:52,931 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-07-21 08:05:52,931 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 27.25) internal successors, (109), 4 states have internal predecessors, (109), 2 states have call successors, (14), 3 states have call predecessors, (14), 3 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) Word has length 162 [2022-07-21 08:05:52,931 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 08:05:52,954 INFO L225 Difference]: With dead ends: 13364 [2022-07-21 08:05:52,955 INFO L226 Difference]: Without dead ends: 11954 [2022-07-21 08:05:52,960 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 205 GetRequests, 195 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=31, Invalid=101, Unknown=0, NotChecked=0, Total=132 [2022-07-21 08:05:52,961 INFO L413 NwaCegarLoop]: 310 mSDtfsCounter, 177 mSDsluCounter, 324 mSDsCounter, 0 mSdLazyCounter, 186 mSolverCounterSat, 44 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 182 SdHoareTripleChecker+Valid, 634 SdHoareTripleChecker+Invalid, 230 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 44 IncrementalHoareTripleChecker+Valid, 186 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-07-21 08:05:52,961 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [182 Valid, 634 Invalid, 230 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [44 Valid, 186 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-07-21 08:05:52,967 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11954 states. [2022-07-21 08:05:53,473 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11954 to 11912. [2022-07-21 08:05:53,482 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11912 states, 9969 states have (on average 1.3802788644798876) internal successors, (13760), 10108 states have internal predecessors, (13760), 1095 states have call successors, (1095), 711 states have call predecessors, (1095), 846 states have return successors, (1634), 1100 states have call predecessors, (1634), 1092 states have call successors, (1634) [2022-07-21 08:05:53,503 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11912 states to 11912 states and 16489 transitions. [2022-07-21 08:05:53,504 INFO L78 Accepts]: Start accepts. Automaton has 11912 states and 16489 transitions. Word has length 162 [2022-07-21 08:05:53,505 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 08:05:53,505 INFO L495 AbstractCegarLoop]: Abstraction has 11912 states and 16489 transitions. [2022-07-21 08:05:53,505 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 27.25) internal successors, (109), 4 states have internal predecessors, (109), 2 states have call successors, (14), 3 states have call predecessors, (14), 3 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2022-07-21 08:05:53,505 INFO L276 IsEmpty]: Start isEmpty. Operand 11912 states and 16489 transitions. [2022-07-21 08:05:53,517 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 161 [2022-07-21 08:05:53,517 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 08:05:53,517 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-21 08:05:53,535 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2022-07-21 08:05:53,719 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable27 [2022-07-21 08:05:53,719 INFO L420 AbstractCegarLoop]: === Iteration 29 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-21 08:05:53,719 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 08:05:53,719 INFO L85 PathProgramCache]: Analyzing trace with hash -1963717299, now seen corresponding path program 1 times [2022-07-21 08:05:53,719 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 08:05:53,719 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [178660353] [2022-07-21 08:05:53,719 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 08:05:53,720 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 08:05:53,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 08:05:53,747 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-07-21 08:05:53,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 08:05:53,758 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-07-21 08:05:53,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 08:05:53,765 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2022-07-21 08:05:53,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 08:05:53,797 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2022-07-21 08:05:53,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 08:05:53,799 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2022-07-21 08:05:53,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 08:05:53,805 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2022-07-21 08:05:53,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 08:05:53,807 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2022-07-21 08:05:53,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 08:05:53,810 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-07-21 08:05:53,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 08:05:53,813 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 115 [2022-07-21 08:05:53,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 08:05:53,817 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-07-21 08:05:53,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 08:05:53,819 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 145 [2022-07-21 08:05:53,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 08:05:53,831 INFO L134 CoverageAnalysis]: Checked inductivity of 98 backedges. 0 proven. 22 refuted. 0 times theorem prover too weak. 76 trivial. 0 not checked. [2022-07-21 08:05:53,832 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 08:05:53,832 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [178660353] [2022-07-21 08:05:53,832 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [178660353] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-21 08:05:53,832 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [96044453] [2022-07-21 08:05:53,832 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 08:05:53,832 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-21 08:05:53,833 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-21 08:05:53,834 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-21 08:05:53,843 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2022-07-21 08:05:53,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 08:05:53,937 INFO L263 TraceCheckSpWp]: Trace formula consists of 553 conjuncts, 2 conjunts are in the unsatisfiable core [2022-07-21 08:05:53,939 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-21 08:05:53,961 INFO L134 CoverageAnalysis]: Checked inductivity of 98 backedges. 69 proven. 0 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2022-07-21 08:05:53,962 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-21 08:05:53,962 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [96044453] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-21 08:05:53,962 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-07-21 08:05:53,962 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [7] total 8 [2022-07-21 08:05:53,962 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [619230729] [2022-07-21 08:05:53,962 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-21 08:05:53,963 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-21 08:05:53,963 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 08:05:53,963 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-21 08:05:53,963 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2022-07-21 08:05:53,964 INFO L87 Difference]: Start difference. First operand 11912 states and 16489 transitions. Second operand has 3 states, 3 states have (on average 37.666666666666664) internal successors, (113), 3 states have internal predecessors, (113), 3 states have call successors, (11), 3 states have call predecessors, (11), 2 states have return successors, (10), 2 states have call predecessors, (10), 3 states have call successors, (10) [2022-07-21 08:05:54,576 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 08:05:54,576 INFO L93 Difference]: Finished difference Result 21811 states and 30766 transitions. [2022-07-21 08:05:54,576 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-21 08:05:54,577 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 37.666666666666664) internal successors, (113), 3 states have internal predecessors, (113), 3 states have call successors, (11), 3 states have call predecessors, (11), 2 states have return successors, (10), 2 states have call predecessors, (10), 3 states have call successors, (10) Word has length 160 [2022-07-21 08:05:54,577 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 08:05:54,605 INFO L225 Difference]: With dead ends: 21811 [2022-07-21 08:05:54,605 INFO L226 Difference]: Without dead ends: 12814 [2022-07-21 08:05:54,622 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 187 GetRequests, 181 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2022-07-21 08:05:54,622 INFO L413 NwaCegarLoop]: 324 mSDtfsCounter, 298 mSDsluCounter, 34 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 298 SdHoareTripleChecker+Valid, 358 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-21 08:05:54,623 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [298 Valid, 358 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-21 08:05:54,632 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12814 states. [2022-07-21 08:05:55,330 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12814 to 12439. [2022-07-21 08:05:55,340 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12439 states, 10492 states have (on average 1.3265345024780786) internal successors, (13918), 10611 states have internal predecessors, (13918), 1063 states have call successors, (1063), 754 states have call predecessors, (1063), 882 states have return successors, (1512), 1077 states have call predecessors, (1512), 1060 states have call successors, (1512) [2022-07-21 08:05:55,367 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12439 states to 12439 states and 16493 transitions. [2022-07-21 08:05:55,368 INFO L78 Accepts]: Start accepts. Automaton has 12439 states and 16493 transitions. Word has length 160 [2022-07-21 08:05:55,369 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 08:05:55,369 INFO L495 AbstractCegarLoop]: Abstraction has 12439 states and 16493 transitions. [2022-07-21 08:05:55,369 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 37.666666666666664) internal successors, (113), 3 states have internal predecessors, (113), 3 states have call successors, (11), 3 states have call predecessors, (11), 2 states have return successors, (10), 2 states have call predecessors, (10), 3 states have call successors, (10) [2022-07-21 08:05:55,369 INFO L276 IsEmpty]: Start isEmpty. Operand 12439 states and 16493 transitions. [2022-07-21 08:05:55,379 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 161 [2022-07-21 08:05:55,379 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 08:05:55,379 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-21 08:05:55,396 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2022-07-21 08:05:55,580 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-21 08:05:55,580 INFO L420 AbstractCegarLoop]: === Iteration 30 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-21 08:05:55,580 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 08:05:55,581 INFO L85 PathProgramCache]: Analyzing trace with hash -2001388946, now seen corresponding path program 1 times [2022-07-21 08:05:55,581 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 08:05:55,581 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1542350637] [2022-07-21 08:05:55,581 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 08:05:55,581 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 08:05:55,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 08:05:55,597 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-07-21 08:05:55,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 08:05:55,613 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-07-21 08:05:55,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 08:05:55,621 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2022-07-21 08:05:55,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 08:05:55,655 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2022-07-21 08:05:55,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 08:05:55,658 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2022-07-21 08:05:55,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 08:05:55,659 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2022-07-21 08:05:55,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 08:05:55,661 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2022-07-21 08:05:55,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 08:05:55,665 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-07-21 08:05:55,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 08:05:55,668 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 115 [2022-07-21 08:05:55,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 08:05:55,672 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-07-21 08:05:55,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 08:05:55,675 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 145 [2022-07-21 08:05:55,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 08:05:55,677 INFO L134 CoverageAnalysis]: Checked inductivity of 98 backedges. 0 proven. 22 refuted. 0 times theorem prover too weak. 76 trivial. 0 not checked. [2022-07-21 08:05:55,677 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 08:05:55,677 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1542350637] [2022-07-21 08:05:55,677 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1542350637] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-21 08:05:55,678 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2139866445] [2022-07-21 08:05:55,678 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 08:05:55,678 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-21 08:05:55,678 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-21 08:05:55,679 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-21 08:05:55,712 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2022-07-21 08:05:55,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 08:05:55,803 INFO L263 TraceCheckSpWp]: Trace formula consists of 547 conjuncts, 3 conjunts are in the unsatisfiable core [2022-07-21 08:05:55,807 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-21 08:05:55,892 INFO L134 CoverageAnalysis]: Checked inductivity of 98 backedges. 82 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2022-07-21 08:05:55,893 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-21 08:05:55,893 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2139866445] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-21 08:05:55,893 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-07-21 08:05:55,893 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [7] total 8 [2022-07-21 08:05:55,894 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [785531647] [2022-07-21 08:05:55,894 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-21 08:05:55,895 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-21 08:05:55,895 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 08:05:55,895 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-21 08:05:55,895 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2022-07-21 08:05:55,896 INFO L87 Difference]: Start difference. First operand 12439 states and 16493 transitions. Second operand has 3 states, 3 states have (on average 42.333333333333336) internal successors, (127), 3 states have internal predecessors, (127), 3 states have call successors, (10), 3 states have call predecessors, (10), 3 states have return successors, (10), 3 states have call predecessors, (10), 3 states have call successors, (10) [2022-07-21 08:05:56,613 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 08:05:56,613 INFO L93 Difference]: Finished difference Result 21018 states and 28214 transitions. [2022-07-21 08:05:56,613 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-21 08:05:56,614 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 42.333333333333336) internal successors, (127), 3 states have internal predecessors, (127), 3 states have call successors, (10), 3 states have call predecessors, (10), 3 states have return successors, (10), 3 states have call predecessors, (10), 3 states have call successors, (10) Word has length 160 [2022-07-21 08:05:56,614 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 08:05:56,639 INFO L225 Difference]: With dead ends: 21018 [2022-07-21 08:05:56,639 INFO L226 Difference]: Without dead ends: 10780 [2022-07-21 08:05:56,657 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 187 GetRequests, 181 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2022-07-21 08:05:56,657 INFO L413 NwaCegarLoop]: 318 mSDtfsCounter, 253 mSDsluCounter, 33 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 253 SdHoareTripleChecker+Valid, 351 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-21 08:05:56,657 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [253 Valid, 351 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-21 08:05:56,664 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10780 states. [2022-07-21 08:05:57,203 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10780 to 10740. [2022-07-21 08:05:57,213 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10740 states, 9090 states have (on average 1.28987898789879) internal successors, (11725), 9175 states have internal predecessors, (11725), 871 states have call successors, (871), 661 states have call predecessors, (871), 777 states have return successors, (1226), 907 states have call predecessors, (1226), 868 states have call successors, (1226) [2022-07-21 08:05:57,232 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10740 states to 10740 states and 13822 transitions. [2022-07-21 08:05:57,234 INFO L78 Accepts]: Start accepts. Automaton has 10740 states and 13822 transitions. Word has length 160 [2022-07-21 08:05:57,234 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 08:05:57,235 INFO L495 AbstractCegarLoop]: Abstraction has 10740 states and 13822 transitions. [2022-07-21 08:05:57,235 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 42.333333333333336) internal successors, (127), 3 states have internal predecessors, (127), 3 states have call successors, (10), 3 states have call predecessors, (10), 3 states have return successors, (10), 3 states have call predecessors, (10), 3 states have call successors, (10) [2022-07-21 08:05:57,235 INFO L276 IsEmpty]: Start isEmpty. Operand 10740 states and 13822 transitions. [2022-07-21 08:05:57,242 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 161 [2022-07-21 08:05:57,242 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 08:05:57,242 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-21 08:05:57,260 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2022-07-21 08:05:57,443 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29,9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-21 08:05:57,443 INFO L420 AbstractCegarLoop]: === Iteration 31 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-21 08:05:57,444 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 08:05:57,444 INFO L85 PathProgramCache]: Analyzing trace with hash 453524583, now seen corresponding path program 1 times [2022-07-21 08:05:57,444 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 08:05:57,444 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1445940925] [2022-07-21 08:05:57,444 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 08:05:57,444 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 08:05:57,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 08:05:57,459 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-07-21 08:05:57,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 08:05:57,467 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-07-21 08:05:57,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 08:05:57,473 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2022-07-21 08:05:57,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 08:05:57,500 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2022-07-21 08:05:57,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 08:05:57,502 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2022-07-21 08:05:57,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 08:05:57,503 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2022-07-21 08:05:57,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 08:05:57,504 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2022-07-21 08:05:57,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 08:05:57,507 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-07-21 08:05:57,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 08:05:57,514 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2022-07-21 08:05:57,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 08:05:57,517 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-07-21 08:05:57,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 08:05:57,520 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 145 [2022-07-21 08:05:57,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 08:05:57,521 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 0 proven. 22 refuted. 0 times theorem prover too weak. 78 trivial. 0 not checked. [2022-07-21 08:05:57,521 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 08:05:57,521 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1445940925] [2022-07-21 08:05:57,522 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1445940925] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-21 08:05:57,522 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1769115524] [2022-07-21 08:05:57,522 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 08:05:57,522 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-21 08:05:57,522 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-21 08:05:57,523 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-21 08:05:57,533 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2022-07-21 08:05:57,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 08:05:57,628 INFO L263 TraceCheckSpWp]: Trace formula consists of 544 conjuncts, 3 conjunts are in the unsatisfiable core [2022-07-21 08:05:57,631 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-21 08:05:57,649 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 59 proven. 0 refuted. 0 times theorem prover too weak. 41 trivial. 0 not checked. [2022-07-21 08:05:57,649 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-21 08:05:57,649 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1769115524] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-21 08:05:57,649 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-07-21 08:05:57,650 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [7] total 8 [2022-07-21 08:05:57,650 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [329334796] [2022-07-21 08:05:57,650 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-21 08:05:57,651 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-21 08:05:57,651 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 08:05:57,651 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-21 08:05:57,651 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2022-07-21 08:05:57,652 INFO L87 Difference]: Start difference. First operand 10740 states and 13822 transitions. Second operand has 3 states, 3 states have (on average 35.0) internal successors, (105), 3 states have internal predecessors, (105), 2 states have call successors, (10), 2 states have call predecessors, (10), 3 states have return successors, (9), 3 states have call predecessors, (9), 2 states have call successors, (9) [2022-07-21 08:05:58,314 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 08:05:58,314 INFO L93 Difference]: Finished difference Result 19185 states and 25013 transitions. [2022-07-21 08:05:58,315 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-21 08:05:58,315 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 35.0) internal successors, (105), 3 states have internal predecessors, (105), 2 states have call successors, (10), 2 states have call predecessors, (10), 3 states have return successors, (9), 3 states have call predecessors, (9), 2 states have call successors, (9) Word has length 160 [2022-07-21 08:05:58,315 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 08:05:58,339 INFO L225 Difference]: With dead ends: 19185 [2022-07-21 08:05:58,339 INFO L226 Difference]: Without dead ends: 10646 [2022-07-21 08:05:58,358 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 187 GetRequests, 181 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2022-07-21 08:05:58,358 INFO L413 NwaCegarLoop]: 340 mSDtfsCounter, 278 mSDsluCounter, 164 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 278 SdHoareTripleChecker+Valid, 504 SdHoareTripleChecker+Invalid, 10 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-21 08:05:58,359 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [278 Valid, 504 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-21 08:05:58,368 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10646 states. [2022-07-21 08:05:58,922 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10646 to 10646. [2022-07-21 08:05:58,931 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10646 states, 8996 states have (on average 1.272009782125389) internal successors, (11443), 9081 states have internal predecessors, (11443), 871 states have call successors, (871), 661 states have call predecessors, (871), 777 states have return successors, (1226), 907 states have call predecessors, (1226), 868 states have call successors, (1226) [2022-07-21 08:05:58,949 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10646 states to 10646 states and 13540 transitions. [2022-07-21 08:05:58,951 INFO L78 Accepts]: Start accepts. Automaton has 10646 states and 13540 transitions. Word has length 160 [2022-07-21 08:05:58,951 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 08:05:58,951 INFO L495 AbstractCegarLoop]: Abstraction has 10646 states and 13540 transitions. [2022-07-21 08:05:58,951 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 35.0) internal successors, (105), 3 states have internal predecessors, (105), 2 states have call successors, (10), 2 states have call predecessors, (10), 3 states have return successors, (9), 3 states have call predecessors, (9), 2 states have call successors, (9) [2022-07-21 08:05:58,952 INFO L276 IsEmpty]: Start isEmpty. Operand 10646 states and 13540 transitions. [2022-07-21 08:05:58,958 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 162 [2022-07-21 08:05:58,958 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 08:05:58,958 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-21 08:05:58,976 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Ended with exit code 0 [2022-07-21 08:05:59,159 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30,10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-21 08:05:59,160 INFO L420 AbstractCegarLoop]: === Iteration 32 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-21 08:05:59,160 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 08:05:59,160 INFO L85 PathProgramCache]: Analyzing trace with hash 1421882321, now seen corresponding path program 1 times [2022-07-21 08:05:59,160 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 08:05:59,160 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1159137985] [2022-07-21 08:05:59,161 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 08:05:59,161 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 08:05:59,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 08:05:59,191 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-07-21 08:05:59,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 08:05:59,200 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-07-21 08:05:59,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 08:05:59,207 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2022-07-21 08:05:59,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 08:05:59,249 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2022-07-21 08:05:59,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 08:05:59,251 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2022-07-21 08:05:59,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 08:05:59,252 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2022-07-21 08:05:59,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 08:05:59,255 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-07-21 08:05:59,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 08:05:59,260 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2022-07-21 08:05:59,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 08:05:59,261 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2022-07-21 08:05:59,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 08:05:59,264 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-07-21 08:05:59,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 08:05:59,267 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 146 [2022-07-21 08:05:59,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 08:05:59,268 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 0 proven. 22 refuted. 0 times theorem prover too weak. 78 trivial. 0 not checked. [2022-07-21 08:05:59,268 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 08:05:59,269 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1159137985] [2022-07-21 08:05:59,269 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1159137985] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-21 08:05:59,269 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [678053182] [2022-07-21 08:05:59,269 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 08:05:59,269 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-21 08:05:59,269 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-21 08:05:59,271 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-21 08:05:59,272 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2022-07-21 08:05:59,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 08:05:59,369 INFO L263 TraceCheckSpWp]: Trace formula consists of 545 conjuncts, 2 conjunts are in the unsatisfiable core [2022-07-21 08:05:59,371 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-21 08:05:59,395 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 80 proven. 0 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2022-07-21 08:05:59,395 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-21 08:05:59,396 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [678053182] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-21 08:05:59,396 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-07-21 08:05:59,396 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [7] total 8 [2022-07-21 08:05:59,396 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [447759673] [2022-07-21 08:05:59,396 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-21 08:05:59,397 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-21 08:05:59,397 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 08:05:59,397 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-21 08:05:59,397 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2022-07-21 08:05:59,397 INFO L87 Difference]: Start difference. First operand 10646 states and 13540 transitions. Second operand has 3 states, 3 states have (on average 39.666666666666664) internal successors, (119), 3 states have internal predecessors, (119), 3 states have call successors, (12), 3 states have call predecessors, (12), 3 states have return successors, (11), 3 states have call predecessors, (11), 3 states have call successors, (11) [2022-07-21 08:06:00,320 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 08:06:00,320 INFO L93 Difference]: Finished difference Result 25956 states and 33661 transitions. [2022-07-21 08:06:00,321 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-21 08:06:00,321 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 39.666666666666664) internal successors, (119), 3 states have internal predecessors, (119), 3 states have call successors, (12), 3 states have call predecessors, (12), 3 states have return successors, (11), 3 states have call predecessors, (11), 3 states have call successors, (11) Word has length 161 [2022-07-21 08:06:00,321 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 08:06:00,361 INFO L225 Difference]: With dead ends: 25956 [2022-07-21 08:06:00,362 INFO L226 Difference]: Without dead ends: 17511 [2022-07-21 08:06:00,383 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 188 GetRequests, 182 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2022-07-21 08:06:00,384 INFO L413 NwaCegarLoop]: 464 mSDtfsCounter, 149 mSDsluCounter, 313 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 149 SdHoareTripleChecker+Valid, 777 SdHoareTripleChecker+Invalid, 13 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-21 08:06:00,384 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [149 Valid, 777 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-21 08:06:00,394 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17511 states. [2022-07-21 08:06:01,367 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17511 to 17507. [2022-07-21 08:06:01,380 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17507 states, 14790 states have (on average 1.2752535496957405) internal successors, (18861), 14942 states have internal predecessors, (18861), 1461 states have call successors, (1461), 1084 states have call predecessors, (1461), 1254 states have return successors, (2233), 1488 states have call predecessors, (2233), 1458 states have call successors, (2233) [2022-07-21 08:06:01,408 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17507 states to 17507 states and 22555 transitions. [2022-07-21 08:06:01,411 INFO L78 Accepts]: Start accepts. Automaton has 17507 states and 22555 transitions. Word has length 161 [2022-07-21 08:06:01,411 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 08:06:01,411 INFO L495 AbstractCegarLoop]: Abstraction has 17507 states and 22555 transitions. [2022-07-21 08:06:01,411 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 39.666666666666664) internal successors, (119), 3 states have internal predecessors, (119), 3 states have call successors, (12), 3 states have call predecessors, (12), 3 states have return successors, (11), 3 states have call predecessors, (11), 3 states have call successors, (11) [2022-07-21 08:06:01,411 INFO L276 IsEmpty]: Start isEmpty. Operand 17507 states and 22555 transitions. [2022-07-21 08:06:01,422 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 162 [2022-07-21 08:06:01,422 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 08:06:01,422 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-21 08:06:01,439 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Ended with exit code 0 [2022-07-21 08:06:01,623 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable31 [2022-07-21 08:06:01,623 INFO L420 AbstractCegarLoop]: === Iteration 33 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-21 08:06:01,623 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 08:06:01,623 INFO L85 PathProgramCache]: Analyzing trace with hash -831857108, now seen corresponding path program 1 times [2022-07-21 08:06:01,623 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 08:06:01,623 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2002733454] [2022-07-21 08:06:01,623 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 08:06:01,624 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 08:06:01,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 08:06:01,639 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-07-21 08:06:01,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 08:06:01,649 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-07-21 08:06:01,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 08:06:01,656 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2022-07-21 08:06:01,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 08:06:01,685 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2022-07-21 08:06:01,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 08:06:01,688 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2022-07-21 08:06:01,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 08:06:01,689 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2022-07-21 08:06:01,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 08:06:01,690 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2022-07-21 08:06:01,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 08:06:01,693 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-07-21 08:06:01,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 08:06:01,696 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2022-07-21 08:06:01,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 08:06:01,699 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-07-21 08:06:01,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 08:06:01,701 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 146 [2022-07-21 08:06:01,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 08:06:01,703 INFO L134 CoverageAnalysis]: Checked inductivity of 102 backedges. 0 proven. 22 refuted. 0 times theorem prover too weak. 80 trivial. 0 not checked. [2022-07-21 08:06:01,703 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 08:06:01,703 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2002733454] [2022-07-21 08:06:01,703 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2002733454] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-21 08:06:01,704 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1422234228] [2022-07-21 08:06:01,704 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 08:06:01,704 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-21 08:06:01,704 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-21 08:06:01,705 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-21 08:06:01,707 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2022-07-21 08:06:01,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 08:06:01,800 INFO L263 TraceCheckSpWp]: Trace formula consists of 551 conjuncts, 3 conjunts are in the unsatisfiable core [2022-07-21 08:06:01,803 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-21 08:06:01,841 INFO L134 CoverageAnalysis]: Checked inductivity of 102 backedges. 62 proven. 0 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2022-07-21 08:06:01,841 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-21 08:06:01,841 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1422234228] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-21 08:06:01,842 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-07-21 08:06:01,842 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [7] total 8 [2022-07-21 08:06:01,842 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1179636673] [2022-07-21 08:06:01,842 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-21 08:06:01,843 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-21 08:06:01,843 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 08:06:01,843 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-21 08:06:01,843 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2022-07-21 08:06:01,843 INFO L87 Difference]: Start difference. First operand 17507 states and 22555 transitions. Second operand has 3 states, 3 states have (on average 35.666666666666664) internal successors, (107), 3 states have internal predecessors, (107), 3 states have call successors, (10), 3 states have call predecessors, (10), 3 states have return successors, (9), 3 states have call predecessors, (9), 3 states have call successors, (9) [2022-07-21 08:06:03,584 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 08:06:03,584 INFO L93 Difference]: Finished difference Result 47490 states and 62539 transitions. [2022-07-21 08:06:03,585 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-21 08:06:03,585 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 35.666666666666664) internal successors, (107), 3 states have internal predecessors, (107), 3 states have call successors, (10), 3 states have call predecessors, (10), 3 states have return successors, (9), 3 states have call predecessors, (9), 3 states have call successors, (9) Word has length 161 [2022-07-21 08:06:03,585 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 08:06:03,671 INFO L225 Difference]: With dead ends: 47490 [2022-07-21 08:06:03,672 INFO L226 Difference]: Without dead ends: 32188 [2022-07-21 08:06:03,701 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 188 GetRequests, 182 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2022-07-21 08:06:03,702 INFO L413 NwaCegarLoop]: 357 mSDtfsCounter, 278 mSDsluCounter, 173 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 278 SdHoareTripleChecker+Valid, 530 SdHoareTripleChecker+Invalid, 13 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-21 08:06:03,702 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [278 Valid, 530 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-21 08:06:03,723 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32188 states. [2022-07-21 08:06:05,591 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32188 to 32004. [2022-07-21 08:06:05,616 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 32004 states, 27074 states have (on average 1.2708133264386496) internal successors, (34406), 27360 states have internal predecessors, (34406), 2659 states have call successors, (2659), 1984 states have call predecessors, (2659), 2269 states have return successors, (5013), 2675 states have call predecessors, (5013), 2656 states have call successors, (5013) [2022-07-21 08:06:05,683 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32004 states to 32004 states and 42078 transitions. [2022-07-21 08:06:05,688 INFO L78 Accepts]: Start accepts. Automaton has 32004 states and 42078 transitions. Word has length 161 [2022-07-21 08:06:05,688 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 08:06:05,688 INFO L495 AbstractCegarLoop]: Abstraction has 32004 states and 42078 transitions. [2022-07-21 08:06:05,688 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 35.666666666666664) internal successors, (107), 3 states have internal predecessors, (107), 3 states have call successors, (10), 3 states have call predecessors, (10), 3 states have return successors, (9), 3 states have call predecessors, (9), 3 states have call successors, (9) [2022-07-21 08:06:05,688 INFO L276 IsEmpty]: Start isEmpty. Operand 32004 states and 42078 transitions. [2022-07-21 08:06:05,711 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 162 [2022-07-21 08:06:05,711 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 08:06:05,712 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-21 08:06:05,729 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Ended with exit code 0 [2022-07-21 08:06:05,912 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable32 [2022-07-21 08:06:05,912 INFO L420 AbstractCegarLoop]: === Iteration 34 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-21 08:06:05,913 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 08:06:05,913 INFO L85 PathProgramCache]: Analyzing trace with hash 60308522, now seen corresponding path program 1 times [2022-07-21 08:06:05,913 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 08:06:05,913 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [918224955] [2022-07-21 08:06:05,913 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 08:06:05,913 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 08:06:05,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 08:06:05,928 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-07-21 08:06:05,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 08:06:05,937 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-07-21 08:06:05,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 08:06:05,946 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2022-07-21 08:06:05,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 08:06:05,950 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2022-07-21 08:06:05,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 08:06:05,952 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2022-07-21 08:06:05,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 08:06:05,953 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2022-07-21 08:06:05,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 08:06:05,954 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2022-07-21 08:06:05,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 08:06:05,958 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-07-21 08:06:05,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 08:06:05,960 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2022-07-21 08:06:05,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 08:06:05,963 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-07-21 08:06:05,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 08:06:05,965 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 146 [2022-07-21 08:06:05,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 08:06:05,967 INFO L134 CoverageAnalysis]: Checked inductivity of 102 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 102 trivial. 0 not checked. [2022-07-21 08:06:05,967 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 08:06:05,967 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [918224955] [2022-07-21 08:06:05,967 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [918224955] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-21 08:06:05,968 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-21 08:06:05,968 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-07-21 08:06:05,968 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1607888245] [2022-07-21 08:06:05,969 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-21 08:06:05,969 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-07-21 08:06:05,969 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 08:06:05,970 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-21 08:06:05,970 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-07-21 08:06:05,970 INFO L87 Difference]: Start difference. First operand 32004 states and 42078 transitions. Second operand has 5 states, 5 states have (on average 16.0) internal successors, (80), 3 states have internal predecessors, (80), 3 states have call successors, (9), 4 states have call predecessors, (9), 1 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) [2022-07-21 08:06:07,962 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 08:06:07,962 INFO L93 Difference]: Finished difference Result 58974 states and 77653 transitions. [2022-07-21 08:06:07,963 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-21 08:06:07,963 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 16.0) internal successors, (80), 3 states have internal predecessors, (80), 3 states have call successors, (9), 4 states have call predecessors, (9), 1 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) Word has length 161 [2022-07-21 08:06:07,963 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 08:06:08,055 INFO L225 Difference]: With dead ends: 58974 [2022-07-21 08:06:08,055 INFO L226 Difference]: Without dead ends: 29173 [2022-07-21 08:06:08,093 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 25 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2022-07-21 08:06:08,093 INFO L413 NwaCegarLoop]: 307 mSDtfsCounter, 416 mSDsluCounter, 311 mSDsCounter, 0 mSdLazyCounter, 254 mSolverCounterSat, 79 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 432 SdHoareTripleChecker+Valid, 618 SdHoareTripleChecker+Invalid, 333 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 79 IncrementalHoareTripleChecker+Valid, 254 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-07-21 08:06:08,094 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [432 Valid, 618 Invalid, 333 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [79 Valid, 254 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-07-21 08:06:08,110 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29173 states. [2022-07-21 08:06:09,984 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29173 to 26979. [2022-07-21 08:06:10,010 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 26979 states, 22783 states have (on average 1.2722644076723872) internal successors, (28986), 23235 states have internal predecessors, (28986), 2071 states have call successors, (2071), 1542 states have call predecessors, (2071), 2123 states have return successors, (4294), 2209 states have call predecessors, (4294), 2068 states have call successors, (4294) [2022-07-21 08:06:10,077 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26979 states to 26979 states and 35351 transitions. [2022-07-21 08:06:10,082 INFO L78 Accepts]: Start accepts. Automaton has 26979 states and 35351 transitions. Word has length 161 [2022-07-21 08:06:10,082 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 08:06:10,082 INFO L495 AbstractCegarLoop]: Abstraction has 26979 states and 35351 transitions. [2022-07-21 08:06:10,083 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 16.0) internal successors, (80), 3 states have internal predecessors, (80), 3 states have call successors, (9), 4 states have call predecessors, (9), 1 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) [2022-07-21 08:06:10,083 INFO L276 IsEmpty]: Start isEmpty. Operand 26979 states and 35351 transitions. [2022-07-21 08:06:10,106 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 164 [2022-07-21 08:06:10,106 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 08:06:10,106 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-21 08:06:10,106 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33 [2022-07-21 08:06:10,107 INFO L420 AbstractCegarLoop]: === Iteration 35 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-21 08:06:10,107 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 08:06:10,107 INFO L85 PathProgramCache]: Analyzing trace with hash -81101080, now seen corresponding path program 1 times [2022-07-21 08:06:10,107 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 08:06:10,107 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1593587252] [2022-07-21 08:06:10,108 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 08:06:10,108 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 08:06:10,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 08:06:10,126 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-07-21 08:06:10,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 08:06:10,136 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-07-21 08:06:10,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 08:06:10,144 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2022-07-21 08:06:10,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 08:06:10,187 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2022-07-21 08:06:10,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 08:06:10,190 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2022-07-21 08:06:10,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 08:06:10,191 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2022-07-21 08:06:10,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 08:06:10,192 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2022-07-21 08:06:10,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 08:06:10,253 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-07-21 08:06:10,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 08:06:10,256 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2022-07-21 08:06:10,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 08:06:10,258 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-07-21 08:06:10,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 08:06:10,269 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 148 [2022-07-21 08:06:10,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 08:06:10,271 INFO L134 CoverageAnalysis]: Checked inductivity of 103 backedges. 0 proven. 22 refuted. 0 times theorem prover too weak. 81 trivial. 0 not checked. [2022-07-21 08:06:10,271 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 08:06:10,271 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1593587252] [2022-07-21 08:06:10,271 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1593587252] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-21 08:06:10,271 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [507679035] [2022-07-21 08:06:10,271 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 08:06:10,271 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-21 08:06:10,271 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-21 08:06:10,272 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-21 08:06:10,274 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2022-07-21 08:06:10,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 08:06:10,375 INFO L263 TraceCheckSpWp]: Trace formula consists of 565 conjuncts, 3 conjunts are in the unsatisfiable core [2022-07-21 08:06:10,378 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-21 08:06:10,420 INFO L134 CoverageAnalysis]: Checked inductivity of 103 backedges. 95 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2022-07-21 08:06:10,420 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-21 08:06:10,421 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [507679035] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-21 08:06:10,421 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-07-21 08:06:10,421 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [7] total 8 [2022-07-21 08:06:10,421 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1467232024] [2022-07-21 08:06:10,421 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-21 08:06:10,422 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-21 08:06:10,422 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 08:06:10,422 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-21 08:06:10,422 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2022-07-21 08:06:10,423 INFO L87 Difference]: Start difference. First operand 26979 states and 35351 transitions. Second operand has 3 states, 3 states have (on average 44.666666666666664) internal successors, (134), 3 states have internal predecessors, (134), 3 states have call successors, (12), 3 states have call predecessors, (12), 3 states have return successors, (11), 3 states have call predecessors, (11), 3 states have call successors, (11) [2022-07-21 08:06:12,017 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 08:06:12,017 INFO L93 Difference]: Finished difference Result 44846 states and 61259 transitions. [2022-07-21 08:06:12,018 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-21 08:06:12,018 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 44.666666666666664) internal successors, (134), 3 states have internal predecessors, (134), 3 states have call successors, (12), 3 states have call predecessors, (12), 3 states have return successors, (11), 3 states have call predecessors, (11), 3 states have call successors, (11) Word has length 163 [2022-07-21 08:06:12,018 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 08:06:12,080 INFO L225 Difference]: With dead ends: 44846 [2022-07-21 08:06:12,080 INFO L226 Difference]: Without dead ends: 27045 [2022-07-21 08:06:12,109 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 190 GetRequests, 184 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2022-07-21 08:06:12,110 INFO L413 NwaCegarLoop]: 429 mSDtfsCounter, 138 mSDsluCounter, 284 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 138 SdHoareTripleChecker+Valid, 713 SdHoareTripleChecker+Invalid, 10 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-21 08:06:12,110 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [138 Valid, 713 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-21 08:06:12,125 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27045 states. [2022-07-21 08:06:13,748 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27045 to 26979. [2022-07-21 08:06:13,770 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 26979 states, 22783 states have (on average 1.2479919238028354) internal successors, (28433), 23235 states have internal predecessors, (28433), 2071 states have call successors, (2071), 1542 states have call predecessors, (2071), 2123 states have return successors, (4294), 2209 states have call predecessors, (4294), 2068 states have call successors, (4294) [2022-07-21 08:06:13,823 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26979 states to 26979 states and 34798 transitions. [2022-07-21 08:06:13,829 INFO L78 Accepts]: Start accepts. Automaton has 26979 states and 34798 transitions. Word has length 163 [2022-07-21 08:06:13,831 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 08:06:13,831 INFO L495 AbstractCegarLoop]: Abstraction has 26979 states and 34798 transitions. [2022-07-21 08:06:13,831 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 44.666666666666664) internal successors, (134), 3 states have internal predecessors, (134), 3 states have call successors, (12), 3 states have call predecessors, (12), 3 states have return successors, (11), 3 states have call predecessors, (11), 3 states have call successors, (11) [2022-07-21 08:06:13,831 INFO L276 IsEmpty]: Start isEmpty. Operand 26979 states and 34798 transitions. [2022-07-21 08:06:13,854 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 164 [2022-07-21 08:06:13,855 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 08:06:13,855 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-21 08:06:13,879 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Ended with exit code 0 [2022-07-21 08:06:14,079 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable34 [2022-07-21 08:06:14,079 INFO L420 AbstractCegarLoop]: === Iteration 36 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-21 08:06:14,080 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 08:06:14,080 INFO L85 PathProgramCache]: Analyzing trace with hash -929152312, now seen corresponding path program 1 times [2022-07-21 08:06:14,080 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 08:06:14,080 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1594024253] [2022-07-21 08:06:14,080 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 08:06:14,080 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 08:06:14,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 08:06:14,094 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-07-21 08:06:14,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 08:06:14,102 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-07-21 08:06:14,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 08:06:14,109 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2022-07-21 08:06:14,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 08:06:14,137 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2022-07-21 08:06:14,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 08:06:14,140 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2022-07-21 08:06:14,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 08:06:14,141 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2022-07-21 08:06:14,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 08:06:14,142 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2022-07-21 08:06:14,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 08:06:14,145 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-07-21 08:06:14,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 08:06:14,147 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2022-07-21 08:06:14,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 08:06:14,150 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-07-21 08:06:14,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 08:06:14,152 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 148 [2022-07-21 08:06:14,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 08:06:14,153 INFO L134 CoverageAnalysis]: Checked inductivity of 101 backedges. 0 proven. 20 refuted. 0 times theorem prover too weak. 81 trivial. 0 not checked. [2022-07-21 08:06:14,153 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 08:06:14,154 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1594024253] [2022-07-21 08:06:14,154 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1594024253] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-21 08:06:14,154 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1521514381] [2022-07-21 08:06:14,154 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 08:06:14,154 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-21 08:06:14,154 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-21 08:06:14,156 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-21 08:06:14,179 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2022-07-21 08:06:14,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 08:06:14,259 INFO L263 TraceCheckSpWp]: Trace formula consists of 571 conjuncts, 2 conjunts are in the unsatisfiable core [2022-07-21 08:06:14,261 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-21 08:06:14,330 INFO L134 CoverageAnalysis]: Checked inductivity of 101 backedges. 83 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2022-07-21 08:06:14,330 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-21 08:06:14,330 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1521514381] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-21 08:06:14,330 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-07-21 08:06:14,331 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [7] total 8 [2022-07-21 08:06:14,331 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [864439540] [2022-07-21 08:06:14,331 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-21 08:06:14,332 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-21 08:06:14,332 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 08:06:14,332 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-21 08:06:14,333 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2022-07-21 08:06:14,333 INFO L87 Difference]: Start difference. First operand 26979 states and 34798 transitions. Second operand has 3 states, 3 states have (on average 42.333333333333336) internal successors, (127), 3 states have internal predecessors, (127), 3 states have call successors, (11), 3 states have call predecessors, (11), 3 states have return successors, (10), 3 states have call predecessors, (10), 3 states have call successors, (10) [2022-07-21 08:06:16,297 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 08:06:16,297 INFO L93 Difference]: Finished difference Result 48806 states and 65023 transitions. [2022-07-21 08:06:16,298 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-21 08:06:16,298 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 42.333333333333336) internal successors, (127), 3 states have internal predecessors, (127), 3 states have call successors, (11), 3 states have call predecessors, (11), 3 states have return successors, (10), 3 states have call predecessors, (10), 3 states have call successors, (10) Word has length 163 [2022-07-21 08:06:16,298 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 08:06:16,354 INFO L225 Difference]: With dead ends: 48806 [2022-07-21 08:06:16,355 INFO L226 Difference]: Without dead ends: 26524 [2022-07-21 08:06:16,384 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 190 GetRequests, 184 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2022-07-21 08:06:16,385 INFO L413 NwaCegarLoop]: 313 mSDtfsCounter, 265 mSDsluCounter, 31 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 265 SdHoareTripleChecker+Valid, 344 SdHoareTripleChecker+Invalid, 12 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-21 08:06:16,385 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [265 Valid, 344 Invalid, 12 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-21 08:06:16,402 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26524 states. [2022-07-21 08:06:17,714 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26524 to 18133. [2022-07-21 08:06:17,729 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18133 states, 15366 states have (on average 1.2041520239489782) internal successors, (18503), 15648 states have internal predecessors, (18503), 1353 states have call successors, (1353), 1032 states have call predecessors, (1353), 1412 states have return successors, (2496), 1456 states have call predecessors, (2496), 1350 states have call successors, (2496) [2022-07-21 08:06:17,759 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18133 states to 18133 states and 22352 transitions. [2022-07-21 08:06:17,762 INFO L78 Accepts]: Start accepts. Automaton has 18133 states and 22352 transitions. Word has length 163 [2022-07-21 08:06:17,762 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 08:06:17,763 INFO L495 AbstractCegarLoop]: Abstraction has 18133 states and 22352 transitions. [2022-07-21 08:06:17,763 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 42.333333333333336) internal successors, (127), 3 states have internal predecessors, (127), 3 states have call successors, (11), 3 states have call predecessors, (11), 3 states have return successors, (10), 3 states have call predecessors, (10), 3 states have call successors, (10) [2022-07-21 08:06:17,763 INFO L276 IsEmpty]: Start isEmpty. Operand 18133 states and 22352 transitions. [2022-07-21 08:06:17,772 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 166 [2022-07-21 08:06:17,772 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 08:06:17,772 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-21 08:06:17,789 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Ended with exit code 0 [2022-07-21 08:06:17,972 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable35 [2022-07-21 08:06:17,973 INFO L420 AbstractCegarLoop]: === Iteration 37 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-21 08:06:17,973 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 08:06:17,973 INFO L85 PathProgramCache]: Analyzing trace with hash 282552368, now seen corresponding path program 1 times [2022-07-21 08:06:17,973 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 08:06:17,973 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1715719043] [2022-07-21 08:06:17,973 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 08:06:17,974 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 08:06:17,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 08:06:17,991 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-07-21 08:06:17,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 08:06:18,000 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-07-21 08:06:18,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 08:06:18,008 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2022-07-21 08:06:18,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 08:06:18,035 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2022-07-21 08:06:18,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 08:06:18,037 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2022-07-21 08:06:18,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 08:06:18,038 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2022-07-21 08:06:18,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 08:06:18,044 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2022-07-21 08:06:18,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 08:06:18,047 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-07-21 08:06:18,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 08:06:18,049 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 120 [2022-07-21 08:06:18,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 08:06:18,052 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-07-21 08:06:18,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 08:06:18,055 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 150 [2022-07-21 08:06:18,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 08:06:18,056 INFO L134 CoverageAnalysis]: Checked inductivity of 104 backedges. 0 proven. 22 refuted. 0 times theorem prover too weak. 82 trivial. 0 not checked. [2022-07-21 08:06:18,057 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 08:06:18,057 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1715719043] [2022-07-21 08:06:18,057 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1715719043] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-21 08:06:18,057 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [453298948] [2022-07-21 08:06:18,057 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 08:06:18,057 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-21 08:06:18,058 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-21 08:06:18,059 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-21 08:06:18,081 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Waiting until timeout for monitored process [2022-07-21 08:06:18,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 08:06:18,151 INFO L263 TraceCheckSpWp]: Trace formula consists of 566 conjuncts, 6 conjunts are in the unsatisfiable core [2022-07-21 08:06:18,153 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-21 08:06:18,224 INFO L134 CoverageAnalysis]: Checked inductivity of 104 backedges. 39 proven. 0 refuted. 0 times theorem prover too weak. 65 trivial. 0 not checked. [2022-07-21 08:06:18,225 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-21 08:06:18,225 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [453298948] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-21 08:06:18,225 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-07-21 08:06:18,225 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [7] total 10 [2022-07-21 08:06:18,226 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1803596146] [2022-07-21 08:06:18,226 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-21 08:06:18,226 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-07-21 08:06:18,226 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 08:06:18,227 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-21 08:06:18,227 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2022-07-21 08:06:18,227 INFO L87 Difference]: Start difference. First operand 18133 states and 22352 transitions. Second operand has 5 states, 5 states have (on average 20.0) internal successors, (100), 4 states have internal predecessors, (100), 2 states have call successors, (9), 3 states have call predecessors, (9), 4 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2022-07-21 08:06:19,979 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 08:06:19,980 INFO L93 Difference]: Finished difference Result 34065 states and 42439 transitions. [2022-07-21 08:06:19,980 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-21 08:06:19,980 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 20.0) internal successors, (100), 4 states have internal predecessors, (100), 2 states have call successors, (9), 3 states have call predecessors, (9), 4 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) Word has length 165 [2022-07-21 08:06:19,981 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 08:06:20,020 INFO L225 Difference]: With dead ends: 34065 [2022-07-21 08:06:20,020 INFO L226 Difference]: Without dead ends: 18133 [2022-07-21 08:06:20,041 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 193 GetRequests, 184 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=88, Unknown=0, NotChecked=0, Total=110 [2022-07-21 08:06:20,041 INFO L413 NwaCegarLoop]: 280 mSDtfsCounter, 352 mSDsluCounter, 293 mSDsCounter, 0 mSdLazyCounter, 214 mSolverCounterSat, 44 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 371 SdHoareTripleChecker+Valid, 573 SdHoareTripleChecker+Invalid, 258 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 44 IncrementalHoareTripleChecker+Valid, 214 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-07-21 08:06:20,041 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [371 Valid, 573 Invalid, 258 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [44 Valid, 214 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-07-21 08:06:20,052 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18133 states. [2022-07-21 08:06:21,352 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18133 to 18133. [2022-07-21 08:06:21,365 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18133 states, 15366 states have (on average 1.1799427307041521) internal successors, (18131), 15648 states have internal predecessors, (18131), 1353 states have call successors, (1353), 1032 states have call predecessors, (1353), 1412 states have return successors, (2496), 1456 states have call predecessors, (2496), 1350 states have call successors, (2496) [2022-07-21 08:06:21,394 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18133 states to 18133 states and 21980 transitions. [2022-07-21 08:06:21,396 INFO L78 Accepts]: Start accepts. Automaton has 18133 states and 21980 transitions. Word has length 165 [2022-07-21 08:06:21,397 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 08:06:21,397 INFO L495 AbstractCegarLoop]: Abstraction has 18133 states and 21980 transitions. [2022-07-21 08:06:21,397 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 20.0) internal successors, (100), 4 states have internal predecessors, (100), 2 states have call successors, (9), 3 states have call predecessors, (9), 4 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2022-07-21 08:06:21,397 INFO L276 IsEmpty]: Start isEmpty. Operand 18133 states and 21980 transitions. [2022-07-21 08:06:21,406 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 166 [2022-07-21 08:06:21,406 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 08:06:21,406 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-21 08:06:21,423 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Forceful destruction successful, exit code 0 [2022-07-21 08:06:21,607 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable36,15 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-21 08:06:21,607 INFO L420 AbstractCegarLoop]: === Iteration 38 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-21 08:06:21,607 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 08:06:21,608 INFO L85 PathProgramCache]: Analyzing trace with hash -810082834, now seen corresponding path program 1 times [2022-07-21 08:06:21,608 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 08:06:21,608 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1194361343] [2022-07-21 08:06:21,608 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 08:06:21,608 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 08:06:21,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 08:06:21,622 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-07-21 08:06:21,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 08:06:21,632 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-07-21 08:06:21,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 08:06:21,639 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2022-07-21 08:06:21,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 08:06:21,667 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2022-07-21 08:06:21,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 08:06:21,669 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2022-07-21 08:06:21,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 08:06:21,671 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2022-07-21 08:06:21,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 08:06:21,672 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2022-07-21 08:06:21,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 08:06:21,674 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-07-21 08:06:21,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 08:06:21,677 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 120 [2022-07-21 08:06:21,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 08:06:21,680 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-07-21 08:06:21,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 08:06:21,682 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 150 [2022-07-21 08:06:21,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 08:06:21,683 INFO L134 CoverageAnalysis]: Checked inductivity of 104 backedges. 0 proven. 22 refuted. 0 times theorem prover too weak. 82 trivial. 0 not checked. [2022-07-21 08:06:21,684 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 08:06:21,684 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1194361343] [2022-07-21 08:06:21,684 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1194361343] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-21 08:06:21,684 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [177050863] [2022-07-21 08:06:21,684 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 08:06:21,684 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-21 08:06:21,685 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-21 08:06:21,688 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-21 08:06:21,693 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Waiting until timeout for monitored process [2022-07-21 08:06:21,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 08:06:21,774 INFO L263 TraceCheckSpWp]: Trace formula consists of 563 conjuncts, 6 conjunts are in the unsatisfiable core [2022-07-21 08:06:21,777 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-21 08:06:21,841 INFO L134 CoverageAnalysis]: Checked inductivity of 104 backedges. 39 proven. 0 refuted. 0 times theorem prover too weak. 65 trivial. 0 not checked. [2022-07-21 08:06:21,841 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-21 08:06:21,841 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [177050863] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-21 08:06:21,841 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-07-21 08:06:21,842 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [7] total 10 [2022-07-21 08:06:21,842 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2059660211] [2022-07-21 08:06:21,842 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-21 08:06:21,842 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-07-21 08:06:21,843 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 08:06:21,843 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-21 08:06:21,843 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2022-07-21 08:06:21,843 INFO L87 Difference]: Start difference. First operand 18133 states and 21980 transitions. Second operand has 5 states, 5 states have (on average 20.0) internal successors, (100), 4 states have internal predecessors, (100), 2 states have call successors, (9), 3 states have call predecessors, (9), 4 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2022-07-21 08:06:23,201 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 08:06:23,201 INFO L93 Difference]: Finished difference Result 27073 states and 33157 transitions. [2022-07-21 08:06:23,202 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-21 08:06:23,202 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 20.0) internal successors, (100), 4 states have internal predecessors, (100), 2 states have call successors, (9), 3 states have call predecessors, (9), 4 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) Word has length 165 [2022-07-21 08:06:23,202 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 08:06:23,229 INFO L225 Difference]: With dead ends: 27073 [2022-07-21 08:06:23,229 INFO L226 Difference]: Without dead ends: 15711 [2022-07-21 08:06:23,241 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 193 GetRequests, 184 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=22, Invalid=88, Unknown=0, NotChecked=0, Total=110 [2022-07-21 08:06:23,241 INFO L413 NwaCegarLoop]: 277 mSDtfsCounter, 348 mSDsluCounter, 289 mSDsCounter, 0 mSdLazyCounter, 214 mSolverCounterSat, 44 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 367 SdHoareTripleChecker+Valid, 566 SdHoareTripleChecker+Invalid, 258 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 44 IncrementalHoareTripleChecker+Valid, 214 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-07-21 08:06:23,241 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [367 Valid, 566 Invalid, 258 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [44 Valid, 214 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-07-21 08:06:23,249 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15711 states. [2022-07-21 08:06:24,320 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15711 to 12330. [2022-07-21 08:06:24,328 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12330 states, 10442 states have (on average 1.1630913618080827) internal successors, (12145), 10615 states have internal predecessors, (12145), 935 states have call successors, (935), 702 states have call predecessors, (935), 951 states have return successors, (1680), 1014 states have call predecessors, (1680), 932 states have call successors, (1680) [2022-07-21 08:06:24,351 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12330 states to 12330 states and 14760 transitions. [2022-07-21 08:06:24,353 INFO L78 Accepts]: Start accepts. Automaton has 12330 states and 14760 transitions. Word has length 165 [2022-07-21 08:06:24,353 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 08:06:24,353 INFO L495 AbstractCegarLoop]: Abstraction has 12330 states and 14760 transitions. [2022-07-21 08:06:24,353 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 20.0) internal successors, (100), 4 states have internal predecessors, (100), 2 states have call successors, (9), 3 states have call predecessors, (9), 4 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2022-07-21 08:06:24,353 INFO L276 IsEmpty]: Start isEmpty. Operand 12330 states and 14760 transitions. [2022-07-21 08:06:24,359 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 166 [2022-07-21 08:06:24,359 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 08:06:24,359 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-21 08:06:24,376 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Ended with exit code 0 [2022-07-21 08:06:24,561 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable37 [2022-07-21 08:06:24,561 INFO L420 AbstractCegarLoop]: === Iteration 39 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-21 08:06:24,561 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 08:06:24,562 INFO L85 PathProgramCache]: Analyzing trace with hash -322035728, now seen corresponding path program 1 times [2022-07-21 08:06:24,562 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 08:06:24,562 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1433133842] [2022-07-21 08:06:24,562 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 08:06:24,562 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 08:06:24,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 08:06:24,580 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-07-21 08:06:24,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 08:06:24,588 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-07-21 08:06:24,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 08:06:24,596 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2022-07-21 08:06:24,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 08:06:24,625 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2022-07-21 08:06:24,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 08:06:24,627 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2022-07-21 08:06:24,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 08:06:24,629 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2022-07-21 08:06:24,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 08:06:24,631 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2022-07-21 08:06:24,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 08:06:24,635 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-07-21 08:06:24,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 08:06:24,638 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 120 [2022-07-21 08:06:24,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 08:06:24,642 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-07-21 08:06:24,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 08:06:24,645 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 150 [2022-07-21 08:06:24,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 08:06:24,650 INFO L134 CoverageAnalysis]: Checked inductivity of 104 backedges. 0 proven. 22 refuted. 0 times theorem prover too weak. 82 trivial. 0 not checked. [2022-07-21 08:06:24,650 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 08:06:24,650 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1433133842] [2022-07-21 08:06:24,651 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1433133842] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-21 08:06:24,651 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1221282434] [2022-07-21 08:06:24,651 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 08:06:24,651 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-21 08:06:24,651 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-21 08:06:24,652 INFO L229 MonitoredProcess]: Starting monitored process 17 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-21 08:06:24,655 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Waiting until timeout for monitored process [2022-07-21 08:06:24,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 08:06:24,756 INFO L263 TraceCheckSpWp]: Trace formula consists of 560 conjuncts, 7 conjunts are in the unsatisfiable core [2022-07-21 08:06:24,758 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-21 08:06:24,792 INFO L134 CoverageAnalysis]: Checked inductivity of 104 backedges. 23 proven. 0 refuted. 0 times theorem prover too weak. 81 trivial. 0 not checked. [2022-07-21 08:06:24,792 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-21 08:06:24,793 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1221282434] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-21 08:06:24,793 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-07-21 08:06:24,793 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [7] total 7 [2022-07-21 08:06:24,793 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [229298] [2022-07-21 08:06:24,793 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-21 08:06:24,794 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-07-21 08:06:24,794 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 08:06:24,794 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-21 08:06:24,794 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-07-21 08:06:24,795 INFO L87 Difference]: Start difference. First operand 12330 states and 14760 transitions. Second operand has 5 states, 5 states have (on average 18.8) internal successors, (94), 5 states have internal predecessors, (94), 2 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2022-07-21 08:06:26,097 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 08:06:26,097 INFO L93 Difference]: Finished difference Result 22316 states and 27242 transitions. [2022-07-21 08:06:26,098 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-07-21 08:06:26,098 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 18.8) internal successors, (94), 5 states have internal predecessors, (94), 2 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) Word has length 165 [2022-07-21 08:06:26,098 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 08:06:26,121 INFO L225 Difference]: With dead ends: 22316 [2022-07-21 08:06:26,121 INFO L226 Difference]: Without dead ends: 12189 [2022-07-21 08:06:26,133 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 194 GetRequests, 185 SyntacticMatches, 2 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2022-07-21 08:06:26,134 INFO L413 NwaCegarLoop]: 305 mSDtfsCounter, 49 mSDsluCounter, 929 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 49 SdHoareTripleChecker+Valid, 1234 SdHoareTripleChecker+Invalid, 14 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-21 08:06:26,134 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [49 Valid, 1234 Invalid, 14 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-21 08:06:26,140 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12189 states. [2022-07-21 08:06:27,044 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12189 to 11933. [2022-07-21 08:06:27,053 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11933 states, 10063 states have (on average 1.1470734373447282) internal successors, (11543), 10225 states have internal predecessors, (11543), 935 states have call successors, (935), 702 states have call predecessors, (935), 933 states have return successors, (1572), 1007 states have call predecessors, (1572), 932 states have call successors, (1572) [2022-07-21 08:06:27,160 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11933 states to 11933 states and 14050 transitions. [2022-07-21 08:06:27,161 INFO L78 Accepts]: Start accepts. Automaton has 11933 states and 14050 transitions. Word has length 165 [2022-07-21 08:06:27,162 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 08:06:27,162 INFO L495 AbstractCegarLoop]: Abstraction has 11933 states and 14050 transitions. [2022-07-21 08:06:27,162 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 18.8) internal successors, (94), 5 states have internal predecessors, (94), 2 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2022-07-21 08:06:27,162 INFO L276 IsEmpty]: Start isEmpty. Operand 11933 states and 14050 transitions. [2022-07-21 08:06:27,166 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 166 [2022-07-21 08:06:27,166 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 08:06:27,166 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-21 08:06:27,184 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Forceful destruction successful, exit code 0 [2022-07-21 08:06:27,367 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable38 [2022-07-21 08:06:27,367 INFO L420 AbstractCegarLoop]: === Iteration 40 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-21 08:06:27,367 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 08:06:27,367 INFO L85 PathProgramCache]: Analyzing trace with hash -490424150, now seen corresponding path program 1 times [2022-07-21 08:06:27,368 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 08:06:27,368 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [899820610] [2022-07-21 08:06:27,368 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 08:06:27,368 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 08:06:27,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 08:06:27,380 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-07-21 08:06:27,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 08:06:27,392 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-07-21 08:06:27,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 08:06:27,398 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2022-07-21 08:06:27,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 08:06:27,427 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2022-07-21 08:06:27,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 08:06:27,429 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2022-07-21 08:06:27,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 08:06:27,430 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2022-07-21 08:06:27,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 08:06:27,431 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2022-07-21 08:06:27,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 08:06:27,434 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-07-21 08:06:27,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 08:06:27,436 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 120 [2022-07-21 08:06:27,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 08:06:27,439 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-07-21 08:06:27,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 08:06:27,441 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 150 [2022-07-21 08:06:27,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 08:06:27,442 INFO L134 CoverageAnalysis]: Checked inductivity of 104 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 94 trivial. 0 not checked. [2022-07-21 08:06:27,443 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 08:06:27,443 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [899820610] [2022-07-21 08:06:27,443 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [899820610] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-21 08:06:27,443 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1831001109] [2022-07-21 08:06:27,443 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 08:06:27,443 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-21 08:06:27,444 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-21 08:06:27,446 INFO L229 MonitoredProcess]: Starting monitored process 18 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-21 08:06:27,447 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Waiting until timeout for monitored process [2022-07-21 08:06:27,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 08:06:27,543 INFO L263 TraceCheckSpWp]: Trace formula consists of 557 conjuncts, 7 conjunts are in the unsatisfiable core [2022-07-21 08:06:27,546 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-21 08:06:27,570 INFO L134 CoverageAnalysis]: Checked inductivity of 104 backedges. 35 proven. 0 refuted. 0 times theorem prover too weak. 69 trivial. 0 not checked. [2022-07-21 08:06:27,570 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-21 08:06:27,570 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1831001109] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-21 08:06:27,570 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-07-21 08:06:27,570 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [7] total 7 [2022-07-21 08:06:27,571 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1219167474] [2022-07-21 08:06:27,571 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-21 08:06:27,571 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-07-21 08:06:27,571 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 08:06:27,572 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-21 08:06:27,572 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-07-21 08:06:27,572 INFO L87 Difference]: Start difference. First operand 11933 states and 14050 transitions. Second operand has 5 states, 5 states have (on average 19.8) internal successors, (99), 5 states have internal predecessors, (99), 2 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2022-07-21 08:06:28,460 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 08:06:28,460 INFO L93 Difference]: Finished difference Result 18276 states and 21782 transitions. [2022-07-21 08:06:28,461 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-07-21 08:06:28,461 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 19.8) internal successors, (99), 5 states have internal predecessors, (99), 2 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) Word has length 165 [2022-07-21 08:06:28,461 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 08:06:28,477 INFO L225 Difference]: With dead ends: 18276 [2022-07-21 08:06:28,477 INFO L226 Difference]: Without dead ends: 8543 [2022-07-21 08:06:28,490 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 194 GetRequests, 185 SyntacticMatches, 2 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2022-07-21 08:06:28,490 INFO L413 NwaCegarLoop]: 305 mSDtfsCounter, 10 mSDsluCounter, 914 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 1219 SdHoareTripleChecker+Invalid, 14 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-21 08:06:28,490 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [10 Valid, 1219 Invalid, 14 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-21 08:06:28,495 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8543 states. [2022-07-21 08:06:29,234 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8543 to 8507. [2022-07-21 08:06:29,240 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8507 states, 7210 states have (on average 1.1402219140083218) internal successors, (8221), 7284 states have internal predecessors, (8221), 664 states have call successors, (664), 502 states have call predecessors, (664), 631 states have return successors, (965), 721 states have call predecessors, (965), 661 states have call successors, (965) [2022-07-21 08:06:29,252 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8507 states to 8507 states and 9850 transitions. [2022-07-21 08:06:29,253 INFO L78 Accepts]: Start accepts. Automaton has 8507 states and 9850 transitions. Word has length 165 [2022-07-21 08:06:29,253 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 08:06:29,253 INFO L495 AbstractCegarLoop]: Abstraction has 8507 states and 9850 transitions. [2022-07-21 08:06:29,253 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 19.8) internal successors, (99), 5 states have internal predecessors, (99), 2 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2022-07-21 08:06:29,254 INFO L276 IsEmpty]: Start isEmpty. Operand 8507 states and 9850 transitions. [2022-07-21 08:06:29,258 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 201 [2022-07-21 08:06:29,258 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 08:06:29,258 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-21 08:06:29,276 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Forceful destruction successful, exit code 0 [2022-07-21 08:06:29,458 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 18 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable39 [2022-07-21 08:06:29,458 INFO L420 AbstractCegarLoop]: === Iteration 41 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-21 08:06:29,459 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 08:06:29,459 INFO L85 PathProgramCache]: Analyzing trace with hash 994864062, now seen corresponding path program 1 times [2022-07-21 08:06:29,459 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 08:06:29,459 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1250129073] [2022-07-21 08:06:29,459 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 08:06:29,459 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 08:06:29,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 08:06:29,484 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-07-21 08:06:29,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 08:06:29,494 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-07-21 08:06:29,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 08:06:29,502 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2022-07-21 08:06:29,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 08:06:29,505 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2022-07-21 08:06:29,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 08:06:29,506 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2022-07-21 08:06:29,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 08:06:29,507 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2022-07-21 08:06:29,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 08:06:29,509 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-07-21 08:06:29,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 08:06:29,511 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2022-07-21 08:06:29,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 08:06:29,518 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 121 [2022-07-21 08:06:29,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 08:06:29,521 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-07-21 08:06:29,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 08:06:29,523 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 155 [2022-07-21 08:06:29,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 08:06:29,526 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-07-21 08:06:29,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 08:06:29,528 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 185 [2022-07-21 08:06:29,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 08:06:29,530 INFO L134 CoverageAnalysis]: Checked inductivity of 169 backedges. 29 proven. 3 refuted. 0 times theorem prover too weak. 137 trivial. 0 not checked. [2022-07-21 08:06:29,530 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 08:06:29,530 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1250129073] [2022-07-21 08:06:29,530 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1250129073] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-21 08:06:29,530 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1417898087] [2022-07-21 08:06:29,530 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 08:06:29,531 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-21 08:06:29,531 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-21 08:06:29,532 INFO L229 MonitoredProcess]: Starting monitored process 19 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-21 08:06:29,533 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Waiting until timeout for monitored process [2022-07-21 08:06:29,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 08:06:29,635 INFO L263 TraceCheckSpWp]: Trace formula consists of 643 conjuncts, 2 conjunts are in the unsatisfiable core [2022-07-21 08:06:29,637 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-21 08:06:29,658 INFO L134 CoverageAnalysis]: Checked inductivity of 169 backedges. 120 proven. 0 refuted. 0 times theorem prover too weak. 49 trivial. 0 not checked. [2022-07-21 08:06:29,658 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-21 08:06:29,658 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1417898087] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-21 08:06:29,658 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-07-21 08:06:29,658 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [7] total 8 [2022-07-21 08:06:29,659 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1861001807] [2022-07-21 08:06:29,659 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-21 08:06:29,659 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-21 08:06:29,659 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 08:06:29,660 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-21 08:06:29,660 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2022-07-21 08:06:29,660 INFO L87 Difference]: Start difference. First operand 8507 states and 9850 transitions. Second operand has 3 states, 3 states have (on average 44.666666666666664) internal successors, (134), 3 states have internal predecessors, (134), 3 states have call successors, (13), 3 states have call predecessors, (13), 2 states have return successors, (12), 2 states have call predecessors, (12), 3 states have call successors, (12) [2022-07-21 08:06:30,041 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 08:06:30,041 INFO L93 Difference]: Finished difference Result 10600 states and 12240 transitions. [2022-07-21 08:06:30,042 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-21 08:06:30,042 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 44.666666666666664) internal successors, (134), 3 states have internal predecessors, (134), 3 states have call successors, (13), 3 states have call predecessors, (13), 2 states have return successors, (12), 2 states have call predecessors, (12), 3 states have call successors, (12) Word has length 200 [2022-07-21 08:06:30,042 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 08:06:30,049 INFO L225 Difference]: With dead ends: 10600 [2022-07-21 08:06:30,049 INFO L226 Difference]: Without dead ends: 4221 [2022-07-21 08:06:30,057 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 230 GetRequests, 224 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2022-07-21 08:06:30,057 INFO L413 NwaCegarLoop]: 394 mSDtfsCounter, 135 mSDsluCounter, 273 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 135 SdHoareTripleChecker+Valid, 667 SdHoareTripleChecker+Invalid, 9 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-21 08:06:30,057 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [135 Valid, 667 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-21 08:06:30,060 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4221 states. [2022-07-21 08:06:30,354 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4221 to 4221. [2022-07-21 08:06:30,357 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4221 states, 3526 states have (on average 1.136415201361316) internal successors, (4007), 3555 states have internal predecessors, (4007), 362 states have call successors, (362), 268 states have call predecessors, (362), 331 states have return successors, (464), 398 states have call predecessors, (464), 359 states have call successors, (464) [2022-07-21 08:06:30,415 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4221 states to 4221 states and 4833 transitions. [2022-07-21 08:06:30,416 INFO L78 Accepts]: Start accepts. Automaton has 4221 states and 4833 transitions. Word has length 200 [2022-07-21 08:06:30,417 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 08:06:30,417 INFO L495 AbstractCegarLoop]: Abstraction has 4221 states and 4833 transitions. [2022-07-21 08:06:30,417 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 44.666666666666664) internal successors, (134), 3 states have internal predecessors, (134), 3 states have call successors, (13), 3 states have call predecessors, (13), 2 states have return successors, (12), 2 states have call predecessors, (12), 3 states have call successors, (12) [2022-07-21 08:06:30,417 INFO L276 IsEmpty]: Start isEmpty. Operand 4221 states and 4833 transitions. [2022-07-21 08:06:30,419 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 202 [2022-07-21 08:06:30,419 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 08:06:30,419 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-21 08:06:30,436 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Forceful destruction successful, exit code 0 [2022-07-21 08:06:30,619 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable40,19 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-21 08:06:30,620 INFO L420 AbstractCegarLoop]: === Iteration 42 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-21 08:06:30,620 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 08:06:30,620 INFO L85 PathProgramCache]: Analyzing trace with hash 1498322473, now seen corresponding path program 1 times [2022-07-21 08:06:30,620 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 08:06:30,620 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [570676553] [2022-07-21 08:06:30,621 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 08:06:30,621 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 08:06:30,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 08:06:30,656 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-07-21 08:06:30,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 08:06:30,665 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-07-21 08:06:30,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 08:06:30,672 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2022-07-21 08:06:30,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 08:06:30,675 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2022-07-21 08:06:30,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 08:06:30,676 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2022-07-21 08:06:30,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 08:06:30,677 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2022-07-21 08:06:30,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 08:06:30,679 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2022-07-21 08:06:30,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 08:06:30,686 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-07-21 08:06:30,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 08:06:30,692 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2022-07-21 08:06:30,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 08:06:30,702 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-07-21 08:06:30,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 08:06:30,708 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 156 [2022-07-21 08:06:30,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 08:06:30,711 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-07-21 08:06:30,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 08:06:30,716 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 186 [2022-07-21 08:06:30,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 08:06:30,718 INFO L134 CoverageAnalysis]: Checked inductivity of 170 backedges. 53 proven. 41 refuted. 0 times theorem prover too weak. 76 trivial. 0 not checked. [2022-07-21 08:06:30,718 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 08:06:30,718 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [570676553] [2022-07-21 08:06:30,718 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [570676553] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-21 08:06:30,718 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [687461954] [2022-07-21 08:06:30,718 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 08:06:30,719 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-21 08:06:30,719 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-21 08:06:30,720 INFO L229 MonitoredProcess]: Starting monitored process 20 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-21 08:06:30,725 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Waiting until timeout for monitored process [2022-07-21 08:06:30,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 08:06:30,829 INFO L263 TraceCheckSpWp]: Trace formula consists of 655 conjuncts, 3 conjunts are in the unsatisfiable core [2022-07-21 08:06:30,831 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-21 08:06:30,896 INFO L134 CoverageAnalysis]: Checked inductivity of 170 backedges. 147 proven. 0 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2022-07-21 08:06:30,896 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-21 08:06:30,897 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [687461954] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-21 08:06:30,897 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-07-21 08:06:30,897 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [6] total 6 [2022-07-21 08:06:30,897 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1760136502] [2022-07-21 08:06:30,897 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-21 08:06:30,897 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-21 08:06:30,897 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 08:06:30,897 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-21 08:06:30,898 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-21 08:06:30,898 INFO L87 Difference]: Start difference. First operand 4221 states and 4833 transitions. Second operand has 3 states, 3 states have (on average 52.666666666666664) internal successors, (158), 3 states have internal predecessors, (158), 3 states have call successors, (13), 3 states have call predecessors, (13), 3 states have return successors, (13), 3 states have call predecessors, (13), 3 states have call successors, (13) [2022-07-21 08:06:31,186 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 08:06:31,187 INFO L93 Difference]: Finished difference Result 5724 states and 6542 transitions. [2022-07-21 08:06:31,187 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-21 08:06:31,187 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 52.666666666666664) internal successors, (158), 3 states have internal predecessors, (158), 3 states have call successors, (13), 3 states have call predecessors, (13), 3 states have return successors, (13), 3 states have call predecessors, (13), 3 states have call successors, (13) Word has length 201 [2022-07-21 08:06:31,187 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 08:06:31,195 INFO L225 Difference]: With dead ends: 5724 [2022-07-21 08:06:31,195 INFO L226 Difference]: Without dead ends: 4221 [2022-07-21 08:06:31,198 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 231 GetRequests, 225 SyntacticMatches, 2 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-21 08:06:31,198 INFO L413 NwaCegarLoop]: 376 mSDtfsCounter, 103 mSDsluCounter, 244 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 103 SdHoareTripleChecker+Valid, 620 SdHoareTripleChecker+Invalid, 8 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-21 08:06:31,198 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [103 Valid, 620 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-21 08:06:31,201 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4221 states. [2022-07-21 08:06:31,496 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4221 to 4221. [2022-07-21 08:06:31,499 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4221 states, 3526 states have (on average 1.131310266591038) internal successors, (3989), 3555 states have internal predecessors, (3989), 362 states have call successors, (362), 268 states have call predecessors, (362), 331 states have return successors, (464), 398 states have call predecessors, (464), 359 states have call successors, (464) [2022-07-21 08:06:31,504 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4221 states to 4221 states and 4815 transitions. [2022-07-21 08:06:31,505 INFO L78 Accepts]: Start accepts. Automaton has 4221 states and 4815 transitions. Word has length 201 [2022-07-21 08:06:31,505 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 08:06:31,505 INFO L495 AbstractCegarLoop]: Abstraction has 4221 states and 4815 transitions. [2022-07-21 08:06:31,505 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 52.666666666666664) internal successors, (158), 3 states have internal predecessors, (158), 3 states have call successors, (13), 3 states have call predecessors, (13), 3 states have return successors, (13), 3 states have call predecessors, (13), 3 states have call successors, (13) [2022-07-21 08:06:31,505 INFO L276 IsEmpty]: Start isEmpty. Operand 4221 states and 4815 transitions. [2022-07-21 08:06:31,508 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 204 [2022-07-21 08:06:31,508 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 08:06:31,508 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-21 08:06:31,525 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Forceful destruction successful, exit code 0 [2022-07-21 08:06:31,708 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable41,20 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-21 08:06:31,708 INFO L420 AbstractCegarLoop]: === Iteration 43 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-21 08:06:31,709 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 08:06:31,709 INFO L85 PathProgramCache]: Analyzing trace with hash -1332935587, now seen corresponding path program 1 times [2022-07-21 08:06:31,709 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 08:06:31,709 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [7655510] [2022-07-21 08:06:31,709 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 08:06:31,709 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 08:06:31,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 08:06:31,779 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-07-21 08:06:31,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 08:06:31,789 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-07-21 08:06:31,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 08:06:31,797 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2022-07-21 08:06:31,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 08:06:31,799 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2022-07-21 08:06:31,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 08:06:31,800 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2022-07-21 08:06:31,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 08:06:31,801 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2022-07-21 08:06:31,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 08:06:31,802 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2022-07-21 08:06:31,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 08:06:31,805 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-07-21 08:06:31,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 08:06:31,808 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2022-07-21 08:06:31,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 08:06:31,812 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-07-21 08:06:31,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 08:06:31,814 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 157 [2022-07-21 08:06:31,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 08:06:31,819 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-07-21 08:06:31,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 08:06:31,821 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 188 [2022-07-21 08:06:31,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 08:06:31,823 INFO L134 CoverageAnalysis]: Checked inductivity of 173 backedges. 25 proven. 0 refuted. 0 times theorem prover too weak. 148 trivial. 0 not checked. [2022-07-21 08:06:31,823 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 08:06:31,823 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [7655510] [2022-07-21 08:06:31,823 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [7655510] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-21 08:06:31,823 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-21 08:06:31,824 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-07-21 08:06:31,824 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1026745392] [2022-07-21 08:06:31,824 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-21 08:06:31,824 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-07-21 08:06:31,825 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 08:06:31,825 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-07-21 08:06:31,825 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-07-21 08:06:31,826 INFO L87 Difference]: Start difference. First operand 4221 states and 4815 transitions. Second operand has 7 states, 7 states have (on average 16.0) internal successors, (112), 5 states have internal predecessors, (112), 6 states have call successors, (11), 4 states have call predecessors, (11), 1 states have return successors, (10), 4 states have call predecessors, (10), 5 states have call successors, (10) [2022-07-21 08:06:32,936 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 08:06:32,937 INFO L93 Difference]: Finished difference Result 4499 states and 5108 transitions. [2022-07-21 08:06:32,937 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-07-21 08:06:32,937 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 16.0) internal successors, (112), 5 states have internal predecessors, (112), 6 states have call successors, (11), 4 states have call predecessors, (11), 1 states have return successors, (10), 4 states have call predecessors, (10), 5 states have call successors, (10) Word has length 203 [2022-07-21 08:06:32,938 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 08:06:32,949 INFO L225 Difference]: With dead ends: 4499 [2022-07-21 08:06:32,949 INFO L226 Difference]: Without dead ends: 4456 [2022-07-21 08:06:32,952 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 36 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=56, Invalid=184, Unknown=0, NotChecked=0, Total=240 [2022-07-21 08:06:32,952 INFO L413 NwaCegarLoop]: 454 mSDtfsCounter, 888 mSDsluCounter, 789 mSDsCounter, 0 mSdLazyCounter, 928 mSolverCounterSat, 117 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 931 SdHoareTripleChecker+Valid, 1243 SdHoareTripleChecker+Invalid, 1045 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 117 IncrementalHoareTripleChecker+Valid, 928 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-07-21 08:06:32,952 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [931 Valid, 1243 Invalid, 1045 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [117 Valid, 928 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-07-21 08:06:32,956 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4456 states. [2022-07-21 08:06:33,319 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4456 to 4152. [2022-07-21 08:06:33,322 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4152 states, 3468 states have (on average 1.130334486735871) internal successors, (3920), 3497 states have internal predecessors, (3920), 355 states have call successors, (355), 263 states have call predecessors, (355), 327 states have return successors, (459), 392 states have call predecessors, (459), 353 states have call successors, (459) [2022-07-21 08:06:33,328 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4152 states to 4152 states and 4734 transitions. [2022-07-21 08:06:33,328 INFO L78 Accepts]: Start accepts. Automaton has 4152 states and 4734 transitions. Word has length 203 [2022-07-21 08:06:33,329 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 08:06:33,329 INFO L495 AbstractCegarLoop]: Abstraction has 4152 states and 4734 transitions. [2022-07-21 08:06:33,329 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 16.0) internal successors, (112), 5 states have internal predecessors, (112), 6 states have call successors, (11), 4 states have call predecessors, (11), 1 states have return successors, (10), 4 states have call predecessors, (10), 5 states have call successors, (10) [2022-07-21 08:06:33,329 INFO L276 IsEmpty]: Start isEmpty. Operand 4152 states and 4734 transitions. [2022-07-21 08:06:33,332 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 208 [2022-07-21 08:06:33,332 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 08:06:33,332 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-21 08:06:33,332 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable42 [2022-07-21 08:06:33,332 INFO L420 AbstractCegarLoop]: === Iteration 44 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-21 08:06:33,332 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 08:06:33,333 INFO L85 PathProgramCache]: Analyzing trace with hash 424573701, now seen corresponding path program 1 times [2022-07-21 08:06:33,333 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 08:06:33,333 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1232377063] [2022-07-21 08:06:33,333 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 08:06:33,333 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 08:06:33,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 08:06:33,361 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-07-21 08:06:33,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 08:06:33,371 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-07-21 08:06:33,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 08:06:33,379 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2022-07-21 08:06:33,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 08:06:33,382 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2022-07-21 08:06:33,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 08:06:33,383 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2022-07-21 08:06:33,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 08:06:33,384 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2022-07-21 08:06:33,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 08:06:33,385 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2022-07-21 08:06:33,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 08:06:33,387 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-07-21 08:06:33,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 08:06:33,390 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2022-07-21 08:06:33,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 08:06:33,393 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-07-21 08:06:33,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 08:06:33,396 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 157 [2022-07-21 08:06:33,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 08:06:33,399 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-07-21 08:06:33,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 08:06:33,401 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 188 [2022-07-21 08:06:33,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 08:06:33,403 INFO L134 CoverageAnalysis]: Checked inductivity of 173 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 173 trivial. 0 not checked. [2022-07-21 08:06:33,403 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 08:06:33,403 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1232377063] [2022-07-21 08:06:33,403 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1232377063] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-21 08:06:33,403 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-21 08:06:33,404 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-07-21 08:06:33,404 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1741582270] [2022-07-21 08:06:33,404 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-21 08:06:33,404 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-07-21 08:06:33,404 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 08:06:33,405 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-21 08:06:33,405 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-07-21 08:06:33,405 INFO L87 Difference]: Start difference. First operand 4152 states and 4734 transitions. Second operand has 5 states, 5 states have (on average 20.2) internal successors, (101), 3 states have internal predecessors, (101), 3 states have call successors, (10), 4 states have call predecessors, (10), 1 states have return successors, (9), 1 states have call predecessors, (9), 2 states have call successors, (9) [2022-07-21 08:06:34,155 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 08:06:34,156 INFO L93 Difference]: Finished difference Result 5472 states and 6267 transitions. [2022-07-21 08:06:34,156 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-07-21 08:06:34,156 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 20.2) internal successors, (101), 3 states have internal predecessors, (101), 3 states have call successors, (10), 4 states have call predecessors, (10), 1 states have return successors, (9), 1 states have call predecessors, (9), 2 states have call successors, (9) Word has length 207 [2022-07-21 08:06:34,156 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 08:06:34,164 INFO L225 Difference]: With dead ends: 5472 [2022-07-21 08:06:34,165 INFO L226 Difference]: Without dead ends: 4531 [2022-07-21 08:06:34,167 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-07-21 08:06:34,168 INFO L413 NwaCegarLoop]: 356 mSDtfsCounter, 296 mSDsluCounter, 495 mSDsCounter, 0 mSdLazyCounter, 350 mSolverCounterSat, 61 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 309 SdHoareTripleChecker+Valid, 851 SdHoareTripleChecker+Invalid, 411 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 61 IncrementalHoareTripleChecker+Valid, 350 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-07-21 08:06:34,169 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [309 Valid, 851 Invalid, 411 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [61 Valid, 350 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-07-21 08:06:34,172 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4531 states. [2022-07-21 08:06:34,505 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4531 to 4154. [2022-07-21 08:06:34,508 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4154 states, 3470 states have (on average 1.1302593659942364) internal successors, (3922), 3499 states have internal predecessors, (3922), 355 states have call successors, (355), 263 states have call predecessors, (355), 327 states have return successors, (459), 392 states have call predecessors, (459), 353 states have call successors, (459) [2022-07-21 08:06:34,514 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4154 states to 4154 states and 4736 transitions. [2022-07-21 08:06:34,515 INFO L78 Accepts]: Start accepts. Automaton has 4154 states and 4736 transitions. Word has length 207 [2022-07-21 08:06:34,515 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 08:06:34,515 INFO L495 AbstractCegarLoop]: Abstraction has 4154 states and 4736 transitions. [2022-07-21 08:06:34,515 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 20.2) internal successors, (101), 3 states have internal predecessors, (101), 3 states have call successors, (10), 4 states have call predecessors, (10), 1 states have return successors, (9), 1 states have call predecessors, (9), 2 states have call successors, (9) [2022-07-21 08:06:34,515 INFO L276 IsEmpty]: Start isEmpty. Operand 4154 states and 4736 transitions. [2022-07-21 08:06:34,518 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 209 [2022-07-21 08:06:34,518 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 08:06:34,518 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-21 08:06:34,518 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable43 [2022-07-21 08:06:34,518 INFO L420 AbstractCegarLoop]: === Iteration 45 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-21 08:06:34,518 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 08:06:34,518 INFO L85 PathProgramCache]: Analyzing trace with hash 1505939270, now seen corresponding path program 1 times [2022-07-21 08:06:34,518 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 08:06:34,518 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1315540195] [2022-07-21 08:06:34,519 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 08:06:34,519 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 08:06:34,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-21 08:06:34,536 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-21 08:06:34,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-21 08:06:34,640 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-21 08:06:34,640 INFO L271 BasicCegarLoop]: Counterexample is feasible [2022-07-21 08:06:34,641 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location error2Err0ASSERT_VIOLATIONERROR_FUNCTION (1 of 2 remaining) [2022-07-21 08:06:34,643 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location error1Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 2 remaining) [2022-07-21 08:06:34,644 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable44 [2022-07-21 08:06:34,648 INFO L356 BasicCegarLoop]: Path program histogram: [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-21 08:06:34,653 INFO L176 ceAbstractionStarter]: Computing trace abstraction results [2022-07-21 08:06:34,833 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 21.07 08:06:34 BoogieIcfgContainer [2022-07-21 08:06:34,833 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-07-21 08:06:34,834 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-07-21 08:06:34,834 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-07-21 08:06:34,834 INFO L275 PluginConnector]: Witness Printer initialized [2022-07-21 08:06:34,834 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.07 08:05:16" (3/4) ... [2022-07-21 08:06:34,836 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2022-07-21 08:06:34,990 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2022-07-21 08:06:34,990 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-07-21 08:06:34,990 INFO L158 Benchmark]: Toolchain (without parser) took 79187.29ms. Allocated memory was 58.7MB in the beginning and 8.8GB in the end (delta: 8.7GB). Free memory was 36.6MB in the beginning and 7.4GB in the end (delta: -7.3GB). Peak memory consumption was 1.4GB. Max. memory is 16.1GB. [2022-07-21 08:06:34,991 INFO L158 Benchmark]: CDTParser took 0.19ms. Allocated memory is still 58.7MB. Free memory was 40.1MB in the beginning and 40.0MB in the end (delta: 44.5kB). There was no memory consumed. Max. memory is 16.1GB. [2022-07-21 08:06:34,991 INFO L158 Benchmark]: CACSL2BoogieTranslator took 408.21ms. Allocated memory was 58.7MB in the beginning and 75.5MB in the end (delta: 16.8MB). Free memory was 36.3MB in the beginning and 54.6MB in the end (delta: -18.3MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. [2022-07-21 08:06:34,991 INFO L158 Benchmark]: Boogie Procedure Inliner took 52.88ms. Allocated memory is still 75.5MB. Free memory was 54.6MB in the beginning and 51.7MB in the end (delta: 2.9MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-07-21 08:06:34,992 INFO L158 Benchmark]: Boogie Preprocessor took 35.24ms. Allocated memory is still 75.5MB. Free memory was 51.7MB in the beginning and 49.2MB in the end (delta: 2.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-07-21 08:06:34,992 INFO L158 Benchmark]: RCFGBuilder took 682.76ms. Allocated memory is still 75.5MB. Free memory was 49.2MB in the beginning and 42.5MB in the end (delta: 6.7MB). Peak memory consumption was 17.0MB. Max. memory is 16.1GB. [2022-07-21 08:06:34,992 INFO L158 Benchmark]: TraceAbstraction took 77845.53ms. Allocated memory was 75.5MB in the beginning and 8.8GB in the end (delta: 8.7GB). Free memory was 41.8MB in the beginning and 7.4GB in the end (delta: -7.4GB). Peak memory consumption was 1.4GB. Max. memory is 16.1GB. [2022-07-21 08:06:34,993 INFO L158 Benchmark]: Witness Printer took 156.57ms. Allocated memory is still 8.8GB. Free memory was 7.4GB in the beginning and 7.4GB in the end (delta: 27.3MB). Peak memory consumption was 27.3MB. Max. memory is 16.1GB. [2022-07-21 08:06:35,000 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.19ms. Allocated memory is still 58.7MB. Free memory was 40.1MB in the beginning and 40.0MB in the end (delta: 44.5kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 408.21ms. Allocated memory was 58.7MB in the beginning and 75.5MB in the end (delta: 16.8MB). Free memory was 36.3MB in the beginning and 54.6MB in the end (delta: -18.3MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 52.88ms. Allocated memory is still 75.5MB. Free memory was 54.6MB in the beginning and 51.7MB in the end (delta: 2.9MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 35.24ms. Allocated memory is still 75.5MB. Free memory was 51.7MB in the beginning and 49.2MB in the end (delta: 2.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 682.76ms. Allocated memory is still 75.5MB. Free memory was 49.2MB in the beginning and 42.5MB in the end (delta: 6.7MB). Peak memory consumption was 17.0MB. Max. memory is 16.1GB. * TraceAbstraction took 77845.53ms. Allocated memory was 75.5MB in the beginning and 8.8GB in the end (delta: 8.7GB). Free memory was 41.8MB in the beginning and 7.4GB in the end (delta: -7.4GB). Peak memory consumption was 1.4GB. Max. memory is 16.1GB. * Witness Printer took 156.57ms. Allocated memory is still 8.8GB. Free memory was 7.4GB in the beginning and 7.4GB in the end (delta: 27.3MB). Peak memory consumption was 27.3MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - CounterExampleResult [Line: 496]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L33] int q_buf_0 ; [L34] int q_free ; [L35] int q_read_ev ; [L36] int q_write_ev ; [L37] int q_req_up ; [L38] int q_ev ; [L59] int p_num_write ; [L60] int p_last_write ; [L61] int p_dw_st ; [L62] int p_dw_pc ; [L63] int p_dw_i ; [L64] int c_num_read ; [L65] int c_last_read ; [L66] int c_dr_st ; [L67] int c_dr_pc ; [L68] int c_dr_i ; [L172] static int a_t ; [L500] int m_pc = 0; [L501] int t1_pc = 0; [L502] int t2_pc = 0; [L503] int m_st ; [L504] int t1_st ; [L505] int t2_st ; [L506] int m_i ; [L507] int t1_i ; [L508] int t2_i ; [L509] int M_E = 2; [L510] int T1_E = 2; [L511] int T2_E = 2; [L512] int E_M = 2; [L513] int E_1 = 2; [L514] int E_2 = 2; [L519] int token ; [L521] int local ; VAL [a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=2, E_M=2, local=0, M_E=2, m_i=0, m_pc=0, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, T1_E=2, t1_i=0, t1_pc=0, t1_st=0, T2_E=2, t2_i=0, t2_pc=0, t2_st=0, token=0] [L1099] COND FALSE !(__VERIFIER_nondet_int()) [L1102] CALL main2() [L1086] int __retres1 ; [L1090] CALL init_model2() [L1000] m_i = 1 [L1001] t1_i = 1 [L1002] t2_i = 1 VAL [a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, token=0] [L1090] RET init_model2() [L1091] CALL start_simulation2() [L1027] int kernel_st ; [L1028] int tmp ; [L1029] int tmp___0 ; [L1033] kernel_st = 0 VAL [a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=2, E_M=2, kernel_st=0, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, token=0] [L1034] FCALL update_channels2() VAL [a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=2, E_M=2, kernel_st=0, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, token=0] [L1035] CALL init_threads2() [L719] COND TRUE m_i == 1 [L720] m_st = 0 VAL [a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, token=0] [L724] COND TRUE t1_i == 1 [L725] t1_st = 0 VAL [a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, token=0] [L729] COND TRUE t2_i == 1 [L730] t2_st = 0 VAL [a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, token=0] [L1035] RET init_threads2() [L1036] CALL fire_delta_events2() VAL [\old(E_1)=2, \old(E_2)=2, \old(E_M)=2, \old(M_E)=2, \old(T1_E)=2, \old(T2_E)=2, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, token=0] [L832] COND FALSE !(M_E == 0) VAL [\old(E_1)=2, \old(E_2)=2, \old(E_M)=2, \old(M_E)=2, \old(T1_E)=2, \old(T2_E)=2, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, token=0] [L837] COND FALSE !(T1_E == 0) VAL [\old(E_1)=2, \old(E_2)=2, \old(E_M)=2, \old(M_E)=2, \old(T1_E)=2, \old(T2_E)=2, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, token=0] [L842] COND FALSE !(T2_E == 0) VAL [\old(E_1)=2, \old(E_2)=2, \old(E_M)=2, \old(M_E)=2, \old(T1_E)=2, \old(T2_E)=2, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, token=0] [L847] COND FALSE !(E_M == 0) VAL [\old(E_1)=2, \old(E_2)=2, \old(E_M)=2, \old(M_E)=2, \old(T1_E)=2, \old(T2_E)=2, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, token=0] [L852] COND FALSE !(E_1 == 0) VAL [\old(E_1)=2, \old(E_2)=2, \old(E_M)=2, \old(M_E)=2, \old(T1_E)=2, \old(T2_E)=2, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, token=0] [L857] COND FALSE !(E_2 == 0) VAL [\old(E_1)=2, \old(E_2)=2, \old(E_M)=2, \old(M_E)=2, \old(T1_E)=2, \old(T2_E)=2, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, token=0] [L1036] RET fire_delta_events2() VAL [a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=2, E_M=2, kernel_st=0, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, token=0] [L1037] CALL activate_threads2() VAL [\old(m_st)=0, \old(t1_st)=0, \old(t2_st)=0, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, token=0] [L905] int tmp ; [L906] int tmp___0 ; [L907] int tmp___1 ; [L911] CALL, EXPR is_master_triggered() [L651] int __retres1 ; VAL [\old(m_st)=0, \old(t1_st)=0, \old(t2_st)=0, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, token=0] [L654] COND FALSE !(m_pc == 1) VAL [\old(m_st)=0, \old(t1_st)=0, \old(t2_st)=0, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, token=0] [L664] __retres1 = 0 VAL [\old(m_st)=0, \old(t1_st)=0, \old(t2_st)=0, __retres1=0, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, token=0] [L666] return (__retres1); VAL [\old(m_st)=0, \old(t1_st)=0, \old(t2_st)=0, \result=0, __retres1=0, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, token=0] [L911] RET, EXPR is_master_triggered() [L911] tmp = is_master_triggered() [L913] COND FALSE !(\read(tmp)) VAL [\old(m_st)=0, \old(t1_st)=0, \old(t2_st)=0, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, tmp=0, token=0] [L919] CALL, EXPR is_transmit1_triggered() [L670] int __retres1 ; VAL [\old(m_st)=0, \old(t1_st)=0, \old(t2_st)=0, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, token=0] [L673] COND FALSE !(t1_pc == 1) VAL [\old(m_st)=0, \old(t1_st)=0, \old(t2_st)=0, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, token=0] [L683] __retres1 = 0 VAL [\old(m_st)=0, \old(t1_st)=0, \old(t2_st)=0, __retres1=0, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, token=0] [L685] return (__retres1); VAL [\old(m_st)=0, \old(t1_st)=0, \old(t2_st)=0, \result=0, __retres1=0, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, token=0] [L919] RET, EXPR is_transmit1_triggered() [L919] tmp___0 = is_transmit1_triggered() [L921] COND FALSE !(\read(tmp___0)) VAL [\old(m_st)=0, \old(t1_st)=0, \old(t2_st)=0, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, tmp=0, tmp___0=0, token=0] [L927] CALL, EXPR is_transmit2_triggered() [L689] int __retres1 ; VAL [\old(m_st)=0, \old(t1_st)=0, \old(t2_st)=0, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, token=0] [L692] COND FALSE !(t2_pc == 1) VAL [\old(m_st)=0, \old(t1_st)=0, \old(t2_st)=0, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, token=0] [L702] __retres1 = 0 VAL [\old(m_st)=0, \old(t1_st)=0, \old(t2_st)=0, __retres1=0, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, token=0] [L704] return (__retres1); VAL [\old(m_st)=0, \old(t1_st)=0, \old(t2_st)=0, \result=0, __retres1=0, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, token=0] [L927] RET, EXPR is_transmit2_triggered() [L927] tmp___1 = is_transmit2_triggered() [L929] COND FALSE !(\read(tmp___1)) VAL [\old(m_st)=0, \old(t1_st)=0, \old(t2_st)=0, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, tmp=0, tmp___0=0, tmp___1=0, token=0] [L1037] RET activate_threads2() VAL [a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=2, E_M=2, kernel_st=0, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, token=0] [L1038] CALL reset_delta_events2() VAL [\old(E_1)=2, \old(E_2)=2, \old(E_M)=2, \old(M_E)=2, \old(T1_E)=2, \old(T2_E)=2, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, token=0] [L870] COND FALSE !(M_E == 1) VAL [\old(E_1)=2, \old(E_2)=2, \old(E_M)=2, \old(M_E)=2, \old(T1_E)=2, \old(T2_E)=2, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, token=0] [L875] COND FALSE !(T1_E == 1) VAL [\old(E_1)=2, \old(E_2)=2, \old(E_M)=2, \old(M_E)=2, \old(T1_E)=2, \old(T2_E)=2, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, token=0] [L880] COND FALSE !(T2_E == 1) VAL [\old(E_1)=2, \old(E_2)=2, \old(E_M)=2, \old(M_E)=2, \old(T1_E)=2, \old(T2_E)=2, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, token=0] [L885] COND FALSE !(E_M == 1) VAL [\old(E_1)=2, \old(E_2)=2, \old(E_M)=2, \old(M_E)=2, \old(T1_E)=2, \old(T2_E)=2, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, token=0] [L890] COND FALSE !(E_1 == 1) VAL [\old(E_1)=2, \old(E_2)=2, \old(E_M)=2, \old(M_E)=2, \old(T1_E)=2, \old(T2_E)=2, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, token=0] [L895] COND FALSE !(E_2 == 1) VAL [\old(E_1)=2, \old(E_2)=2, \old(E_M)=2, \old(M_E)=2, \old(T1_E)=2, \old(T2_E)=2, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, token=0] [L1038] RET reset_delta_events2() VAL [a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=2, E_M=2, kernel_st=0, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, token=0] [L1041] COND TRUE 1 VAL [a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=2, E_M=2, kernel_st=0, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, token=0] [L1044] kernel_st = 1 [L1045] CALL eval2() [L765] int tmp ; VAL [a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, token=0] [L769] COND TRUE 1 VAL [a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, token=0] [L772] CALL, EXPR exists_runnable_thread2() VAL [a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, token=0] [L739] int __retres1 ; VAL [a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, token=0] [L742] COND TRUE m_st == 0 [L743] __retres1 = 1 VAL [__retres1=1, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, token=0] [L760] return (__retres1); VAL [\result=1, __retres1=1, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, token=0] [L772] RET, EXPR exists_runnable_thread2() VAL [a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=2, E_M=2, exists_runnable_thread2()=1, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, token=0] [L772] tmp = exists_runnable_thread2() [L774] COND TRUE \read(tmp) VAL [a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, tmp=1, token=0] [L779] COND TRUE m_st == 0 [L780] int tmp_ndt_1; [L781] tmp_ndt_1 = __VERIFIER_nondet_int() [L782] COND FALSE !(\read(tmp_ndt_1)) VAL [a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, tmp=1, tmp_ndt_1=0, token=0] [L793] COND TRUE t1_st == 0 [L794] int tmp_ndt_2; [L795] tmp_ndt_2 = __VERIFIER_nondet_int() [L796] COND TRUE \read(tmp_ndt_2) [L798] t1_st = 1 [L799] CALL transmit1() [L582] COND TRUE t1_pc == 0 VAL [a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=1, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, token=0] [L593] COND TRUE 1 VAL [a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=1, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, token=0] [L595] t1_pc = 1 [L596] t1_st = 2 VAL [a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, token=0] [L799] RET transmit1() [L807] COND TRUE t2_st == 0 [L808] int tmp_ndt_3; [L809] tmp_ndt_3 = __VERIFIER_nondet_int() [L810] COND TRUE \read(tmp_ndt_3) [L812] t2_st = 1 [L813] CALL transmit2() [L618] COND TRUE t2_pc == 0 VAL [a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=0, t2_st=1, token=0] [L629] COND TRUE 1 VAL [a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=0, t2_st=1, token=0] [L631] t2_pc = 1 [L632] t2_st = 2 VAL [a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, token=0] [L813] RET transmit2() [L769] COND TRUE 1 VAL [a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, tmp=1, tmp_ndt_1=0, tmp_ndt_2=1, tmp_ndt_3=1, token=0] [L772] CALL, EXPR exists_runnable_thread2() VAL [a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, token=0] [L739] int __retres1 ; VAL [a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, token=0] [L742] COND TRUE m_st == 0 [L743] __retres1 = 1 VAL [__retres1=1, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, token=0] [L760] return (__retres1); VAL [\result=1, __retres1=1, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, token=0] [L772] RET, EXPR exists_runnable_thread2() VAL [a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=2, E_M=2, exists_runnable_thread2()=1, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, tmp=1, tmp_ndt_1=0, tmp_ndt_2=1, tmp_ndt_3=1, token=0] [L772] tmp = exists_runnable_thread2() [L774] COND TRUE \read(tmp) VAL [a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, tmp=1, tmp_ndt_1=0, tmp_ndt_2=1, tmp_ndt_3=1, token=0] [L779] COND TRUE m_st == 0 [L780] int tmp_ndt_1; [L781] tmp_ndt_1 = __VERIFIER_nondet_int() [L782] COND TRUE \read(tmp_ndt_1) [L784] m_st = 1 [L785] CALL master() [L524] int tmp_var = __VERIFIER_nondet_int(); [L526] COND TRUE m_pc == 0 VAL [a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=1, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, tmp_var=0, token=0] [L537] COND TRUE 1 VAL [a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=1, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, tmp_var=0, token=0] [L540] token = __VERIFIER_nondet_int() [L541] local = token [L542] E_1 = 1 VAL [a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=1, E_2=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=1, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, tmp_var=0, token=0] [L543] CALL immediate_notify() VAL [\old(m_st)=1, \old(t1_st)=2, \old(t2_st)=2, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=1, E_2=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=1, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, token=0] [L943] CALL activate_threads2() VAL [\old(m_st)=1, \old(t1_st)=2, \old(t2_st)=2, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=1, E_2=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=1, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, token=0] [L905] int tmp ; [L906] int tmp___0 ; [L907] int tmp___1 ; [L911] CALL, EXPR is_master_triggered() [L651] int __retres1 ; VAL [\old(m_st)=1, \old(t1_st)=2, \old(t2_st)=2, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=1, E_2=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=1, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, token=0] [L654] COND FALSE !(m_pc == 1) VAL [\old(m_st)=1, \old(t1_st)=2, \old(t2_st)=2, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=1, E_2=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=1, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, token=0] [L664] __retres1 = 0 VAL [\old(m_st)=1, \old(t1_st)=2, \old(t2_st)=2, __retres1=0, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=1, E_2=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=1, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, token=0] [L666] return (__retres1); VAL [\old(m_st)=1, \old(t1_st)=2, \old(t2_st)=2, \result=0, __retres1=0, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=1, E_2=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=1, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, token=0] [L911] RET, EXPR is_master_triggered() [L911] tmp = is_master_triggered() [L913] COND FALSE !(\read(tmp)) VAL [\old(m_st)=1, \old(t1_st)=2, \old(t2_st)=2, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=1, E_2=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=1, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, tmp=0, token=0] [L919] CALL, EXPR is_transmit1_triggered() [L670] int __retres1 ; VAL [\old(m_st)=1, \old(t1_st)=2, \old(t2_st)=2, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=1, E_2=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=1, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, token=0] [L673] COND TRUE t1_pc == 1 VAL [\old(m_st)=1, \old(t1_st)=2, \old(t2_st)=2, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=1, E_2=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=1, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, token=0] [L674] COND TRUE E_1 == 1 [L675] __retres1 = 1 VAL [\old(m_st)=1, \old(t1_st)=2, \old(t2_st)=2, __retres1=1, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=1, E_2=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=1, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, token=0] [L685] return (__retres1); VAL [\old(m_st)=1, \old(t1_st)=2, \old(t2_st)=2, \result=1, __retres1=1, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=1, E_2=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=1, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, token=0] [L919] RET, EXPR is_transmit1_triggered() [L919] tmp___0 = is_transmit1_triggered() [L921] COND TRUE \read(tmp___0) [L922] t1_st = 0 VAL [\old(m_st)=1, \old(t1_st)=2, \old(t2_st)=2, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=1, E_2=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=1, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=0, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, tmp=0, tmp___0=1, token=0] [L927] CALL, EXPR is_transmit2_triggered() [L689] int __retres1 ; VAL [\old(m_st)=1, \old(t1_st)=2, \old(t2_st)=2, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=1, E_2=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=1, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=0, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, token=0] [L692] COND TRUE t2_pc == 1 VAL [\old(m_st)=1, \old(t1_st)=2, \old(t2_st)=2, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=1, E_2=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=1, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=0, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, token=0] [L693] COND FALSE !(E_2 == 1) VAL [\old(m_st)=1, \old(t1_st)=2, \old(t2_st)=2, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=1, E_2=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=1, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=0, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, token=0] [L702] __retres1 = 0 VAL [\old(m_st)=1, \old(t1_st)=2, \old(t2_st)=2, __retres1=0, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=1, E_2=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=1, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=0, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, token=0] [L704] return (__retres1); VAL [\old(m_st)=1, \old(t1_st)=2, \old(t2_st)=2, \result=0, __retres1=0, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=1, E_2=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=1, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=0, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, token=0] [L927] RET, EXPR is_transmit2_triggered() [L927] tmp___1 = is_transmit2_triggered() [L929] COND FALSE !(\read(tmp___1)) VAL [\old(m_st)=1, \old(t1_st)=2, \old(t2_st)=2, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=1, E_2=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=1, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=0, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, tmp=0, tmp___0=1, tmp___1=0, token=0] [L943] RET activate_threads2() VAL [\old(m_st)=1, \old(t1_st)=2, \old(t2_st)=2, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=1, E_2=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=1, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=0, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, token=0] [L543] RET immediate_notify() VAL [a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=1, E_2=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=1, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=0, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, tmp_var=0, token=0] [L544] E_1 = 2 [L545] m_pc = 1 [L546] m_st = 2 VAL [a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=0, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, tmp_var=0, token=0] [L785] RET master() [L793] COND TRUE t1_st == 0 [L794] int tmp_ndt_2; [L795] tmp_ndt_2 = __VERIFIER_nondet_int() [L796] COND TRUE \read(tmp_ndt_2) [L798] t1_st = 1 [L799] CALL transmit1() [L582] COND FALSE !(t1_pc == 0) VAL [a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, token=0] [L585] COND TRUE t1_pc == 1 VAL [a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, token=0] [L601] token += 1 [L602] E_2 = 1 VAL [a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=1, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, token=1] [L603] CALL immediate_notify() VAL [\old(m_st)=2, \old(t1_st)=1, \old(t2_st)=2, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=1, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, token=1] [L943] CALL activate_threads2() VAL [\old(m_st)=2, \old(t1_st)=1, \old(t2_st)=2, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=1, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, token=1] [L905] int tmp ; [L906] int tmp___0 ; [L907] int tmp___1 ; [L911] CALL, EXPR is_master_triggered() [L651] int __retres1 ; VAL [\old(m_st)=2, \old(t1_st)=1, \old(t2_st)=2, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=1, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, token=1] [L654] COND TRUE m_pc == 1 VAL [\old(m_st)=2, \old(t1_st)=1, \old(t2_st)=2, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=1, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, token=1] [L655] COND FALSE !(E_M == 1) VAL [\old(m_st)=2, \old(t1_st)=1, \old(t2_st)=2, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=1, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, token=1] [L664] __retres1 = 0 VAL [\old(m_st)=2, \old(t1_st)=1, \old(t2_st)=2, __retres1=0, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=1, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, token=1] [L666] return (__retres1); VAL [\old(m_st)=2, \old(t1_st)=1, \old(t2_st)=2, \result=0, __retres1=0, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=1, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, token=1] [L911] RET, EXPR is_master_triggered() [L911] tmp = is_master_triggered() [L913] COND FALSE !(\read(tmp)) VAL [\old(m_st)=2, \old(t1_st)=1, \old(t2_st)=2, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=1, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, tmp=0, token=1] [L919] CALL, EXPR is_transmit1_triggered() [L670] int __retres1 ; VAL [\old(m_st)=2, \old(t1_st)=1, \old(t2_st)=2, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=1, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, token=1] [L673] COND TRUE t1_pc == 1 VAL [\old(m_st)=2, \old(t1_st)=1, \old(t2_st)=2, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=1, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, token=1] [L674] COND FALSE !(E_1 == 1) VAL [\old(m_st)=2, \old(t1_st)=1, \old(t2_st)=2, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=1, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, token=1] [L683] __retres1 = 0 VAL [\old(m_st)=2, \old(t1_st)=1, \old(t2_st)=2, __retres1=0, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=1, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, token=1] [L685] return (__retres1); VAL [\old(m_st)=2, \old(t1_st)=1, \old(t2_st)=2, \result=0, __retres1=0, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=1, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, token=1] [L919] RET, EXPR is_transmit1_triggered() [L919] tmp___0 = is_transmit1_triggered() [L921] COND FALSE !(\read(tmp___0)) VAL [\old(m_st)=2, \old(t1_st)=1, \old(t2_st)=2, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=1, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, tmp=0, tmp___0=0, token=1] [L927] CALL, EXPR is_transmit2_triggered() [L689] int __retres1 ; VAL [\old(m_st)=2, \old(t1_st)=1, \old(t2_st)=2, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=1, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, token=1] [L692] COND TRUE t2_pc == 1 VAL [\old(m_st)=2, \old(t1_st)=1, \old(t2_st)=2, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=1, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, token=1] [L693] COND TRUE E_2 == 1 [L694] __retres1 = 1 VAL [\old(m_st)=2, \old(t1_st)=1, \old(t2_st)=2, __retres1=1, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=1, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, token=1] [L704] return (__retres1); VAL [\old(m_st)=2, \old(t1_st)=1, \old(t2_st)=2, \result=1, __retres1=1, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=1, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, token=1] [L927] RET, EXPR is_transmit2_triggered() [L927] tmp___1 = is_transmit2_triggered() [L929] COND TRUE \read(tmp___1) [L930] t2_st = 0 VAL [\old(m_st)=2, \old(t1_st)=1, \old(t2_st)=2, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=1, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, T2_E=2, t2_i=1, t2_pc=1, t2_st=0, tmp=0, tmp___0=0, tmp___1=1, token=1] [L943] RET activate_threads2() VAL [\old(m_st)=2, \old(t1_st)=1, \old(t2_st)=2, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=1, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, T2_E=2, t2_i=1, t2_pc=1, t2_st=0, token=1] [L603] RET immediate_notify() VAL [a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=1, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, T2_E=2, t2_i=1, t2_pc=1, t2_st=0, token=1] [L604] E_2 = 2 VAL [a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, T2_E=2, t2_i=1, t2_pc=1, t2_st=0, token=1] [L593] COND TRUE 1 VAL [a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, T2_E=2, t2_i=1, t2_pc=1, t2_st=0, token=1] [L595] t1_pc = 1 [L596] t1_st = 2 VAL [a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=0, token=1] [L799] RET transmit1() [L807] COND TRUE t2_st == 0 [L808] int tmp_ndt_3; [L809] tmp_ndt_3 = __VERIFIER_nondet_int() [L810] COND TRUE \read(tmp_ndt_3) [L812] t2_st = 1 [L813] CALL transmit2() [L618] COND FALSE !(t2_pc == 0) VAL [a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=1, token=1] [L621] COND TRUE t2_pc == 1 VAL [a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=1, token=1] [L637] token += 1 [L638] E_M = 1 VAL [a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=2, E_M=1, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=1, token=2] [L639] CALL immediate_notify() VAL [\old(m_st)=2, \old(t1_st)=2, \old(t2_st)=1, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=2, E_M=1, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=1, token=2] [L943] CALL activate_threads2() VAL [\old(m_st)=2, \old(t1_st)=2, \old(t2_st)=1, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=2, E_M=1, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=1, token=2] [L905] int tmp ; [L906] int tmp___0 ; [L907] int tmp___1 ; [L911] CALL, EXPR is_master_triggered() [L651] int __retres1 ; VAL [\old(m_st)=2, \old(t1_st)=2, \old(t2_st)=1, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=2, E_M=1, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=1, token=2] [L654] COND TRUE m_pc == 1 VAL [\old(m_st)=2, \old(t1_st)=2, \old(t2_st)=1, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=2, E_M=1, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=1, token=2] [L655] COND TRUE E_M == 1 [L656] __retres1 = 1 VAL [\old(m_st)=2, \old(t1_st)=2, \old(t2_st)=1, __retres1=1, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=2, E_M=1, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=1, token=2] [L666] return (__retres1); VAL [\old(m_st)=2, \old(t1_st)=2, \old(t2_st)=1, \result=1, __retres1=1, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=2, E_M=1, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=1, token=2] [L911] RET, EXPR is_master_triggered() [L911] tmp = is_master_triggered() [L913] COND TRUE \read(tmp) [L914] m_st = 0 VAL [\old(m_st)=2, \old(t1_st)=2, \old(t2_st)=1, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=2, E_M=1, local=0, M_E=2, m_i=1, m_pc=1, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=1, tmp=1, token=2] [L919] CALL, EXPR is_transmit1_triggered() [L670] int __retres1 ; VAL [\old(m_st)=2, \old(t1_st)=2, \old(t2_st)=1, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=2, E_M=1, local=0, M_E=2, m_i=1, m_pc=1, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=1, token=2] [L673] COND TRUE t1_pc == 1 VAL [\old(m_st)=2, \old(t1_st)=2, \old(t2_st)=1, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=2, E_M=1, local=0, M_E=2, m_i=1, m_pc=1, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=1, token=2] [L674] COND FALSE !(E_1 == 1) VAL [\old(m_st)=2, \old(t1_st)=2, \old(t2_st)=1, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=2, E_M=1, local=0, M_E=2, m_i=1, m_pc=1, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=1, token=2] [L683] __retres1 = 0 VAL [\old(m_st)=2, \old(t1_st)=2, \old(t2_st)=1, __retres1=0, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=2, E_M=1, local=0, M_E=2, m_i=1, m_pc=1, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=1, token=2] [L685] return (__retres1); VAL [\old(m_st)=2, \old(t1_st)=2, \old(t2_st)=1, \result=0, __retres1=0, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=2, E_M=1, local=0, M_E=2, m_i=1, m_pc=1, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=1, token=2] [L919] RET, EXPR is_transmit1_triggered() [L919] tmp___0 = is_transmit1_triggered() [L921] COND FALSE !(\read(tmp___0)) VAL [\old(m_st)=2, \old(t1_st)=2, \old(t2_st)=1, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=2, E_M=1, local=0, M_E=2, m_i=1, m_pc=1, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=1, tmp=1, tmp___0=0, token=2] [L927] CALL, EXPR is_transmit2_triggered() [L689] int __retres1 ; VAL [\old(m_st)=2, \old(t1_st)=2, \old(t2_st)=1, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=2, E_M=1, local=0, M_E=2, m_i=1, m_pc=1, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=1, token=2] [L692] COND TRUE t2_pc == 1 VAL [\old(m_st)=2, \old(t1_st)=2, \old(t2_st)=1, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=2, E_M=1, local=0, M_E=2, m_i=1, m_pc=1, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=1, token=2] [L693] COND FALSE !(E_2 == 1) VAL [\old(m_st)=2, \old(t1_st)=2, \old(t2_st)=1, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=2, E_M=1, local=0, M_E=2, m_i=1, m_pc=1, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=1, token=2] [L702] __retres1 = 0 VAL [\old(m_st)=2, \old(t1_st)=2, \old(t2_st)=1, __retres1=0, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=2, E_M=1, local=0, M_E=2, m_i=1, m_pc=1, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=1, token=2] [L704] return (__retres1); VAL [\old(m_st)=2, \old(t1_st)=2, \old(t2_st)=1, \result=0, __retres1=0, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=2, E_M=1, local=0, M_E=2, m_i=1, m_pc=1, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=1, token=2] [L927] RET, EXPR is_transmit2_triggered() [L927] tmp___1 = is_transmit2_triggered() [L929] COND FALSE !(\read(tmp___1)) VAL [\old(m_st)=2, \old(t1_st)=2, \old(t2_st)=1, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=2, E_M=1, local=0, M_E=2, m_i=1, m_pc=1, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=1, tmp=1, tmp___0=0, tmp___1=0, token=2] [L943] RET activate_threads2() VAL [\old(m_st)=2, \old(t1_st)=2, \old(t2_st)=1, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=2, E_M=1, local=0, M_E=2, m_i=1, m_pc=1, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=1, token=2] [L639] RET immediate_notify() VAL [a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=2, E_M=1, local=0, M_E=2, m_i=1, m_pc=1, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=1, token=2] [L640] E_M = 2 VAL [a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=1, token=2] [L629] COND TRUE 1 VAL [a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=1, token=2] [L631] t2_pc = 1 [L632] t2_st = 2 VAL [a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, token=2] [L813] RET transmit2() [L769] COND TRUE 1 VAL [a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, tmp=1, tmp_ndt_1=1, tmp_ndt_2=1, tmp_ndt_3=1, token=2] [L772] CALL, EXPR exists_runnable_thread2() VAL [a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, token=2] [L739] int __retres1 ; VAL [a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, token=2] [L742] COND TRUE m_st == 0 [L743] __retres1 = 1 VAL [__retres1=1, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, token=2] [L760] return (__retres1); VAL [\result=1, __retres1=1, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, token=2] [L772] RET, EXPR exists_runnable_thread2() VAL [a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=2, E_M=2, exists_runnable_thread2()=1, local=0, M_E=2, m_i=1, m_pc=1, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, tmp=1, tmp_ndt_1=1, tmp_ndt_2=1, tmp_ndt_3=1, token=2] [L772] tmp = exists_runnable_thread2() [L774] COND TRUE \read(tmp) VAL [a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, tmp=1, tmp_ndt_1=1, tmp_ndt_2=1, tmp_ndt_3=1, token=2] [L779] COND TRUE m_st == 0 [L780] int tmp_ndt_1; [L781] tmp_ndt_1 = __VERIFIER_nondet_int() [L782] COND TRUE \read(tmp_ndt_1) [L784] m_st = 1 [L785] CALL master() [L524] int tmp_var = __VERIFIER_nondet_int(); [L526] COND FALSE !(m_pc == 0) VAL [a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=1, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, tmp_var=5, token=2] [L529] COND TRUE m_pc == 1 VAL [a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=1, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, tmp_var=5, token=2] [L551] COND FALSE !(token != local + 2) VAL [a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=1, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, tmp_var=5, token=2] [L556] COND TRUE tmp_var <= 5 VAL [a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=1, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, tmp_var=5, token=2] [L557] COND TRUE tmp_var >= 5 VAL [a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=1, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, tmp_var=5, token=2] [L562] COND TRUE tmp_var <= 5 VAL [a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=1, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, tmp_var=5, token=2] [L563] COND TRUE tmp_var >= 5 VAL [a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=1, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, tmp_var=5, token=2] [L564] COND TRUE tmp_var == 5 VAL [a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=1, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, tmp_var=5, token=2] [L565] CALL error2() VAL [a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=1, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, token=2] [L496] reach_error() VAL [a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=1, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, token=2] - UnprovableResult [Line: 28]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data CFG has 16 procedures, 241 locations, 2 error locations. Started 1 CEGAR loops. OverallTime: 77.6s, OverallIterations: 45, TraceHistogramMax: 4, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.3s, AutomataDifference: 41.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 21782 SdHoareTripleChecker+Valid, 14.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 21286 mSDsluCounter, 40300 SdHoareTripleChecker+Invalid, 11.5s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 24650 mSDsCounter, 4271 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 18169 IncrementalHoareTripleChecker+Invalid, 22440 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 4271 mSolverCounterUnsat, 15650 mSDtfsCounter, 18169 mSolverCounterSat, 0.2s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 4438 GetRequests, 3946 SyntacticMatches, 8 SemanticMatches, 484 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1307 ImplicationChecksByTransitivity, 3.8s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=32004occurred in iteration=33, InterpolantAutomatonStates: 414, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 24.0s AutomataMinimizationTime, 44 MinimizatonAttempts, 21983 StatesRemovedByMinimization, 39 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.4s SsaConstructionTime, 1.2s SatisfiabilityAnalysisTime, 5.1s InterpolantComputationTime, 8344 NumberOfCodeBlocks, 8344 NumberOfCodeBlocksAsserted, 64 NumberOfCheckSat, 8146 ConstructedInterpolants, 0 QuantifiedInterpolants, 15238 SizeOfPredicates, 9 NumberOfNonLiveVariables, 10191 ConjunctsInSsa, 81 ConjunctsInUnsatCore, 64 InterpolantComputations, 43 PerfectInterpolantSequences, 3836/4182 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! [2022-07-21 08:06:35,047 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