./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/combinations/pc_sfifo_1.cil-2+token_ring.01.cil-2.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 6c24879c 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_1.cil-2+token_ring.01.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 1fc4175868fd9160b7d31310c312f3c40c885306cd37c45505af16cdc713f79b --- Real Ultimate output --- This is Ultimate 0.2.2-?-6c24879 [2022-07-12 09:27:10,625 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-07-12 09:27:10,658 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-07-12 09:27:10,699 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-07-12 09:27:10,699 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-07-12 09:27:10,701 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-07-12 09:27:10,702 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-07-12 09:27:10,705 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-07-12 09:27:10,706 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-07-12 09:27:10,710 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-07-12 09:27:10,711 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-07-12 09:27:10,713 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-07-12 09:27:10,713 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-07-12 09:27:10,715 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-07-12 09:27:10,716 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-07-12 09:27:10,719 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-07-12 09:27:10,720 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-07-12 09:27:10,721 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-07-12 09:27:10,722 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-07-12 09:27:10,726 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-07-12 09:27:10,728 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-07-12 09:27:10,728 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-07-12 09:27:10,729 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-07-12 09:27:10,730 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-07-12 09:27:10,731 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-07-12 09:27:10,737 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-07-12 09:27:10,737 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-07-12 09:27:10,738 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-07-12 09:27:10,739 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-07-12 09:27:10,740 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-07-12 09:27:10,740 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-07-12 09:27:10,741 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-07-12 09:27:10,742 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-07-12 09:27:10,743 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-07-12 09:27:10,744 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-07-12 09:27:10,745 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-07-12 09:27:10,745 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-07-12 09:27:10,746 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-07-12 09:27:10,746 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-07-12 09:27:10,747 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-07-12 09:27:10,747 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-07-12 09:27:10,749 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-07-12 09:27:10,749 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2022-07-12 09:27:10,775 INFO L113 SettingsManager]: Loading preferences was successful [2022-07-12 09:27:10,776 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-07-12 09:27:10,776 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-07-12 09:27:10,776 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-07-12 09:27:10,777 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-07-12 09:27:10,777 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-07-12 09:27:10,778 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-07-12 09:27:10,778 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-07-12 09:27:10,779 INFO L138 SettingsManager]: * Use SBE=true [2022-07-12 09:27:10,779 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-07-12 09:27:10,780 INFO L138 SettingsManager]: * sizeof long=4 [2022-07-12 09:27:10,780 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-07-12 09:27:10,780 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-07-12 09:27:10,780 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-07-12 09:27:10,780 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-07-12 09:27:10,780 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-07-12 09:27:10,781 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-07-12 09:27:10,781 INFO L138 SettingsManager]: * sizeof long double=12 [2022-07-12 09:27:10,781 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-07-12 09:27:10,782 INFO L138 SettingsManager]: * Use constant arrays=true [2022-07-12 09:27:10,782 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-07-12 09:27:10,782 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-07-12 09:27:10,783 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-07-12 09:27:10,783 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-07-12 09:27:10,783 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-12 09:27:10,783 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-07-12 09:27:10,783 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-07-12 09:27:10,784 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-07-12 09:27:10,784 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-07-12 09:27:10,784 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-07-12 09:27:10,784 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-07-12 09:27:10,784 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-07-12 09:27:10,785 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-07-12 09:27:10,785 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 -> 1fc4175868fd9160b7d31310c312f3c40c885306cd37c45505af16cdc713f79b [2022-07-12 09:27:10,975 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-07-12 09:27:10,992 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-07-12 09:27:10,994 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-07-12 09:27:10,995 INFO L271 PluginConnector]: Initializing CDTParser... [2022-07-12 09:27:10,996 INFO L275 PluginConnector]: CDTParser initialized [2022-07-12 09:27:10,997 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/combinations/pc_sfifo_1.cil-2+token_ring.01.cil-2.c [2022-07-12 09:27:11,050 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f93727548/fb2116181c3f40d0b04f17f33696e763/FLAGf5e5d11d9 [2022-07-12 09:27:11,521 INFO L306 CDTParser]: Found 1 translation units. [2022-07-12 09:27:11,522 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/combinations/pc_sfifo_1.cil-2+token_ring.01.cil-2.c [2022-07-12 09:27:11,535 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f93727548/fb2116181c3f40d0b04f17f33696e763/FLAGf5e5d11d9 [2022-07-12 09:27:12,036 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f93727548/fb2116181c3f40d0b04f17f33696e763 [2022-07-12 09:27:12,038 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-07-12 09:27:12,040 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-07-12 09:27:12,047 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-07-12 09:27:12,048 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-07-12 09:27:12,050 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-07-12 09:27:12,051 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.07 09:27:12" (1/1) ... [2022-07-12 09:27:12,052 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@48d640e7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 09:27:12, skipping insertion in model container [2022-07-12 09:27:12,052 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.07 09:27:12" (1/1) ... [2022-07-12 09:27:12,059 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-07-12 09:27:12,085 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-07-12 09:27:12,233 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_1.cil-2+token_ring.01.cil-2.c[913,926] [2022-07-12 09:27:12,265 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_1.cil-2+token_ring.01.cil-2.c[5977,5990] [2022-07-12 09:27:12,289 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-12 09:27:12,296 INFO L203 MainTranslator]: Completed pre-run [2022-07-12 09:27:12,308 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_1.cil-2+token_ring.01.cil-2.c[913,926] [2022-07-12 09:27:12,338 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_1.cil-2+token_ring.01.cil-2.c[5977,5990] [2022-07-12 09:27:12,360 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-12 09:27:12,374 INFO L208 MainTranslator]: Completed translation [2022-07-12 09:27:12,375 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 09:27:12 WrapperNode [2022-07-12 09:27:12,375 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-07-12 09:27:12,376 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-07-12 09:27:12,376 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-07-12 09:27:12,376 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-07-12 09:27:12,381 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 09:27:12" (1/1) ... [2022-07-12 09:27:12,389 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 09:27:12" (1/1) ... [2022-07-12 09:27:12,421 INFO L137 Inliner]: procedures = 50, calls = 52, calls flagged for inlining = 24, calls inlined = 24, statements flattened = 422 [2022-07-12 09:27:12,423 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-07-12 09:27:12,424 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-07-12 09:27:12,424 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-07-12 09:27:12,425 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-07-12 09:27:12,430 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 09:27:12" (1/1) ... [2022-07-12 09:27:12,430 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 09:27:12" (1/1) ... [2022-07-12 09:27:12,434 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 09:27:12" (1/1) ... [2022-07-12 09:27:12,447 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 09:27:12" (1/1) ... [2022-07-12 09:27:12,453 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 09:27:12" (1/1) ... [2022-07-12 09:27:12,460 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 09:27:12" (1/1) ... [2022-07-12 09:27:12,462 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 09:27:12" (1/1) ... [2022-07-12 09:27:12,465 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-07-12 09:27:12,466 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-07-12 09:27:12,466 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-07-12 09:27:12,466 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-07-12 09:27:12,476 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 09:27:12" (1/1) ... [2022-07-12 09:27:12,490 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-12 09:27:12,498 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-12 09:27:12,513 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-12 09:27:12,521 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-12 09:27:12,542 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-07-12 09:27:12,543 INFO L130 BoogieDeclarations]: Found specification of procedure immediate_notify [2022-07-12 09:27:12,543 INFO L138 BoogieDeclarations]: Found implementation of procedure immediate_notify [2022-07-12 09:27:12,543 INFO L130 BoogieDeclarations]: Found specification of procedure immediate_notify_threads [2022-07-12 09:27:12,543 INFO L138 BoogieDeclarations]: Found implementation of procedure immediate_notify_threads [2022-07-12 09:27:12,543 INFO L130 BoogieDeclarations]: Found specification of procedure exists_runnable_thread1 [2022-07-12 09:27:12,544 INFO L138 BoogieDeclarations]: Found implementation of procedure exists_runnable_thread1 [2022-07-12 09:27:12,544 INFO L130 BoogieDeclarations]: Found specification of procedure exists_runnable_thread2 [2022-07-12 09:27:12,544 INFO L138 BoogieDeclarations]: Found implementation of procedure exists_runnable_thread2 [2022-07-12 09:27:12,544 INFO L130 BoogieDeclarations]: Found specification of procedure reset_delta_events2 [2022-07-12 09:27:12,544 INFO L138 BoogieDeclarations]: Found implementation of procedure reset_delta_events2 [2022-07-12 09:27:12,544 INFO L130 BoogieDeclarations]: Found specification of procedure activate_threads2 [2022-07-12 09:27:12,544 INFO L138 BoogieDeclarations]: Found implementation of procedure activate_threads2 [2022-07-12 09:27:12,545 INFO L130 BoogieDeclarations]: Found specification of procedure update_channels2 [2022-07-12 09:27:12,545 INFO L138 BoogieDeclarations]: Found implementation of procedure update_channels2 [2022-07-12 09:27:12,545 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-07-12 09:27:12,545 INFO L130 BoogieDeclarations]: Found specification of procedure fire_delta_events2 [2022-07-12 09:27:12,545 INFO L138 BoogieDeclarations]: Found implementation of procedure fire_delta_events2 [2022-07-12 09:27:12,545 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-07-12 09:27:12,545 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-07-12 09:27:12,546 INFO L130 BoogieDeclarations]: Found specification of procedure error1 [2022-07-12 09:27:12,546 INFO L138 BoogieDeclarations]: Found implementation of procedure error1 [2022-07-12 09:27:12,546 INFO L130 BoogieDeclarations]: Found specification of procedure error2 [2022-07-12 09:27:12,546 INFO L138 BoogieDeclarations]: Found implementation of procedure error2 [2022-07-12 09:27:12,612 INFO L234 CfgBuilder]: Building ICFG [2022-07-12 09:27:12,614 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-07-12 09:27:12,977 INFO L275 CfgBuilder]: Performing block encoding [2022-07-12 09:27:12,988 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-07-12 09:27:12,988 INFO L299 CfgBuilder]: Removed 8 assume(true) statements. [2022-07-12 09:27:12,990 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.07 09:27:12 BoogieIcfgContainer [2022-07-12 09:27:12,990 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-07-12 09:27:12,991 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-07-12 09:27:12,992 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-07-12 09:27:12,997 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-07-12 09:27:12,997 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 12.07 09:27:12" (1/3) ... [2022-07-12 09:27:12,998 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4c9ef1cd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.07 09:27:12, skipping insertion in model container [2022-07-12 09:27:12,998 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 09:27:12" (2/3) ... [2022-07-12 09:27:12,999 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4c9ef1cd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.07 09:27:12, skipping insertion in model container [2022-07-12 09:27:12,999 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.07 09:27:12" (3/3) ... [2022-07-12 09:27:13,000 INFO L111 eAbstractionObserver]: Analyzing ICFG pc_sfifo_1.cil-2+token_ring.01.cil-2.c [2022-07-12 09:27:13,011 INFO L201 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-07-12 09:27:13,011 INFO L160 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2022-07-12 09:27:13,054 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-07-12 09:27:13,060 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@1840a8a5, mLbeIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@ec42c94 [2022-07-12 09:27:13,060 INFO L358 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2022-07-12 09:27:13,064 INFO L276 IsEmpty]: Start isEmpty. Operand has 187 states, 151 states have (on average 1.5562913907284768) internal successors, (235), 158 states have internal predecessors, (235), 23 states have call successors, (23), 10 states have call predecessors, (23), 10 states have return successors, (23), 21 states have call predecessors, (23), 23 states have call successors, (23) [2022-07-12 09:27:13,073 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2022-07-12 09:27:13,074 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 09:27:13,074 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] [2022-07-12 09:27:13,075 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 09:27:13,079 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 09:27:13,079 INFO L85 PathProgramCache]: Analyzing trace with hash 578004893, now seen corresponding path program 1 times [2022-07-12 09:27:13,085 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 09:27:13,085 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1298193801] [2022-07-12 09:27:13,086 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 09:27:13,086 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 09:27:13,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 09:27:13,320 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-12 09:27:13,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 09:27:13,360 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2022-07-12 09:27:13,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 09:27:13,372 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-12 09:27:13,376 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 09:27:13,377 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1298193801] [2022-07-12 09:27:13,378 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1298193801] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 09:27:13,378 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 09:27:13,378 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-12 09:27:13,379 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1718450589] [2022-07-12 09:27:13,380 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 09:27:13,385 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-12 09:27:13,386 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 09:27:13,414 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-12 09:27:13,414 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-12 09:27:13,418 INFO L87 Difference]: Start difference. First operand has 187 states, 151 states have (on average 1.5562913907284768) internal successors, (235), 158 states have internal predecessors, (235), 23 states have call successors, (23), 10 states have call predecessors, (23), 10 states have return successors, (23), 21 states have call predecessors, (23), 23 states have call successors, (23) Second operand has 4 states, 4 states have (on average 9.75) internal successors, (39), 3 states have internal predecessors, (39), 2 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-07-12 09:27:13,691 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 09:27:13,692 INFO L93 Difference]: Finished difference Result 429 states and 652 transitions. [2022-07-12 09:27:13,693 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-07-12 09:27:13,695 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 9.75) internal successors, (39), 3 states have internal predecessors, (39), 2 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 44 [2022-07-12 09:27:13,695 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 09:27:13,711 INFO L225 Difference]: With dead ends: 429 [2022-07-12 09:27:13,711 INFO L226 Difference]: Without dead ends: 246 [2022-07-12 09:27:13,715 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-07-12 09:27:13,718 INFO L413 NwaCegarLoop]: 277 mSDtfsCounter, 297 mSDsluCounter, 215 mSDsCounter, 0 mSdLazyCounter, 83 mSolverCounterSat, 39 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 312 SdHoareTripleChecker+Valid, 492 SdHoareTripleChecker+Invalid, 122 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 39 IncrementalHoareTripleChecker+Valid, 83 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-07-12 09:27:13,719 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [312 Valid, 492 Invalid, 122 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [39 Valid, 83 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-07-12 09:27:13,732 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 246 states. [2022-07-12 09:27:13,764 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 246 to 240. [2022-07-12 09:27:13,766 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 240 states, 200 states have (on average 1.42) internal successors, (284), 205 states have internal predecessors, (284), 27 states have call successors, (27), 12 states have call predecessors, (27), 11 states have return successors, (29), 23 states have call predecessors, (29), 23 states have call successors, (29) [2022-07-12 09:27:13,768 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 240 states to 240 states and 340 transitions. [2022-07-12 09:27:13,769 INFO L78 Accepts]: Start accepts. Automaton has 240 states and 340 transitions. Word has length 44 [2022-07-12 09:27:13,769 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 09:27:13,770 INFO L495 AbstractCegarLoop]: Abstraction has 240 states and 340 transitions. [2022-07-12 09:27:13,770 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 9.75) internal successors, (39), 3 states have internal predecessors, (39), 2 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-07-12 09:27:13,770 INFO L276 IsEmpty]: Start isEmpty. Operand 240 states and 340 transitions. [2022-07-12 09:27:13,773 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2022-07-12 09:27:13,773 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 09:27:13,773 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] [2022-07-12 09:27:13,773 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-07-12 09:27:13,774 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 09:27:13,774 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 09:27:13,774 INFO L85 PathProgramCache]: Analyzing trace with hash 1000349205, now seen corresponding path program 1 times [2022-07-12 09:27:13,775 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 09:27:13,775 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1454055750] [2022-07-12 09:27:13,775 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 09:27:13,775 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 09:27:13,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 09:27:13,819 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-12 09:27:13,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 09:27:13,830 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2022-07-12 09:27:13,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 09:27:13,845 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-12 09:27:13,846 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 09:27:13,848 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1454055750] [2022-07-12 09:27:13,848 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1454055750] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 09:27:13,849 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 09:27:13,849 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-12 09:27:13,849 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1684486826] [2022-07-12 09:27:13,849 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 09:27:13,851 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-12 09:27:13,851 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 09:27:13,852 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-12 09:27:13,852 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-12 09:27:13,853 INFO L87 Difference]: Start difference. First operand 240 states and 340 transitions. Second operand has 4 states, 4 states have (on average 10.0) internal successors, (40), 3 states have internal predecessors, (40), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-07-12 09:27:14,035 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 09:27:14,035 INFO L93 Difference]: Finished difference Result 488 states and 680 transitions. [2022-07-12 09:27:14,035 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-07-12 09:27:14,036 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 10.0) internal successors, (40), 3 states have internal predecessors, (40), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 45 [2022-07-12 09:27:14,036 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 09:27:14,039 INFO L225 Difference]: With dead ends: 488 [2022-07-12 09:27:14,039 INFO L226 Difference]: Without dead ends: 364 [2022-07-12 09:27:14,040 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-07-12 09:27:14,041 INFO L413 NwaCegarLoop]: 295 mSDtfsCounter, 149 mSDsluCounter, 305 mSDsCounter, 0 mSdLazyCounter, 126 mSolverCounterSat, 29 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 151 SdHoareTripleChecker+Valid, 600 SdHoareTripleChecker+Invalid, 155 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 29 IncrementalHoareTripleChecker+Valid, 126 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-12 09:27:14,042 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [151 Valid, 600 Invalid, 155 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [29 Valid, 126 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-12 09:27:14,045 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 364 states. [2022-07-12 09:27:14,074 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 364 to 307. [2022-07-12 09:27:14,074 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 307 states, 261 states have (on average 1.4099616858237547) internal successors, (368), 266 states have internal predecessors, (368), 30 states have call successors, (30), 15 states have call predecessors, (30), 14 states have return successors, (32), 26 states have call predecessors, (32), 26 states have call successors, (32) [2022-07-12 09:27:14,076 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 307 states to 307 states and 430 transitions. [2022-07-12 09:27:14,076 INFO L78 Accepts]: Start accepts. Automaton has 307 states and 430 transitions. Word has length 45 [2022-07-12 09:27:14,077 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 09:27:14,077 INFO L495 AbstractCegarLoop]: Abstraction has 307 states and 430 transitions. [2022-07-12 09:27:14,077 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 10.0) internal successors, (40), 3 states have internal predecessors, (40), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-07-12 09:27:14,077 INFO L276 IsEmpty]: Start isEmpty. Operand 307 states and 430 transitions. [2022-07-12 09:27:14,079 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2022-07-12 09:27:14,079 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 09:27:14,079 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] [2022-07-12 09:27:14,079 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-07-12 09:27:14,080 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 09:27:14,080 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 09:27:14,080 INFO L85 PathProgramCache]: Analyzing trace with hash -284008256, now seen corresponding path program 1 times [2022-07-12 09:27:14,080 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 09:27:14,081 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1088889721] [2022-07-12 09:27:14,081 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 09:27:14,081 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 09:27:14,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 09:27:14,115 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-12 09:27:14,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 09:27:14,124 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2022-07-12 09:27:14,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 09:27:14,131 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-12 09:27:14,132 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 09:27:14,132 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1088889721] [2022-07-12 09:27:14,132 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1088889721] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 09:27:14,132 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 09:27:14,132 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-12 09:27:14,133 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1740658526] [2022-07-12 09:27:14,133 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 09:27:14,133 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-12 09:27:14,133 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 09:27:14,134 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-12 09:27:14,134 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-12 09:27:14,134 INFO L87 Difference]: Start difference. First operand 307 states and 430 transitions. Second operand has 4 states, 4 states have (on average 10.0) internal successors, (40), 3 states have internal predecessors, (40), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-07-12 09:27:14,249 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 09:27:14,249 INFO L93 Difference]: Finished difference Result 715 states and 989 transitions. [2022-07-12 09:27:14,250 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-07-12 09:27:14,250 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 10.0) internal successors, (40), 3 states have internal predecessors, (40), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 45 [2022-07-12 09:27:14,250 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 09:27:14,253 INFO L225 Difference]: With dead ends: 715 [2022-07-12 09:27:14,253 INFO L226 Difference]: Without dead ends: 524 [2022-07-12 09:27:14,254 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-07-12 09:27:14,255 INFO L413 NwaCegarLoop]: 270 mSDtfsCounter, 306 mSDsluCounter, 213 mSDsCounter, 0 mSdLazyCounter, 66 mSolverCounterSat, 32 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 321 SdHoareTripleChecker+Valid, 483 SdHoareTripleChecker+Invalid, 98 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 32 IncrementalHoareTripleChecker+Valid, 66 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-12 09:27:14,256 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [321 Valid, 483 Invalid, 98 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [32 Valid, 66 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-12 09:27:14,257 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 524 states. [2022-07-12 09:27:14,280 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 524 to 472. [2022-07-12 09:27:14,281 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 472 states, 407 states have (on average 1.371007371007371) internal successors, (558), 415 states have internal predecessors, (558), 41 states have call successors, (41), 22 states have call predecessors, (41), 22 states have return successors, (49), 35 states have call predecessors, (49), 37 states have call successors, (49) [2022-07-12 09:27:14,284 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 472 states to 472 states and 648 transitions. [2022-07-12 09:27:14,284 INFO L78 Accepts]: Start accepts. Automaton has 472 states and 648 transitions. Word has length 45 [2022-07-12 09:27:14,284 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 09:27:14,284 INFO L495 AbstractCegarLoop]: Abstraction has 472 states and 648 transitions. [2022-07-12 09:27:14,285 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 10.0) internal successors, (40), 3 states have internal predecessors, (40), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-07-12 09:27:14,285 INFO L276 IsEmpty]: Start isEmpty. Operand 472 states and 648 transitions. [2022-07-12 09:27:14,287 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2022-07-12 09:27:14,287 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 09:27:14,288 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] [2022-07-12 09:27:14,288 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-07-12 09:27:14,288 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 09:27:14,288 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 09:27:14,289 INFO L85 PathProgramCache]: Analyzing trace with hash -1712856217, now seen corresponding path program 1 times [2022-07-12 09:27:14,289 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 09:27:14,289 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [995776559] [2022-07-12 09:27:14,289 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 09:27:14,289 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 09:27:14,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 09:27:14,318 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-07-12 09:27:14,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 09:27:14,327 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-12 09:27:14,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 09:27:14,336 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-07-12 09:27:14,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 09:27:14,342 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-07-12 09:27:14,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 09:27:14,346 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2022-07-12 09:27:14,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 09:27:14,349 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-12 09:27:14,349 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 09:27:14,349 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [995776559] [2022-07-12 09:27:14,349 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [995776559] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 09:27:14,349 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 09:27:14,350 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-07-12 09:27:14,350 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [266954690] [2022-07-12 09:27:14,350 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 09:27:14,350 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-07-12 09:27:14,351 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 09:27:14,351 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-12 09:27:14,351 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-07-12 09:27:14,351 INFO L87 Difference]: Start difference. First operand 472 states and 648 transitions. Second operand has 5 states, 5 states have (on average 9.4) internal successors, (47), 3 states have internal predecessors, (47), 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-12 09:27:14,621 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 09:27:14,621 INFO L93 Difference]: Finished difference Result 596 states and 832 transitions. [2022-07-12 09:27:14,622 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-12 09:27:14,622 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 9.4) internal successors, (47), 3 states have internal predecessors, (47), 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 58 [2022-07-12 09:27:14,622 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 09:27:14,625 INFO L225 Difference]: With dead ends: 596 [2022-07-12 09:27:14,625 INFO L226 Difference]: Without dead ends: 493 [2022-07-12 09:27:14,626 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2022-07-12 09:27:14,627 INFO L413 NwaCegarLoop]: 253 mSDtfsCounter, 279 mSDsluCounter, 289 mSDsCounter, 0 mSdLazyCounter, 180 mSolverCounterSat, 56 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 292 SdHoareTripleChecker+Valid, 542 SdHoareTripleChecker+Invalid, 236 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 56 IncrementalHoareTripleChecker+Valid, 180 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-07-12 09:27:14,628 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [292 Valid, 542 Invalid, 236 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [56 Valid, 180 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-07-12 09:27:14,628 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 493 states. [2022-07-12 09:27:14,651 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 493 to 472. [2022-07-12 09:27:14,652 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 472 states, 407 states have (on average 1.3685503685503686) internal successors, (557), 415 states have internal predecessors, (557), 41 states have call successors, (41), 22 states have call predecessors, (41), 22 states have return successors, (49), 35 states have call predecessors, (49), 37 states have call successors, (49) [2022-07-12 09:27:14,656 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 472 states to 472 states and 647 transitions. [2022-07-12 09:27:14,657 INFO L78 Accepts]: Start accepts. Automaton has 472 states and 647 transitions. Word has length 58 [2022-07-12 09:27:14,658 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 09:27:14,658 INFO L495 AbstractCegarLoop]: Abstraction has 472 states and 647 transitions. [2022-07-12 09:27:14,658 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 9.4) internal successors, (47), 3 states have internal predecessors, (47), 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-12 09:27:14,660 INFO L276 IsEmpty]: Start isEmpty. Operand 472 states and 647 transitions. [2022-07-12 09:27:14,664 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2022-07-12 09:27:14,665 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 09:27:14,665 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 09:27:14,665 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-07-12 09:27:14,666 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 09:27:14,666 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 09:27:14,666 INFO L85 PathProgramCache]: Analyzing trace with hash -1231775959, now seen corresponding path program 1 times [2022-07-12 09:27:14,666 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 09:27:14,670 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1948395259] [2022-07-12 09:27:14,670 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 09:27:14,671 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 09:27:14,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 09:27:14,720 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-07-12 09:27:14,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 09:27:14,731 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-12 09:27:14,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 09:27:14,767 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-07-12 09:27:14,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 09:27:14,785 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-07-12 09:27:14,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 09:27:14,789 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2022-07-12 09:27:14,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 09:27:14,794 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-12 09:27:14,794 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 09:27:14,794 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1948395259] [2022-07-12 09:27:14,794 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1948395259] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 09:27:14,795 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 09:27:14,795 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-12 09:27:14,796 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [712427936] [2022-07-12 09:27:14,796 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 09:27:14,797 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-12 09:27:14,797 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 09:27:14,797 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-12 09:27:14,797 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-12 09:27:14,798 INFO L87 Difference]: Start difference. First operand 472 states and 647 transitions. Second operand has 6 states, 6 states have (on average 7.833333333333333) internal successors, (47), 4 states have internal predecessors, (47), 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-12 09:27:15,311 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 09:27:15,312 INFO L93 Difference]: Finished difference Result 710 states and 998 transitions. [2022-07-12 09:27:15,312 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-07-12 09:27:15,312 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 7.833333333333333) internal successors, (47), 4 states have internal predecessors, (47), 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 58 [2022-07-12 09:27:15,312 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 09:27:15,315 INFO L225 Difference]: With dead ends: 710 [2022-07-12 09:27:15,316 INFO L226 Difference]: Without dead ends: 610 [2022-07-12 09:27:15,316 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-12 09:27:15,317 INFO L413 NwaCegarLoop]: 259 mSDtfsCounter, 450 mSDsluCounter, 451 mSDsCounter, 0 mSdLazyCounter, 464 mSolverCounterSat, 92 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 462 SdHoareTripleChecker+Valid, 710 SdHoareTripleChecker+Invalid, 556 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 92 IncrementalHoareTripleChecker+Valid, 464 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-07-12 09:27:15,318 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [462 Valid, 710 Invalid, 556 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [92 Valid, 464 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-07-12 09:27:15,318 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 610 states. [2022-07-12 09:27:15,348 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 610 to 567. [2022-07-12 09:27:15,349 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 567 states, 485 states have (on average 1.3855670103092783) internal successors, (672), 494 states have internal predecessors, (672), 51 states have call successors, (51), 28 states have call predecessors, (51), 29 states have return successors, (62), 45 states have call predecessors, (62), 47 states have call successors, (62) [2022-07-12 09:27:15,352 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 567 states to 567 states and 785 transitions. [2022-07-12 09:27:15,352 INFO L78 Accepts]: Start accepts. Automaton has 567 states and 785 transitions. Word has length 58 [2022-07-12 09:27:15,352 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 09:27:15,352 INFO L495 AbstractCegarLoop]: Abstraction has 567 states and 785 transitions. [2022-07-12 09:27:15,352 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 7.833333333333333) internal successors, (47), 4 states have internal predecessors, (47), 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-12 09:27:15,353 INFO L276 IsEmpty]: Start isEmpty. Operand 567 states and 785 transitions. [2022-07-12 09:27:15,354 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2022-07-12 09:27:15,354 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 09:27:15,354 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] [2022-07-12 09:27:15,355 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-07-12 09:27:15,355 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 09:27:15,355 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 09:27:15,355 INFO L85 PathProgramCache]: Analyzing trace with hash 696496743, now seen corresponding path program 1 times [2022-07-12 09:27:15,355 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 09:27:15,356 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [312293301] [2022-07-12 09:27:15,356 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 09:27:15,356 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 09:27:15,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 09:27:15,400 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-07-12 09:27:15,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 09:27:15,416 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-12 09:27:15,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 09:27:15,446 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-07-12 09:27:15,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 09:27:15,460 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-07-12 09:27:15,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 09:27:15,463 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2022-07-12 09:27:15,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 09:27:15,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-12 09:27:15,467 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 09:27:15,468 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [312293301] [2022-07-12 09:27:15,468 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [312293301] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 09:27:15,468 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 09:27:15,468 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-07-12 09:27:15,468 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1134448719] [2022-07-12 09:27:15,469 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 09:27:15,470 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-07-12 09:27:15,470 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 09:27:15,470 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-07-12 09:27:15,470 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-07-12 09:27:15,471 INFO L87 Difference]: Start difference. First operand 567 states and 785 transitions. Second operand has 7 states, 7 states have (on average 6.714285714285714) internal successors, (47), 5 states have internal predecessors, (47), 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-12 09:27:16,113 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 09:27:16,113 INFO L93 Difference]: Finished difference Result 918 states and 1293 transitions. [2022-07-12 09:27:16,113 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-07-12 09:27:16,114 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 6.714285714285714) internal successors, (47), 5 states have internal predecessors, (47), 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 58 [2022-07-12 09:27:16,114 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 09:27:16,117 INFO L225 Difference]: With dead ends: 918 [2022-07-12 09:27:16,117 INFO L226 Difference]: Without dead ends: 723 [2022-07-12 09:27:16,118 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-12 09:27:16,119 INFO L413 NwaCegarLoop]: 328 mSDtfsCounter, 438 mSDsluCounter, 763 mSDsCounter, 0 mSdLazyCounter, 733 mSolverCounterSat, 74 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 450 SdHoareTripleChecker+Valid, 1091 SdHoareTripleChecker+Invalid, 807 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 74 IncrementalHoareTripleChecker+Valid, 733 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-07-12 09:27:16,119 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [450 Valid, 1091 Invalid, 807 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [74 Valid, 733 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-07-12 09:27:16,120 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 723 states. [2022-07-12 09:27:16,144 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 723 to 657. [2022-07-12 09:27:16,145 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 657 states, 558 states have (on average 1.39247311827957) internal successors, (777), 568 states have internal predecessors, (777), 61 states have call successors, (61), 34 states have call predecessors, (61), 36 states have return successors, (74), 56 states have call predecessors, (74), 57 states have call successors, (74) [2022-07-12 09:27:16,147 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 657 states to 657 states and 912 transitions. [2022-07-12 09:27:16,148 INFO L78 Accepts]: Start accepts. Automaton has 657 states and 912 transitions. Word has length 58 [2022-07-12 09:27:16,148 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 09:27:16,148 INFO L495 AbstractCegarLoop]: Abstraction has 657 states and 912 transitions. [2022-07-12 09:27:16,148 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 6.714285714285714) internal successors, (47), 5 states have internal predecessors, (47), 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-12 09:27:16,148 INFO L276 IsEmpty]: Start isEmpty. Operand 657 states and 912 transitions. [2022-07-12 09:27:16,149 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2022-07-12 09:27:16,149 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 09:27:16,150 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] [2022-07-12 09:27:16,150 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-07-12 09:27:16,150 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 09:27:16,151 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 09:27:16,151 INFO L85 PathProgramCache]: Analyzing trace with hash 1589983081, now seen corresponding path program 1 times [2022-07-12 09:27:16,151 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 09:27:16,151 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1867311647] [2022-07-12 09:27:16,151 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 09:27:16,152 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 09:27:16,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 09:27:16,171 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-07-12 09:27:16,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 09:27:16,178 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-12 09:27:16,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 09:27:16,199 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-07-12 09:27:16,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 09:27:16,204 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-07-12 09:27:16,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 09:27:16,207 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2022-07-12 09:27:16,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 09:27:16,209 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-12 09:27:16,209 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 09:27:16,209 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1867311647] [2022-07-12 09:27:16,209 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1867311647] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 09:27:16,209 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 09:27:16,210 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-07-12 09:27:16,210 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1728710776] [2022-07-12 09:27:16,210 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 09:27:16,210 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-07-12 09:27:16,210 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 09:27:16,211 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-07-12 09:27:16,211 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-07-12 09:27:16,211 INFO L87 Difference]: Start difference. First operand 657 states and 912 transitions. Second operand has 7 states, 7 states have (on average 6.714285714285714) internal successors, (47), 5 states have internal predecessors, (47), 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-12 09:27:16,855 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 09:27:16,855 INFO L93 Difference]: Finished difference Result 1244 states and 1756 transitions. [2022-07-12 09:27:16,856 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-07-12 09:27:16,856 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 6.714285714285714) internal successors, (47), 5 states have internal predecessors, (47), 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 58 [2022-07-12 09:27:16,856 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 09:27:16,860 INFO L225 Difference]: With dead ends: 1244 [2022-07-12 09:27:16,860 INFO L226 Difference]: Without dead ends: 959 [2022-07-12 09:27:16,861 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-12 09:27:16,862 INFO L413 NwaCegarLoop]: 326 mSDtfsCounter, 434 mSDsluCounter, 752 mSDsCounter, 0 mSdLazyCounter, 765 mSolverCounterSat, 76 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 445 SdHoareTripleChecker+Valid, 1078 SdHoareTripleChecker+Invalid, 841 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 76 IncrementalHoareTripleChecker+Valid, 765 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-07-12 09:27:16,862 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [445 Valid, 1078 Invalid, 841 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [76 Valid, 765 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-07-12 09:27:16,863 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 959 states. [2022-07-12 09:27:16,895 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 959 to 815. [2022-07-12 09:27:16,897 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 815 states, 684 states have (on average 1.394736842105263) internal successors, (954), 696 states have internal predecessors, (954), 79 states have call successors, (79), 46 states have call predecessors, (79), 50 states have return successors, (100), 76 states have call predecessors, (100), 75 states have call successors, (100) [2022-07-12 09:27:16,900 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 815 states to 815 states and 1133 transitions. [2022-07-12 09:27:16,900 INFO L78 Accepts]: Start accepts. Automaton has 815 states and 1133 transitions. Word has length 58 [2022-07-12 09:27:16,900 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 09:27:16,900 INFO L495 AbstractCegarLoop]: Abstraction has 815 states and 1133 transitions. [2022-07-12 09:27:16,901 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 6.714285714285714) internal successors, (47), 5 states have internal predecessors, (47), 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-12 09:27:16,901 INFO L276 IsEmpty]: Start isEmpty. Operand 815 states and 1133 transitions. [2022-07-12 09:27:16,902 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2022-07-12 09:27:16,902 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 09:27:16,902 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] [2022-07-12 09:27:16,903 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-07-12 09:27:16,903 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 09:27:16,903 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 09:27:16,904 INFO L85 PathProgramCache]: Analyzing trace with hash 692589803, now seen corresponding path program 1 times [2022-07-12 09:27:16,904 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 09:27:16,904 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [820047754] [2022-07-12 09:27:16,904 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 09:27:16,904 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 09:27:16,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 09:27:16,922 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-07-12 09:27:16,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 09:27:16,930 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-12 09:27:16,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 09:27:16,937 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-07-12 09:27:16,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 09:27:16,949 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-07-12 09:27:16,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 09:27:16,951 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2022-07-12 09:27:16,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 09:27:16,953 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-12 09:27:16,954 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 09:27:16,954 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [820047754] [2022-07-12 09:27:16,954 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [820047754] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 09:27:16,954 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 09:27:16,954 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-12 09:27:16,955 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [198358255] [2022-07-12 09:27:16,955 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 09:27:16,955 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-12 09:27:16,955 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 09:27:16,956 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-12 09:27:16,956 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-12 09:27:16,956 INFO L87 Difference]: Start difference. First operand 815 states and 1133 transitions. Second operand has 6 states, 6 states have (on average 7.833333333333333) internal successors, (47), 4 states have internal predecessors, (47), 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-12 09:27:17,511 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 09:27:17,512 INFO L93 Difference]: Finished difference Result 1642 states and 2326 transitions. [2022-07-12 09:27:17,512 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-07-12 09:27:17,513 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 7.833333333333333) internal successors, (47), 4 states have internal predecessors, (47), 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 58 [2022-07-12 09:27:17,513 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 09:27:17,518 INFO L225 Difference]: With dead ends: 1642 [2022-07-12 09:27:17,519 INFO L226 Difference]: Without dead ends: 1200 [2022-07-12 09:27:17,520 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=39, Invalid=93, Unknown=0, NotChecked=0, Total=132 [2022-07-12 09:27:17,521 INFO L413 NwaCegarLoop]: 358 mSDtfsCounter, 544 mSDsluCounter, 469 mSDsCounter, 0 mSdLazyCounter, 524 mSolverCounterSat, 97 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 571 SdHoareTripleChecker+Valid, 827 SdHoareTripleChecker+Invalid, 621 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 97 IncrementalHoareTripleChecker+Valid, 524 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-07-12 09:27:17,521 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [571 Valid, 827 Invalid, 621 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [97 Valid, 524 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-07-12 09:27:17,522 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1200 states. [2022-07-12 09:27:17,580 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1200 to 1067. [2022-07-12 09:27:17,582 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1067 states, 885 states have (on average 1.3887005649717514) internal successors, (1229), 902 states have internal predecessors, (1229), 110 states have call successors, (110), 64 states have call predecessors, (110), 70 states have return successors, (135), 104 states have call predecessors, (135), 106 states have call successors, (135) [2022-07-12 09:27:17,587 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1067 states to 1067 states and 1474 transitions. [2022-07-12 09:27:17,588 INFO L78 Accepts]: Start accepts. Automaton has 1067 states and 1474 transitions. Word has length 58 [2022-07-12 09:27:17,588 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 09:27:17,589 INFO L495 AbstractCegarLoop]: Abstraction has 1067 states and 1474 transitions. [2022-07-12 09:27:17,589 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 7.833333333333333) internal successors, (47), 4 states have internal predecessors, (47), 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-12 09:27:17,589 INFO L276 IsEmpty]: Start isEmpty. Operand 1067 states and 1474 transitions. [2022-07-12 09:27:17,591 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2022-07-12 09:27:17,591 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 09:27:17,591 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] [2022-07-12 09:27:17,591 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-07-12 09:27:17,592 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 09:27:17,592 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 09:27:17,592 INFO L85 PathProgramCache]: Analyzing trace with hash 228372173, now seen corresponding path program 1 times [2022-07-12 09:27:17,592 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 09:27:17,593 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [418583759] [2022-07-12 09:27:17,593 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 09:27:17,593 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 09:27:17,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 09:27:17,635 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-12 09:27:17,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 09:27:17,640 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2022-07-12 09:27:17,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 09:27:17,649 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2022-07-12 09:27:17,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 09:27:17,654 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-12 09:27:17,654 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 09:27:17,654 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [418583759] [2022-07-12 09:27:17,654 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [418583759] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 09:27:17,654 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 09:27:17,655 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-12 09:27:17,655 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2126936904] [2022-07-12 09:27:17,655 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 09:27:17,655 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-12 09:27:17,656 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 09:27:17,656 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-12 09:27:17,656 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-12 09:27:17,656 INFO L87 Difference]: Start difference. First operand 1067 states and 1474 transitions. Second operand has 4 states, 4 states have (on average 12.75) internal successors, (51), 3 states have internal predecessors, (51), 3 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-07-12 09:27:17,826 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 09:27:17,826 INFO L93 Difference]: Finished difference Result 1651 states and 2259 transitions. [2022-07-12 09:27:17,827 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-07-12 09:27:17,827 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 12.75) internal successors, (51), 3 states have internal predecessors, (51), 3 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Word has length 62 [2022-07-12 09:27:17,827 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 09:27:17,832 INFO L225 Difference]: With dead ends: 1651 [2022-07-12 09:27:17,832 INFO L226 Difference]: Without dead ends: 1295 [2022-07-12 09:27:17,833 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-07-12 09:27:17,834 INFO L413 NwaCegarLoop]: 318 mSDtfsCounter, 133 mSDsluCounter, 334 mSDsCounter, 0 mSdLazyCounter, 144 mSolverCounterSat, 25 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 135 SdHoareTripleChecker+Valid, 652 SdHoareTripleChecker+Invalid, 169 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 144 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-12 09:27:17,834 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [135 Valid, 652 Invalid, 169 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [25 Valid, 144 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-12 09:27:17,835 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1295 states. [2022-07-12 09:27:17,901 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1295 to 1257. [2022-07-12 09:27:17,903 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1257 states, 1051 states have (on average 1.3596574690770695) internal successors, (1429), 1070 states have internal predecessors, (1429), 124 states have call successors, (124), 72 states have call predecessors, (124), 80 states have return successors, (159), 118 states have call predecessors, (159), 120 states have call successors, (159) [2022-07-12 09:27:17,908 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1257 states to 1257 states and 1712 transitions. [2022-07-12 09:27:17,908 INFO L78 Accepts]: Start accepts. Automaton has 1257 states and 1712 transitions. Word has length 62 [2022-07-12 09:27:17,909 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 09:27:17,909 INFO L495 AbstractCegarLoop]: Abstraction has 1257 states and 1712 transitions. [2022-07-12 09:27:17,909 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 12.75) internal successors, (51), 3 states have internal predecessors, (51), 3 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-07-12 09:27:17,909 INFO L276 IsEmpty]: Start isEmpty. Operand 1257 states and 1712 transitions. [2022-07-12 09:27:17,911 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2022-07-12 09:27:17,911 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 09:27:17,911 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] [2022-07-12 09:27:17,911 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-07-12 09:27:17,912 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 09:27:17,912 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 09:27:17,912 INFO L85 PathProgramCache]: Analyzing trace with hash -387474386, now seen corresponding path program 1 times [2022-07-12 09:27:17,912 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 09:27:17,912 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [208247955] [2022-07-12 09:27:17,912 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 09:27:17,913 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 09:27:17,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 09:27:17,928 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-12 09:27:17,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 09:27:17,934 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-07-12 09:27:17,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 09:27:17,938 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2022-07-12 09:27:17,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 09:27:17,941 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2022-07-12 09:27:17,941 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 09:27:17,941 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [208247955] [2022-07-12 09:27:17,941 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [208247955] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 09:27:17,942 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 09:27:17,942 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-12 09:27:17,942 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1964399484] [2022-07-12 09:27:17,942 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 09:27:17,942 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-12 09:27:17,942 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 09:27:17,943 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-12 09:27:17,943 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-12 09:27:17,943 INFO L87 Difference]: Start difference. First operand 1257 states and 1712 transitions. Second operand has 4 states, 4 states have (on average 11.75) internal successors, (47), 3 states have internal predecessors, (47), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-07-12 09:27:18,073 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 09:27:18,073 INFO L93 Difference]: Finished difference Result 1910 states and 2565 transitions. [2022-07-12 09:27:18,073 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-07-12 09:27:18,074 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 11.75) internal successors, (47), 3 states have internal predecessors, (47), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 67 [2022-07-12 09:27:18,074 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 09:27:18,080 INFO L225 Difference]: With dead ends: 1910 [2022-07-12 09:27:18,080 INFO L226 Difference]: Without dead ends: 1456 [2022-07-12 09:27:18,081 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-07-12 09:27:18,082 INFO L413 NwaCegarLoop]: 264 mSDtfsCounter, 292 mSDsluCounter, 214 mSDsCounter, 0 mSdLazyCounter, 61 mSolverCounterSat, 32 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 307 SdHoareTripleChecker+Valid, 478 SdHoareTripleChecker+Invalid, 93 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 32 IncrementalHoareTripleChecker+Valid, 61 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-12 09:27:18,082 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [307 Valid, 478 Invalid, 93 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [32 Valid, 61 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-12 09:27:18,083 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1456 states. [2022-07-12 09:27:18,144 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1456 to 1401. [2022-07-12 09:27:18,147 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1401 states, 1179 states have (on average 1.3401187446988974) internal successors, (1580), 1200 states have internal predecessors, (1580), 132 states have call successors, (132), 78 states have call predecessors, (132), 88 states have return successors, (173), 126 states have call predecessors, (173), 128 states have call successors, (173) [2022-07-12 09:27:18,151 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1401 states to 1401 states and 1885 transitions. [2022-07-12 09:27:18,152 INFO L78 Accepts]: Start accepts. Automaton has 1401 states and 1885 transitions. Word has length 67 [2022-07-12 09:27:18,152 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 09:27:18,152 INFO L495 AbstractCegarLoop]: Abstraction has 1401 states and 1885 transitions. [2022-07-12 09:27:18,152 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 11.75) internal successors, (47), 3 states have internal predecessors, (47), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-07-12 09:27:18,152 INFO L276 IsEmpty]: Start isEmpty. Operand 1401 states and 1885 transitions. [2022-07-12 09:27:18,154 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2022-07-12 09:27:18,154 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 09:27:18,154 INFO L195 NwaCegarLoop]: trace histogram [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] [2022-07-12 09:27:18,155 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-07-12 09:27:18,155 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 09:27:18,155 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 09:27:18,155 INFO L85 PathProgramCache]: Analyzing trace with hash -1207541004, now seen corresponding path program 1 times [2022-07-12 09:27:18,155 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 09:27:18,155 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [13433032] [2022-07-12 09:27:18,156 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 09:27:18,156 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 09:27:18,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 09:27:18,171 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-12 09:27:18,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 09:27:18,175 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2022-07-12 09:27:18,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 09:27:18,206 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2022-07-12 09:27:18,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 09:27:18,210 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 2 proven. 11 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-07-12 09:27:18,211 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 09:27:18,211 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [13433032] [2022-07-12 09:27:18,211 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [13433032] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-12 09:27:18,211 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1517286443] [2022-07-12 09:27:18,211 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 09:27:18,211 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 09:27:18,212 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-12 09:27:18,215 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-12 09:27:18,235 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-12 09:27:18,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 09:27:18,314 INFO L263 TraceCheckSpWp]: Trace formula consists of 275 conjuncts, 9 conjunts are in the unsatisfiable core [2022-07-12 09:27:18,319 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 09:27:18,446 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 2 proven. 13 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-12 09:27:18,447 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-12 09:27:18,478 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2022-07-12 09:27:18,479 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1517286443] provided 1 perfect and 1 imperfect interpolant sequences [2022-07-12 09:27:18,479 INFO L184 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2022-07-12 09:27:18,479 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [6, 4] total 8 [2022-07-12 09:27:18,479 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1015969127] [2022-07-12 09:27:18,480 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 09:27:18,480 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-12 09:27:18,480 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 09:27:18,480 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-12 09:27:18,481 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2022-07-12 09:27:18,481 INFO L87 Difference]: Start difference. First operand 1401 states and 1885 transitions. Second operand has 4 states, 4 states have (on average 12.5) internal successors, (50), 4 states have internal predecessors, (50), 4 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-07-12 09:27:18,645 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 09:27:18,645 INFO L93 Difference]: Finished difference Result 1457 states and 1953 transitions. [2022-07-12 09:27:18,645 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-12 09:27:18,645 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 12.5) internal successors, (50), 4 states have internal predecessors, (50), 4 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Word has length 68 [2022-07-12 09:27:18,646 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 09:27:18,651 INFO L225 Difference]: With dead ends: 1457 [2022-07-12 09:27:18,651 INFO L226 Difference]: Without dead ends: 1454 [2022-07-12 09:27:18,652 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 148 GetRequests, 141 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2022-07-12 09:27:18,653 INFO L413 NwaCegarLoop]: 273 mSDtfsCounter, 419 mSDsluCounter, 67 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 79 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 419 SdHoareTripleChecker+Valid, 340 SdHoareTripleChecker+Invalid, 88 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 79 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-12 09:27:18,653 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [419 Valid, 340 Invalid, 88 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [79 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-12 09:27:18,654 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1454 states. [2022-07-12 09:27:18,729 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1454 to 1400. [2022-07-12 09:27:18,731 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1400 states, 1179 states have (on average 1.3384223918575064) internal successors, (1578), 1199 states have internal predecessors, (1578), 131 states have call successors, (131), 78 states have call predecessors, (131), 88 states have return successors, (173), 126 states have call predecessors, (173), 128 states have call successors, (173) [2022-07-12 09:27:18,736 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1400 states to 1400 states and 1882 transitions. [2022-07-12 09:27:18,737 INFO L78 Accepts]: Start accepts. Automaton has 1400 states and 1882 transitions. Word has length 68 [2022-07-12 09:27:18,737 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 09:27:18,737 INFO L495 AbstractCegarLoop]: Abstraction has 1400 states and 1882 transitions. [2022-07-12 09:27:18,737 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 12.5) internal successors, (50), 4 states have internal predecessors, (50), 4 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-07-12 09:27:18,737 INFO L276 IsEmpty]: Start isEmpty. Operand 1400 states and 1882 transitions. [2022-07-12 09:27:18,739 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2022-07-12 09:27:18,739 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 09:27:18,740 INFO L195 NwaCegarLoop]: trace histogram [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] [2022-07-12 09:27:18,760 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2022-07-12 09:27:18,951 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable10 [2022-07-12 09:27:18,951 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 09:27:18,952 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 09:27:18,952 INFO L85 PathProgramCache]: Analyzing trace with hash 1220320753, now seen corresponding path program 1 times [2022-07-12 09:27:18,952 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 09:27:18,952 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1697116951] [2022-07-12 09:27:18,952 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 09:27:18,952 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 09:27:18,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 09:27:18,967 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-12 09:27:18,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 09:27:18,973 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2022-07-12 09:27:18,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 09:27:19,013 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2022-07-12 09:27:19,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 09:27:19,019 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 2 proven. 11 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-07-12 09:27:19,020 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 09:27:19,020 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1697116951] [2022-07-12 09:27:19,020 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1697116951] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-12 09:27:19,020 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [36213162] [2022-07-12 09:27:19,021 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 09:27:19,021 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 09:27:19,021 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-12 09:27:19,022 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-12 09:27:19,032 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-12 09:27:19,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 09:27:19,102 INFO L263 TraceCheckSpWp]: Trace formula consists of 277 conjuncts, 9 conjunts are in the unsatisfiable core [2022-07-12 09:27:19,107 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 09:27:19,331 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-12 09:27:19,331 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-12 09:27:19,397 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2022-07-12 09:27:19,397 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [36213162] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-12 09:27:19,397 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-12 09:27:19,397 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5, 4] total 11 [2022-07-12 09:27:19,398 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2004077746] [2022-07-12 09:27:19,398 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-12 09:27:19,398 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-07-12 09:27:19,398 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 09:27:19,399 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-07-12 09:27:19,399 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=88, Unknown=0, NotChecked=0, Total=110 [2022-07-12 09:27:19,399 INFO L87 Difference]: Start difference. First operand 1400 states and 1882 transitions. Second operand has 11 states, 11 states have (on average 13.727272727272727) internal successors, (151), 10 states have internal predecessors, (151), 7 states have call successors, (10), 6 states have call predecessors, (10), 5 states have return successors, (9), 7 states have call predecessors, (9), 7 states have call successors, (9) [2022-07-12 09:27:20,378 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 09:27:20,378 INFO L93 Difference]: Finished difference Result 3100 states and 4102 transitions. [2022-07-12 09:27:20,378 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2022-07-12 09:27:20,378 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 13.727272727272727) internal successors, (151), 10 states have internal predecessors, (151), 7 states have call successors, (10), 6 states have call predecessors, (10), 5 states have return successors, (9), 7 states have call predecessors, (9), 7 states have call successors, (9) Word has length 69 [2022-07-12 09:27:20,379 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 09:27:20,387 INFO L225 Difference]: With dead ends: 3100 [2022-07-12 09:27:20,387 INFO L226 Difference]: Without dead ends: 2556 [2022-07-12 09:27:20,390 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 194 GetRequests, 152 SyntacticMatches, 1 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 461 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=324, Invalid=1482, Unknown=0, NotChecked=0, Total=1806 [2022-07-12 09:27:20,391 INFO L413 NwaCegarLoop]: 378 mSDtfsCounter, 837 mSDsluCounter, 1655 mSDsCounter, 0 mSdLazyCounter, 743 mSolverCounterSat, 78 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 859 SdHoareTripleChecker+Valid, 2033 SdHoareTripleChecker+Invalid, 821 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 78 IncrementalHoareTripleChecker+Valid, 743 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-07-12 09:27:20,391 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [859 Valid, 2033 Invalid, 821 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [78 Valid, 743 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-07-12 09:27:20,393 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2556 states. [2022-07-12 09:27:20,499 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2556 to 1789. [2022-07-12 09:27:20,503 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1789 states, 1529 states have (on average 1.315892740353172) internal successors, (2012), 1557 states have internal predecessors, (2012), 151 states have call successors, (151), 92 states have call predecessors, (151), 107 states have return successors, (207), 143 states have call predecessors, (207), 148 states have call successors, (207) [2022-07-12 09:27:20,508 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1789 states to 1789 states and 2370 transitions. [2022-07-12 09:27:20,509 INFO L78 Accepts]: Start accepts. Automaton has 1789 states and 2370 transitions. Word has length 69 [2022-07-12 09:27:20,510 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 09:27:20,510 INFO L495 AbstractCegarLoop]: Abstraction has 1789 states and 2370 transitions. [2022-07-12 09:27:20,510 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 13.727272727272727) internal successors, (151), 10 states have internal predecessors, (151), 7 states have call successors, (10), 6 states have call predecessors, (10), 5 states have return successors, (9), 7 states have call predecessors, (9), 7 states have call successors, (9) [2022-07-12 09:27:20,510 INFO L276 IsEmpty]: Start isEmpty. Operand 1789 states and 2370 transitions. [2022-07-12 09:27:20,513 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2022-07-12 09:27:20,514 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 09:27:20,514 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2022-07-12 09:27:20,542 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-12 09:27:20,727 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,SelfDestructingSolverStorable11 [2022-07-12 09:27:20,727 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 09:27:20,728 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 09:27:20,728 INFO L85 PathProgramCache]: Analyzing trace with hash 1470144615, now seen corresponding path program 1 times [2022-07-12 09:27:20,728 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 09:27:20,728 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [575082246] [2022-07-12 09:27:20,728 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 09:27:20,728 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 09:27:20,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 09:27:20,752 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-12 09:27:20,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 09:27:20,757 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2022-07-12 09:27:20,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 09:27:20,786 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2022-07-12 09:27:20,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 09:27:20,789 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2022-07-12 09:27:20,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 09:27:20,793 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 6 proven. 10 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2022-07-12 09:27:20,793 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 09:27:20,793 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [575082246] [2022-07-12 09:27:20,794 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [575082246] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-12 09:27:20,794 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1925063676] [2022-07-12 09:27:20,794 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 09:27:20,794 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 09:27:20,794 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-12 09:27:20,795 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-12 09:27:20,827 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-12 09:27:20,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 09:27:20,911 INFO L263 TraceCheckSpWp]: Trace formula consists of 328 conjuncts, 3 conjunts are in the unsatisfiable core [2022-07-12 09:27:20,913 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 09:27:20,939 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 36 proven. 0 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2022-07-12 09:27:20,940 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-12 09:27:20,940 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1925063676] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 09:27:20,940 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-07-12 09:27:20,940 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [6] total 7 [2022-07-12 09:27:20,940 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [153493108] [2022-07-12 09:27:20,955 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 09:27:20,956 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-12 09:27:20,956 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 09:27:20,956 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-12 09:27:20,956 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-07-12 09:27:20,957 INFO L87 Difference]: Start difference. First operand 1789 states and 2370 transitions. Second operand has 3 states, 3 states have (on average 23.0) internal successors, (69), 3 states have internal predecessors, (69), 3 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2022-07-12 09:27:21,033 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 09:27:21,034 INFO L93 Difference]: Finished difference Result 2512 states and 3308 transitions. [2022-07-12 09:27:21,034 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-12 09:27:21,034 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 23.0) internal successors, (69), 3 states have internal predecessors, (69), 3 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) Word has length 88 [2022-07-12 09:27:21,035 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 09:27:21,041 INFO L225 Difference]: With dead ends: 2512 [2022-07-12 09:27:21,041 INFO L226 Difference]: Without dead ends: 1667 [2022-07-12 09:27:21,043 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 101 GetRequests, 96 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-07-12 09:27:21,043 INFO L413 NwaCegarLoop]: 279 mSDtfsCounter, 208 mSDsluCounter, 75 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 208 SdHoareTripleChecker+Valid, 354 SdHoareTripleChecker+Invalid, 8 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-12 09:27:21,044 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [208 Valid, 354 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-12 09:27:21,045 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1667 states. [2022-07-12 09:27:21,135 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1667 to 1652. [2022-07-12 09:27:21,138 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1652 states, 1408 states have (on average 1.3167613636363635) internal successors, (1854), 1435 states have internal predecessors, (1854), 143 states have call successors, (143), 86 states have call predecessors, (143), 99 states have return successors, (193), 134 states have call predecessors, (193), 140 states have call successors, (193) [2022-07-12 09:27:21,144 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1652 states to 1652 states and 2190 transitions. [2022-07-12 09:27:21,144 INFO L78 Accepts]: Start accepts. Automaton has 1652 states and 2190 transitions. Word has length 88 [2022-07-12 09:27:21,144 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 09:27:21,145 INFO L495 AbstractCegarLoop]: Abstraction has 1652 states and 2190 transitions. [2022-07-12 09:27:21,145 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 23.0) internal successors, (69), 3 states have internal predecessors, (69), 3 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2022-07-12 09:27:21,145 INFO L276 IsEmpty]: Start isEmpty. Operand 1652 states and 2190 transitions. [2022-07-12 09:27:21,148 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2022-07-12 09:27:21,148 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 09:27:21,167 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-12 09:27:21,194 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-12 09:27:21,384 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 09:27:21,385 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 09:27:21,385 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 09:27:21,385 INFO L85 PathProgramCache]: Analyzing trace with hash 1819521257, now seen corresponding path program 1 times [2022-07-12 09:27:21,386 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 09:27:21,386 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1960675220] [2022-07-12 09:27:21,386 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 09:27:21,386 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 09:27:21,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 09:27:21,399 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-07-12 09:27:21,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 09:27:21,406 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-12 09:27:21,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 09:27:21,412 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-07-12 09:27:21,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 09:27:21,453 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-07-12 09:27:21,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 09:27:21,457 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2022-07-12 09:27:21,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 09:27:21,458 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2022-07-12 09:27:21,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 09:27:21,461 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-07-12 09:27:21,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 09:27:21,463 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2022-07-12 09:27:21,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 09:27:21,465 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2022-07-12 09:27:21,465 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 09:27:21,465 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1960675220] [2022-07-12 09:27:21,465 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1960675220] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-12 09:27:21,466 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [610853820] [2022-07-12 09:27:21,466 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 09:27:21,466 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 09:27:21,466 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-12 09:27:21,468 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-12 09:27:21,496 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-12 09:27:21,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 09:27:21,548 INFO L263 TraceCheckSpWp]: Trace formula consists of 334 conjuncts, 2 conjunts are in the unsatisfiable core [2022-07-12 09:27:21,550 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 09:27:21,568 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2022-07-12 09:27:21,568 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-12 09:27:21,569 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [610853820] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 09:27:21,569 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-07-12 09:27:21,569 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [7] total 8 [2022-07-12 09:27:21,569 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [510005399] [2022-07-12 09:27:21,569 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 09:27:21,569 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-12 09:27:21,570 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 09:27:21,570 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-12 09:27:21,570 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2022-07-12 09:27:21,570 INFO L87 Difference]: Start difference. First operand 1652 states and 2190 transitions. Second operand has 3 states, 3 states have (on average 21.0) internal successors, (63), 3 states have internal predecessors, (63), 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-12 09:27:21,657 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 09:27:21,657 INFO L93 Difference]: Finished difference Result 2176 states and 2945 transitions. [2022-07-12 09:27:21,658 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-12 09:27:21,658 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 21.0) internal successors, (63), 3 states have internal predecessors, (63), 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 93 [2022-07-12 09:27:21,658 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 09:27:21,665 INFO L225 Difference]: With dead ends: 2176 [2022-07-12 09:27:21,665 INFO L226 Difference]: Without dead ends: 1891 [2022-07-12 09:27:21,667 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 114 GetRequests, 108 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-12 09:27:21,667 INFO L413 NwaCegarLoop]: 354 mSDtfsCounter, 105 mSDsluCounter, 240 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 105 SdHoareTripleChecker+Valid, 594 SdHoareTripleChecker+Invalid, 12 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-12 09:27:21,668 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [105 Valid, 594 Invalid, 12 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-12 09:27:21,669 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1891 states. [2022-07-12 09:27:21,776 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1891 to 1891. [2022-07-12 09:27:21,779 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1891 states, 1599 states have (on average 1.3258286429018136) internal successors, (2120), 1628 states have internal predecessors, (2120), 171 states have call successors, (171), 104 states have call predecessors, (171), 119 states have return successors, (235), 162 states have call predecessors, (235), 168 states have call successors, (235) [2022-07-12 09:27:21,784 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1891 states to 1891 states and 2526 transitions. [2022-07-12 09:27:21,784 INFO L78 Accepts]: Start accepts. Automaton has 1891 states and 2526 transitions. Word has length 93 [2022-07-12 09:27:21,785 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 09:27:21,785 INFO L495 AbstractCegarLoop]: Abstraction has 1891 states and 2526 transitions. [2022-07-12 09:27:21,785 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 21.0) internal successors, (63), 3 states have internal predecessors, (63), 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-12 09:27:21,785 INFO L276 IsEmpty]: Start isEmpty. Operand 1891 states and 2526 transitions. [2022-07-12 09:27:21,788 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2022-07-12 09:27:21,789 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 09:27:21,789 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 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-12 09:27:21,818 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2022-07-12 09:27:22,011 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 09:27:22,012 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 09:27:22,012 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 09:27:22,012 INFO L85 PathProgramCache]: Analyzing trace with hash 1756250701, now seen corresponding path program 1 times [2022-07-12 09:27:22,012 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 09:27:22,012 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2035825196] [2022-07-12 09:27:22,013 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 09:27:22,013 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 09:27:22,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 09:27:22,030 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-12 09:27:22,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 09:27:22,036 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2022-07-12 09:27:22,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 09:27:22,062 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2022-07-12 09:27:22,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 09:27:22,064 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2022-07-12 09:27:22,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 09:27:22,067 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2022-07-12 09:27:22,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 09:27:22,071 INFO L134 CoverageAnalysis]: Checked inductivity of 63 backedges. 13 proven. 10 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2022-07-12 09:27:22,071 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 09:27:22,071 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2035825196] [2022-07-12 09:27:22,071 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2035825196] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-12 09:27:22,071 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1618666689] [2022-07-12 09:27:22,071 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 09:27:22,072 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 09:27:22,072 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-12 09:27:22,073 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-12 09:27:22,077 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-12 09:27:22,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 09:27:22,164 INFO L263 TraceCheckSpWp]: Trace formula consists of 370 conjuncts, 2 conjunts are in the unsatisfiable core [2022-07-12 09:27:22,166 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 09:27:22,181 INFO L134 CoverageAnalysis]: Checked inductivity of 63 backedges. 47 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2022-07-12 09:27:22,181 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-12 09:27:22,181 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1618666689] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 09:27:22,181 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-07-12 09:27:22,181 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [6] total 7 [2022-07-12 09:27:22,181 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1237433358] [2022-07-12 09:27:22,182 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 09:27:22,182 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-12 09:27:22,182 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 09:27:22,182 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-12 09:27:22,182 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-07-12 09:27:22,183 INFO L87 Difference]: Start difference. First operand 1891 states and 2526 transitions. Second operand has 3 states, 3 states have (on average 26.0) internal successors, (78), 3 states have internal predecessors, (78), 3 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 3 states have call successors, (5) [2022-07-12 09:27:22,243 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 09:27:22,243 INFO L93 Difference]: Finished difference Result 2270 states and 2994 transitions. [2022-07-12 09:27:22,244 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-12 09:27:22,244 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 26.0) internal successors, (78), 3 states have internal predecessors, (78), 3 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 3 states have call successors, (5) Word has length 103 [2022-07-12 09:27:22,244 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 09:27:22,248 INFO L225 Difference]: With dead ends: 2270 [2022-07-12 09:27:22,248 INFO L226 Difference]: Without dead ends: 944 [2022-07-12 09:27:22,250 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 118 GetRequests, 113 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-07-12 09:27:22,251 INFO L413 NwaCegarLoop]: 293 mSDtfsCounter, 62 mSDsluCounter, 223 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 62 SdHoareTripleChecker+Valid, 516 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-12 09:27:22,251 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [62 Valid, 516 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-12 09:27:22,252 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 944 states. [2022-07-12 09:27:22,288 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 944 to 944. [2022-07-12 09:27:22,290 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 944 states, 755 states have (on average 1.4066225165562913) internal successors, (1062), 768 states have internal predecessors, (1062), 114 states have call successors, (114), 67 states have call predecessors, (114), 74 states have return successors, (143), 112 states have call predecessors, (143), 112 states have call successors, (143) [2022-07-12 09:27:22,292 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 944 states to 944 states and 1319 transitions. [2022-07-12 09:27:22,293 INFO L78 Accepts]: Start accepts. Automaton has 944 states and 1319 transitions. Word has length 103 [2022-07-12 09:27:22,293 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 09:27:22,293 INFO L495 AbstractCegarLoop]: Abstraction has 944 states and 1319 transitions. [2022-07-12 09:27:22,293 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 26.0) internal successors, (78), 3 states have internal predecessors, (78), 3 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 3 states have call successors, (5) [2022-07-12 09:27:22,293 INFO L276 IsEmpty]: Start isEmpty. Operand 944 states and 1319 transitions. [2022-07-12 09:27:22,295 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2022-07-12 09:27:22,295 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 09:27:22,295 INFO L195 NwaCegarLoop]: trace histogram [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] [2022-07-12 09:27:22,316 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-12 09:27:22,516 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,SelfDestructingSolverStorable14 [2022-07-12 09:27:22,517 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 09:27:22,517 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 09:27:22,517 INFO L85 PathProgramCache]: Analyzing trace with hash -1396789480, now seen corresponding path program 1 times [2022-07-12 09:27:22,517 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 09:27:22,517 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2043011049] [2022-07-12 09:27:22,517 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 09:27:22,518 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 09:27:22,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 09:27:22,557 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-07-12 09:27:22,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 09:27:22,565 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-12 09:27:22,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 09:27:22,572 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-07-12 09:27:22,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 09:27:22,608 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-07-12 09:27:22,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 09:27:22,612 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2022-07-12 09:27:22,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 09:27:22,614 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2022-07-12 09:27:22,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 09:27:22,617 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-07-12 09:27:22,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 09:27:22,619 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2022-07-12 09:27:22,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 09:27:22,622 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-07-12 09:27:22,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 09:27:22,624 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2022-07-12 09:27:22,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 09:27:22,625 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 22 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2022-07-12 09:27:22,626 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 09:27:22,626 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2043011049] [2022-07-12 09:27:22,626 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2043011049] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-12 09:27:22,626 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [62638331] [2022-07-12 09:27:22,626 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 09:27:22,626 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 09:27:22,627 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-12 09:27:22,632 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-12 09:27:22,633 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-12 09:27:22,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 09:27:22,712 INFO L263 TraceCheckSpWp]: Trace formula consists of 408 conjuncts, 2 conjunts are in the unsatisfiable core [2022-07-12 09:27:22,715 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 09:27:22,814 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 41 proven. 0 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2022-07-12 09:27:22,814 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-12 09:27:22,814 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [62638331] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 09:27:22,814 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-07-12 09:27:22,815 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [7] total 8 [2022-07-12 09:27:22,815 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1355966818] [2022-07-12 09:27:22,815 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 09:27:22,815 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-12 09:27:22,815 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 09:27:22,816 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-12 09:27:22,816 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2022-07-12 09:27:22,817 INFO L87 Difference]: Start difference. First operand 944 states and 1319 transitions. Second operand has 3 states, 3 states have (on average 28.333333333333332) internal successors, (85), 2 states have internal predecessors, (85), 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-12 09:27:22,896 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 09:27:22,896 INFO L93 Difference]: Finished difference Result 2739 states and 3855 transitions. [2022-07-12 09:27:22,896 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-12 09:27:22,897 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 28.333333333333332) internal successors, (85), 2 states have internal predecessors, (85), 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 119 [2022-07-12 09:27:22,897 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 09:27:22,905 INFO L225 Difference]: With dead ends: 2739 [2022-07-12 09:27:22,906 INFO L226 Difference]: Without dead ends: 1806 [2022-07-12 09:27:22,908 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 144 GetRequests, 138 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-12 09:27:22,909 INFO L413 NwaCegarLoop]: 181 mSDtfsCounter, 80 mSDsluCounter, 132 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 80 SdHoareTripleChecker+Valid, 313 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-12 09:27:22,909 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [80 Valid, 313 Invalid, 12 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-12 09:27:22,911 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1806 states. [2022-07-12 09:27:22,990 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1806 to 1780. [2022-07-12 09:27:22,993 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1780 states, 1430 states have (on average 1.4055944055944056) internal successors, (2010), 1454 states have internal predecessors, (2010), 206 states have call successors, (206), 128 states have call predecessors, (206), 143 states have return successors, (257), 201 states have call predecessors, (257), 204 states have call successors, (257) [2022-07-12 09:27:22,999 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1780 states to 1780 states and 2473 transitions. [2022-07-12 09:27:23,000 INFO L78 Accepts]: Start accepts. Automaton has 1780 states and 2473 transitions. Word has length 119 [2022-07-12 09:27:23,001 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 09:27:23,001 INFO L495 AbstractCegarLoop]: Abstraction has 1780 states and 2473 transitions. [2022-07-12 09:27:23,001 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 28.333333333333332) internal successors, (85), 2 states have internal predecessors, (85), 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-12 09:27:23,001 INFO L276 IsEmpty]: Start isEmpty. Operand 1780 states and 2473 transitions. [2022-07-12 09:27:23,004 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 136 [2022-07-12 09:27:23,005 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 09:27:23,005 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, 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-12 09:27:23,024 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2022-07-12 09:27:23,214 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,SelfDestructingSolverStorable15 [2022-07-12 09:27:23,214 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 09:27:23,214 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 09:27:23,215 INFO L85 PathProgramCache]: Analyzing trace with hash -936187258, now seen corresponding path program 1 times [2022-07-12 09:27:23,215 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 09:27:23,215 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1870763694] [2022-07-12 09:27:23,215 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 09:27:23,215 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 09:27:23,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 09:27:23,253 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-07-12 09:27:23,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 09:27:23,260 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-12 09:27:23,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 09:27:23,265 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-07-12 09:27:23,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 09:27:23,295 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-07-12 09:27:23,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 09:27:23,299 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2022-07-12 09:27:23,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 09:27:23,300 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2022-07-12 09:27:23,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 09:27:23,302 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2022-07-12 09:27:23,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 09:27:23,305 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-07-12 09:27:23,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 09:27:23,307 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2022-07-12 09:27:23,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 09:27:23,313 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-07-12 09:27:23,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 09:27:23,317 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 120 [2022-07-12 09:27:23,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 09:27:23,320 INFO L134 CoverageAnalysis]: Checked inductivity of 81 backedges. 0 proven. 22 refuted. 0 times theorem prover too weak. 59 trivial. 0 not checked. [2022-07-12 09:27:23,320 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 09:27:23,320 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1870763694] [2022-07-12 09:27:23,320 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1870763694] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-12 09:27:23,320 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1263126697] [2022-07-12 09:27:23,320 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 09:27:23,321 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 09:27:23,321 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-12 09:27:23,324 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-12 09:27:23,326 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-12 09:27:23,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 09:27:23,408 INFO L263 TraceCheckSpWp]: Trace formula consists of 445 conjuncts, 3 conjunts are in the unsatisfiable core [2022-07-12 09:27:23,410 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 09:27:23,441 INFO L134 CoverageAnalysis]: Checked inductivity of 81 backedges. 47 proven. 0 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2022-07-12 09:27:23,441 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-12 09:27:23,441 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1263126697] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 09:27:23,442 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-07-12 09:27:23,442 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [7] total 8 [2022-07-12 09:27:23,442 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [558677006] [2022-07-12 09:27:23,442 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 09:27:23,442 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-12 09:27:23,443 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 09:27:23,443 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-12 09:27:23,443 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2022-07-12 09:27:23,443 INFO L87 Difference]: Start difference. First operand 1780 states and 2473 transitions. Second operand has 3 states, 3 states have (on average 28.666666666666668) internal successors, (86), 3 states have internal predecessors, (86), 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-12 09:27:23,526 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 09:27:23,526 INFO L93 Difference]: Finished difference Result 3748 states and 5212 transitions. [2022-07-12 09:27:23,526 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-12 09:27:23,526 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 28.666666666666668) internal successors, (86), 3 states have internal predecessors, (86), 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 135 [2022-07-12 09:27:23,527 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 09:27:23,534 INFO L225 Difference]: With dead ends: 3748 [2022-07-12 09:27:23,534 INFO L226 Difference]: Without dead ends: 1980 [2022-07-12 09:27:23,538 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 162 GetRequests, 156 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-12 09:27:23,539 INFO L413 NwaCegarLoop]: 169 mSDtfsCounter, 102 mSDsluCounter, 131 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 102 SdHoareTripleChecker+Valid, 300 SdHoareTripleChecker+Invalid, 9 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-12 09:27:23,539 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [102 Valid, 300 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-12 09:27:23,541 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1980 states. [2022-07-12 09:27:23,665 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1980 to 1962. [2022-07-12 09:27:23,668 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1962 states, 1588 states have (on average 1.3652392947103276) internal successors, (2168), 1612 states have internal predecessors, (2168), 212 states have call successors, (212), 146 states have call predecessors, (212), 161 states have return successors, (281), 207 states have call predecessors, (281), 210 states have call successors, (281) [2022-07-12 09:27:23,674 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1962 states to 1962 states and 2661 transitions. [2022-07-12 09:27:23,675 INFO L78 Accepts]: Start accepts. Automaton has 1962 states and 2661 transitions. Word has length 135 [2022-07-12 09:27:23,675 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 09:27:23,675 INFO L495 AbstractCegarLoop]: Abstraction has 1962 states and 2661 transitions. [2022-07-12 09:27:23,675 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 28.666666666666668) internal successors, (86), 3 states have internal predecessors, (86), 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-12 09:27:23,675 INFO L276 IsEmpty]: Start isEmpty. Operand 1962 states and 2661 transitions. [2022-07-12 09:27:23,679 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137 [2022-07-12 09:27:23,679 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 09:27:23,679 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, 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-12 09:27:23,710 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-12 09:27:23,907 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 09:27:23,907 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 09:27:23,908 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 09:27:23,908 INFO L85 PathProgramCache]: Analyzing trace with hash -1173690117, now seen corresponding path program 1 times [2022-07-12 09:27:23,908 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 09:27:23,908 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [550978003] [2022-07-12 09:27:23,908 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 09:27:23,908 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 09:27:23,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 09:27:23,929 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-07-12 09:27:23,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 09:27:23,935 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-12 09:27:23,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 09:27:23,942 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-07-12 09:27:23,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 09:27:23,971 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-07-12 09:27:23,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 09:27:23,974 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2022-07-12 09:27:23,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 09:27:23,977 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2022-07-12 09:27:23,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 09:27:23,979 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2022-07-12 09:27:23,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 09:27:23,981 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-07-12 09:27:23,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 09:27:23,984 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2022-07-12 09:27:23,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 09:27:23,992 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-07-12 09:27:23,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 09:27:23,995 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 121 [2022-07-12 09:27:23,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 09:27:23,997 INFO L134 CoverageAnalysis]: Checked inductivity of 83 backedges. 0 proven. 22 refuted. 0 times theorem prover too weak. 61 trivial. 0 not checked. [2022-07-12 09:27:23,997 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 09:27:23,998 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [550978003] [2022-07-12 09:27:23,998 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [550978003] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-12 09:27:23,998 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [176704348] [2022-07-12 09:27:23,998 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 09:27:23,998 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 09:27:23,998 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-12 09:27:23,999 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-12 09:27:24,001 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-12 09:27:24,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 09:27:24,094 INFO L263 TraceCheckSpWp]: Trace formula consists of 452 conjuncts, 3 conjunts are in the unsatisfiable core [2022-07-12 09:27:24,097 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 09:27:24,130 INFO L134 CoverageAnalysis]: Checked inductivity of 83 backedges. 75 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2022-07-12 09:27:24,131 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-12 09:27:24,131 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [176704348] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 09:27:24,131 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-07-12 09:27:24,131 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [7] total 8 [2022-07-12 09:27:24,132 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1488664397] [2022-07-12 09:27:24,132 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 09:27:24,132 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-12 09:27:24,132 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 09:27:24,132 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-12 09:27:24,133 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2022-07-12 09:27:24,133 INFO L87 Difference]: Start difference. First operand 1962 states and 2661 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, (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-12 09:27:24,220 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 09:27:24,220 INFO L93 Difference]: Finished difference Result 3023 states and 4170 transitions. [2022-07-12 09:27:24,221 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-12 09:27:24,221 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, (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 136 [2022-07-12 09:27:24,221 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 09:27:24,229 INFO L225 Difference]: With dead ends: 3023 [2022-07-12 09:27:24,229 INFO L226 Difference]: Without dead ends: 1988 [2022-07-12 09:27:24,232 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 163 GetRequests, 157 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-12 09:27:24,233 INFO L413 NwaCegarLoop]: 261 mSDtfsCounter, 111 mSDsluCounter, 141 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 111 SdHoareTripleChecker+Valid, 402 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-12 09:27:24,233 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [111 Valid, 402 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-12 09:27:24,235 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1988 states. [2022-07-12 09:27:24,351 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1988 to 1962. [2022-07-12 09:27:24,366 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1962 states, 1588 states have (on average 1.3406801007556675) internal successors, (2129), 1612 states have internal predecessors, (2129), 212 states have call successors, (212), 146 states have call predecessors, (212), 161 states have return successors, (281), 207 states have call predecessors, (281), 210 states have call successors, (281) [2022-07-12 09:27:24,372 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1962 states to 1962 states and 2622 transitions. [2022-07-12 09:27:24,373 INFO L78 Accepts]: Start accepts. Automaton has 1962 states and 2622 transitions. Word has length 136 [2022-07-12 09:27:24,374 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 09:27:24,374 INFO L495 AbstractCegarLoop]: Abstraction has 1962 states and 2622 transitions. [2022-07-12 09:27:24,375 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, (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-12 09:27:24,375 INFO L276 IsEmpty]: Start isEmpty. Operand 1962 states and 2622 transitions. [2022-07-12 09:27:24,380 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137 [2022-07-12 09:27:24,380 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 09:27:24,381 INFO L195 NwaCegarLoop]: trace histogram [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] [2022-07-12 09:27:24,408 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-12 09:27:24,595 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2022-07-12 09:27:24,595 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 09:27:24,596 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 09:27:24,596 INFO L85 PathProgramCache]: Analyzing trace with hash -304816677, now seen corresponding path program 1 times [2022-07-12 09:27:24,596 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 09:27:24,596 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [128829799] [2022-07-12 09:27:24,596 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 09:27:24,597 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 09:27:24,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 09:27:24,612 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-07-12 09:27:24,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 09:27:24,619 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-12 09:27:24,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 09:27:24,624 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-07-12 09:27:24,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 09:27:24,654 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-07-12 09:27:24,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 09:27:24,657 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2022-07-12 09:27:24,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 09:27:24,658 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2022-07-12 09:27:24,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 09:27:24,660 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2022-07-12 09:27:24,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 09:27:24,663 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-07-12 09:27:24,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 09:27:24,666 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2022-07-12 09:27:24,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 09:27:24,670 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-07-12 09:27:24,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 09:27:24,673 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 121 [2022-07-12 09:27:24,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 09:27:24,675 INFO L134 CoverageAnalysis]: Checked inductivity of 81 backedges. 0 proven. 20 refuted. 0 times theorem prover too weak. 61 trivial. 0 not checked. [2022-07-12 09:27:24,675 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 09:27:24,675 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [128829799] [2022-07-12 09:27:24,676 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [128829799] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-12 09:27:24,676 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1528990533] [2022-07-12 09:27:24,676 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 09:27:24,676 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 09:27:24,676 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-12 09:27:24,678 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-12 09:27:24,679 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-12 09:27:24,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 09:27:24,768 INFO L263 TraceCheckSpWp]: Trace formula consists of 458 conjuncts, 2 conjunts are in the unsatisfiable core [2022-07-12 09:27:24,772 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 09:27:24,799 INFO L134 CoverageAnalysis]: Checked inductivity of 81 backedges. 57 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2022-07-12 09:27:24,799 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-12 09:27:24,799 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1528990533] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 09:27:24,799 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-07-12 09:27:24,800 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [7] total 8 [2022-07-12 09:27:24,801 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1661043959] [2022-07-12 09:27:24,801 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 09:27:24,802 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-12 09:27:24,802 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 09:27:24,803 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-12 09:27:24,803 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2022-07-12 09:27:24,803 INFO L87 Difference]: Start difference. First operand 1962 states and 2622 transitions. Second operand has 3 states, 3 states have (on average 31.333333333333332) internal successors, (94), 3 states have internal predecessors, (94), 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-12 09:27:24,899 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 09:27:24,899 INFO L93 Difference]: Finished difference Result 3759 states and 5079 transitions. [2022-07-12 09:27:24,899 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-12 09:27:24,900 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 31.333333333333332) internal successors, (94), 3 states have internal predecessors, (94), 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 136 [2022-07-12 09:27:24,900 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 09:27:24,912 INFO L225 Difference]: With dead ends: 3759 [2022-07-12 09:27:24,912 INFO L226 Difference]: Without dead ends: 1938 [2022-07-12 09:27:24,916 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 163 GetRequests, 157 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-12 09:27:24,917 INFO L413 NwaCegarLoop]: 154 mSDtfsCounter, 131 mSDsluCounter, 24 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 131 SdHoareTripleChecker+Valid, 178 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-12 09:27:24,918 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [131 Valid, 178 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-12 09:27:24,920 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1938 states. [2022-07-12 09:27:25,028 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1938 to 1798. [2022-07-12 09:27:25,031 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1798 states, 1455 states have (on average 1.2879725085910654) internal successors, (1874), 1475 states have internal predecessors, (1874), 196 states have call successors, (196), 135 states have call predecessors, (196), 146 states have return successors, (227), 189 states have call predecessors, (227), 194 states have call successors, (227) [2022-07-12 09:27:25,035 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1798 states to 1798 states and 2297 transitions. [2022-07-12 09:27:25,036 INFO L78 Accepts]: Start accepts. Automaton has 1798 states and 2297 transitions. Word has length 136 [2022-07-12 09:27:25,036 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 09:27:25,036 INFO L495 AbstractCegarLoop]: Abstraction has 1798 states and 2297 transitions. [2022-07-12 09:27:25,037 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 31.333333333333332) internal successors, (94), 3 states have internal predecessors, (94), 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-12 09:27:25,037 INFO L276 IsEmpty]: Start isEmpty. Operand 1798 states and 2297 transitions. [2022-07-12 09:27:25,040 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 138 [2022-07-12 09:27:25,040 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 09:27:25,040 INFO L195 NwaCegarLoop]: trace histogram [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] [2022-07-12 09:27:25,064 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2022-07-12 09:27:25,259 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 09:27:25,259 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 09:27:25,260 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 09:27:25,260 INFO L85 PathProgramCache]: Analyzing trace with hash -829513402, now seen corresponding path program 1 times [2022-07-12 09:27:25,260 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 09:27:25,260 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [844957114] [2022-07-12 09:27:25,260 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 09:27:25,260 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 09:27:25,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 09:27:25,276 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-07-12 09:27:25,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 09:27:25,283 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-12 09:27:25,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 09:27:25,288 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-07-12 09:27:25,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 09:27:25,318 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-07-12 09:27:25,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 09:27:25,321 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2022-07-12 09:27:25,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 09:27:25,322 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2022-07-12 09:27:25,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 09:27:25,324 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2022-07-12 09:27:25,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 09:27:25,326 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-07-12 09:27:25,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 09:27:25,328 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2022-07-12 09:27:25,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 09:27:25,331 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-07-12 09:27:25,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 09:27:25,333 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2022-07-12 09:27:25,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 09:27:25,335 INFO L134 CoverageAnalysis]: Checked inductivity of 82 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 61 trivial. 0 not checked. [2022-07-12 09:27:25,335 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 09:27:25,335 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [844957114] [2022-07-12 09:27:25,335 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [844957114] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-12 09:27:25,335 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1444308292] [2022-07-12 09:27:25,336 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 09:27:25,336 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 09:27:25,336 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-12 09:27:25,337 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-12 09:27:25,339 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-12 09:27:25,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 09:27:25,423 INFO L263 TraceCheckSpWp]: Trace formula consists of 454 conjuncts, 6 conjunts are in the unsatisfiable core [2022-07-12 09:27:25,426 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 09:27:25,492 INFO L134 CoverageAnalysis]: Checked inductivity of 82 backedges. 26 proven. 0 refuted. 0 times theorem prover too weak. 56 trivial. 0 not checked. [2022-07-12 09:27:25,492 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-12 09:27:25,493 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1444308292] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 09:27:25,493 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-07-12 09:27:25,493 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [7] total 10 [2022-07-12 09:27:25,493 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1253993844] [2022-07-12 09:27:25,493 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 09:27:25,493 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-07-12 09:27:25,494 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 09:27:25,494 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-12 09:27:25,494 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2022-07-12 09:27:25,494 INFO L87 Difference]: Start difference. First operand 1798 states and 2297 transitions. Second operand has 5 states, 5 states have (on average 16.2) internal successors, (81), 4 states have internal predecessors, (81), 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-12 09:27:25,659 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 09:27:25,659 INFO L93 Difference]: Finished difference Result 2932 states and 3786 transitions. [2022-07-12 09:27:25,660 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-12 09:27:25,660 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 16.2) internal successors, (81), 4 states have internal predecessors, (81), 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 137 [2022-07-12 09:27:25,660 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 09:27:25,667 INFO L225 Difference]: With dead ends: 2932 [2022-07-12 09:27:25,667 INFO L226 Difference]: Without dead ends: 1654 [2022-07-12 09:27:25,670 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 165 GetRequests, 156 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-12 09:27:25,671 INFO L413 NwaCegarLoop]: 132 mSDtfsCounter, 149 mSDsluCounter, 155 mSDsCounter, 0 mSdLazyCounter, 100 mSolverCounterSat, 24 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 157 SdHoareTripleChecker+Valid, 287 SdHoareTripleChecker+Invalid, 124 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 24 IncrementalHoareTripleChecker+Valid, 100 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-12 09:27:25,671 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [157 Valid, 287 Invalid, 124 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [24 Valid, 100 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-12 09:27:25,673 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1654 states. [2022-07-12 09:27:25,768 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1654 to 1193. [2022-07-12 09:27:25,770 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1193 states, 968 states have (on average 1.2572314049586777) internal successors, (1217), 980 states have internal predecessors, (1217), 131 states have call successors, (131), 88 states have call predecessors, (131), 93 states have return successors, (145), 125 states have call predecessors, (145), 129 states have call successors, (145) [2022-07-12 09:27:25,773 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1193 states to 1193 states and 1493 transitions. [2022-07-12 09:27:25,773 INFO L78 Accepts]: Start accepts. Automaton has 1193 states and 1493 transitions. Word has length 137 [2022-07-12 09:27:25,774 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 09:27:25,774 INFO L495 AbstractCegarLoop]: Abstraction has 1193 states and 1493 transitions. [2022-07-12 09:27:25,774 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 16.2) internal successors, (81), 4 states have internal predecessors, (81), 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-12 09:27:25,774 INFO L276 IsEmpty]: Start isEmpty. Operand 1193 states and 1493 transitions. [2022-07-12 09:27:25,776 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 138 [2022-07-12 09:27:25,776 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 09:27:25,776 INFO L195 NwaCegarLoop]: trace histogram [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] [2022-07-12 09:27:25,801 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2022-07-12 09:27:25,991 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 09:27:25,991 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 09:27:25,992 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 09:27:25,992 INFO L85 PathProgramCache]: Analyzing trace with hash 1598745220, now seen corresponding path program 1 times [2022-07-12 09:27:25,992 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 09:27:25,992 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1056773957] [2022-07-12 09:27:25,992 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 09:27:25,992 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 09:27:26,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 09:27:26,009 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-07-12 09:27:26,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 09:27:26,021 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-12 09:27:26,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 09:27:26,027 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-07-12 09:27:26,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 09:27:26,057 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-07-12 09:27:26,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 09:27:26,060 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2022-07-12 09:27:26,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 09:27:26,061 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2022-07-12 09:27:26,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 09:27:26,063 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2022-07-12 09:27:26,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 09:27:26,066 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-07-12 09:27:26,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 09:27:26,071 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2022-07-12 09:27:26,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 09:27:26,080 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-07-12 09:27:26,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 09:27:26,083 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2022-07-12 09:27:26,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 09:27:26,085 INFO L134 CoverageAnalysis]: Checked inductivity of 82 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 61 trivial. 0 not checked. [2022-07-12 09:27:26,085 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 09:27:26,085 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1056773957] [2022-07-12 09:27:26,085 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1056773957] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-12 09:27:26,085 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1712621316] [2022-07-12 09:27:26,085 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 09:27:26,085 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 09:27:26,085 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-12 09:27:26,088 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-12 09:27:26,089 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-12 09:27:26,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 09:27:26,171 INFO L263 TraceCheckSpWp]: Trace formula consists of 451 conjuncts, 6 conjunts are in the unsatisfiable core [2022-07-12 09:27:26,173 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 09:27:26,248 INFO L134 CoverageAnalysis]: Checked inductivity of 82 backedges. 26 proven. 0 refuted. 0 times theorem prover too weak. 56 trivial. 0 not checked. [2022-07-12 09:27:26,248 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-12 09:27:26,248 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1712621316] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 09:27:26,248 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-07-12 09:27:26,248 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [7] total 10 [2022-07-12 09:27:26,248 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [436061388] [2022-07-12 09:27:26,248 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 09:27:26,249 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-07-12 09:27:26,249 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 09:27:26,249 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-12 09:27:26,249 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2022-07-12 09:27:26,250 INFO L87 Difference]: Start difference. First operand 1193 states and 1493 transitions. Second operand has 5 states, 5 states have (on average 16.2) internal successors, (81), 4 states have internal predecessors, (81), 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-12 09:27:26,465 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 09:27:26,466 INFO L93 Difference]: Finished difference Result 2526 states and 3209 transitions. [2022-07-12 09:27:26,466 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-07-12 09:27:26,466 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 16.2) internal successors, (81), 4 states have internal predecessors, (81), 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 137 [2022-07-12 09:27:26,467 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 09:27:26,472 INFO L225 Difference]: With dead ends: 2526 [2022-07-12 09:27:26,473 INFO L226 Difference]: Without dead ends: 1343 [2022-07-12 09:27:26,476 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 166 GetRequests, 156 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=26, Invalid=106, Unknown=0, NotChecked=0, Total=132 [2022-07-12 09:27:26,477 INFO L413 NwaCegarLoop]: 144 mSDtfsCounter, 170 mSDsluCounter, 150 mSDsCounter, 0 mSdLazyCounter, 150 mSolverCounterSat, 29 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 178 SdHoareTripleChecker+Valid, 294 SdHoareTripleChecker+Invalid, 179 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 29 IncrementalHoareTripleChecker+Valid, 150 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-12 09:27:26,477 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [178 Valid, 294 Invalid, 179 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [29 Valid, 150 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-12 09:27:26,478 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1343 states. [2022-07-12 09:27:26,555 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1343 to 1287. [2022-07-12 09:27:26,557 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1287 states, 1056 states have (on average 1.2017045454545454) internal successors, (1269), 1068 states have internal predecessors, (1269), 131 states have call successors, (131), 94 states have call predecessors, (131), 99 states have return successors, (145), 125 states have call predecessors, (145), 129 states have call successors, (145) [2022-07-12 09:27:26,560 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1287 states to 1287 states and 1545 transitions. [2022-07-12 09:27:26,561 INFO L78 Accepts]: Start accepts. Automaton has 1287 states and 1545 transitions. Word has length 137 [2022-07-12 09:27:26,561 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 09:27:26,561 INFO L495 AbstractCegarLoop]: Abstraction has 1287 states and 1545 transitions. [2022-07-12 09:27:26,561 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 16.2) internal successors, (81), 4 states have internal predecessors, (81), 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-12 09:27:26,561 INFO L276 IsEmpty]: Start isEmpty. Operand 1287 states and 1545 transitions. [2022-07-12 09:27:26,571 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 138 [2022-07-12 09:27:26,572 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 09:27:26,572 INFO L195 NwaCegarLoop]: trace histogram [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] [2022-07-12 09:27:26,601 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Forceful destruction successful, exit code 0 [2022-07-12 09:27:26,790 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,SelfDestructingSolverStorable20 [2022-07-12 09:27:26,790 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 09:27:26,791 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 09:27:26,791 INFO L85 PathProgramCache]: Analyzing trace with hash 291602822, now seen corresponding path program 1 times [2022-07-12 09:27:26,791 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 09:27:26,791 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1773863640] [2022-07-12 09:27:26,791 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 09:27:26,791 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 09:27:26,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 09:27:26,811 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-07-12 09:27:26,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 09:27:26,819 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-12 09:27:26,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 09:27:26,826 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-07-12 09:27:26,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 09:27:26,855 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-07-12 09:27:26,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 09:27:26,857 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2022-07-12 09:27:26,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 09:27:26,860 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2022-07-12 09:27:26,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 09:27:26,862 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2022-07-12 09:27:26,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 09:27:26,864 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-07-12 09:27:26,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 09:27:26,866 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2022-07-12 09:27:26,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 09:27:26,869 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-07-12 09:27:26,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 09:27:26,871 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2022-07-12 09:27:26,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 09:27:26,873 INFO L134 CoverageAnalysis]: Checked inductivity of 82 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 61 trivial. 0 not checked. [2022-07-12 09:27:26,873 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 09:27:26,873 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1773863640] [2022-07-12 09:27:26,873 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1773863640] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-12 09:27:26,874 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [495121732] [2022-07-12 09:27:26,874 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 09:27:26,874 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 09:27:26,874 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-12 09:27:26,876 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-12 09:27:26,903 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-12 09:27:26,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 09:27:26,971 INFO L263 TraceCheckSpWp]: Trace formula consists of 448 conjuncts, 7 conjunts are in the unsatisfiable core [2022-07-12 09:27:26,974 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 09:27:27,004 INFO L134 CoverageAnalysis]: Checked inductivity of 82 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 71 trivial. 0 not checked. [2022-07-12 09:27:27,005 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-12 09:27:27,005 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [495121732] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 09:27:27,005 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-07-12 09:27:27,005 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [7] total 7 [2022-07-12 09:27:27,005 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [765144869] [2022-07-12 09:27:27,006 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 09:27:27,006 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-07-12 09:27:27,006 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 09:27:27,006 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-12 09:27:27,007 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-07-12 09:27:27,007 INFO L87 Difference]: Start difference. First operand 1287 states and 1545 transitions. Second operand has 5 states, 5 states have (on average 15.0) internal successors, (75), 5 states have internal predecessors, (75), 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-12 09:27:27,117 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 09:27:27,117 INFO L93 Difference]: Finished difference Result 2430 states and 2939 transitions. [2022-07-12 09:27:27,119 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-07-12 09:27:27,120 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 15.0) internal successors, (75), 5 states have internal predecessors, (75), 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 137 [2022-07-12 09:27:27,120 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 09:27:27,124 INFO L225 Difference]: With dead ends: 2430 [2022-07-12 09:27:27,124 INFO L226 Difference]: Without dead ends: 1154 [2022-07-12 09:27:27,128 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 166 GetRequests, 157 SyntacticMatches, 2 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2022-07-12 09:27:27,129 INFO L413 NwaCegarLoop]: 144 mSDtfsCounter, 48 mSDsluCounter, 441 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 48 SdHoareTripleChecker+Valid, 585 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-12 09:27:27,130 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [48 Valid, 585 Invalid, 14 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-12 09:27:27,131 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1154 states. [2022-07-12 09:27:27,204 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1154 to 1118. [2022-07-12 09:27:27,206 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1118 states, 919 states have (on average 1.1664853101196953) internal successors, (1072), 930 states have internal predecessors, (1072), 112 states have call successors, (112), 80 states have call predecessors, (112), 86 states have return successors, (121), 108 states have call predecessors, (121), 110 states have call successors, (121) [2022-07-12 09:27:27,208 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1118 states to 1118 states and 1305 transitions. [2022-07-12 09:27:27,209 INFO L78 Accepts]: Start accepts. Automaton has 1118 states and 1305 transitions. Word has length 137 [2022-07-12 09:27:27,209 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 09:27:27,209 INFO L495 AbstractCegarLoop]: Abstraction has 1118 states and 1305 transitions. [2022-07-12 09:27:27,209 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 15.0) internal successors, (75), 5 states have internal predecessors, (75), 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-12 09:27:27,210 INFO L276 IsEmpty]: Start isEmpty. Operand 1118 states and 1305 transitions. [2022-07-12 09:27:27,211 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 138 [2022-07-12 09:27:27,211 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 09:27:27,212 INFO L195 NwaCegarLoop]: trace histogram [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] [2022-07-12 09:27:27,239 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Forceful destruction successful, exit code 0 [2022-07-12 09:27:27,427 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,SelfDestructingSolverStorable21 [2022-07-12 09:27:27,427 INFO L420 AbstractCegarLoop]: === Iteration 23 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 09:27:27,428 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 09:27:27,428 INFO L85 PathProgramCache]: Analyzing trace with hash -1015302262, now seen corresponding path program 1 times [2022-07-12 09:27:27,428 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 09:27:27,428 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [696072950] [2022-07-12 09:27:27,428 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 09:27:27,428 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 09:27:27,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 09:27:27,455 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-07-12 09:27:27,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 09:27:27,462 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-12 09:27:27,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 09:27:27,468 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-07-12 09:27:27,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 09:27:27,509 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-07-12 09:27:27,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 09:27:27,511 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2022-07-12 09:27:27,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 09:27:27,513 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2022-07-12 09:27:27,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 09:27:27,514 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2022-07-12 09:27:27,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 09:27:27,517 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-07-12 09:27:27,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 09:27:27,519 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2022-07-12 09:27:27,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 09:27:27,522 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-07-12 09:27:27,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 09:27:27,525 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2022-07-12 09:27:27,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 09:27:27,528 INFO L134 CoverageAnalysis]: Checked inductivity of 82 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 72 trivial. 0 not checked. [2022-07-12 09:27:27,528 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 09:27:27,528 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [696072950] [2022-07-12 09:27:27,528 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [696072950] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-12 09:27:27,528 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [473504546] [2022-07-12 09:27:27,528 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 09:27:27,528 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 09:27:27,528 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-12 09:27:27,530 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-12 09:27:27,531 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-12 09:27:27,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 09:27:27,615 INFO L263 TraceCheckSpWp]: Trace formula consists of 446 conjuncts, 7 conjunts are in the unsatisfiable core [2022-07-12 09:27:27,625 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 09:27:27,651 INFO L134 CoverageAnalysis]: Checked inductivity of 82 backedges. 22 proven. 0 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2022-07-12 09:27:27,651 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-12 09:27:27,651 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [473504546] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 09:27:27,651 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-07-12 09:27:27,651 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [7] total 7 [2022-07-12 09:27:27,651 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [290299211] [2022-07-12 09:27:27,651 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 09:27:27,652 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-07-12 09:27:27,652 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 09:27:27,652 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-12 09:27:27,652 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-07-12 09:27:27,653 INFO L87 Difference]: Start difference. First operand 1118 states and 1305 transitions. Second operand has 5 states, 5 states have (on average 16.2) internal successors, (81), 5 states have internal predecessors, (81), 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-12 09:27:27,771 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 09:27:27,771 INFO L93 Difference]: Finished difference Result 2253 states and 2674 transitions. [2022-07-12 09:27:27,771 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-07-12 09:27:27,772 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 16.2) internal successors, (81), 5 states have internal predecessors, (81), 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 137 [2022-07-12 09:27:27,772 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 09:27:27,776 INFO L225 Difference]: With dead ends: 2253 [2022-07-12 09:27:27,776 INFO L226 Difference]: Without dead ends: 1146 [2022-07-12 09:27:27,778 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 166 GetRequests, 157 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-12 09:27:27,779 INFO L413 NwaCegarLoop]: 144 mSDtfsCounter, 10 mSDsluCounter, 431 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 575 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-12 09:27:27,779 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [10 Valid, 575 Invalid, 14 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-12 09:27:27,780 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1146 states. [2022-07-12 09:27:27,855 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1146 to 1130. [2022-07-12 09:27:27,857 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1130 states, 931 states have (on average 1.1417830290010742) internal successors, (1063), 942 states have internal predecessors, (1063), 112 states have call successors, (112), 80 states have call predecessors, (112), 86 states have return successors, (121), 108 states have call predecessors, (121), 110 states have call successors, (121) [2022-07-12 09:27:27,859 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1130 states to 1130 states and 1296 transitions. [2022-07-12 09:27:27,860 INFO L78 Accepts]: Start accepts. Automaton has 1130 states and 1296 transitions. Word has length 137 [2022-07-12 09:27:27,860 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 09:27:27,860 INFO L495 AbstractCegarLoop]: Abstraction has 1130 states and 1296 transitions. [2022-07-12 09:27:27,860 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 16.2) internal successors, (81), 5 states have internal predecessors, (81), 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-12 09:27:27,861 INFO L276 IsEmpty]: Start isEmpty. Operand 1130 states and 1296 transitions. [2022-07-12 09:27:27,862 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 138 [2022-07-12 09:27:27,862 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 09:27:27,863 INFO L195 NwaCegarLoop]: trace histogram [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] [2022-07-12 09:27:27,890 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Forceful destruction successful, exit code 0 [2022-07-12 09:27:28,075 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,SelfDestructingSolverStorable22 [2022-07-12 09:27:28,075 INFO L420 AbstractCegarLoop]: === Iteration 24 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 09:27:28,076 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 09:27:28,076 INFO L85 PathProgramCache]: Analyzing trace with hash 1278353166, now seen corresponding path program 1 times [2022-07-12 09:27:28,076 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 09:27:28,076 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [118610679] [2022-07-12 09:27:28,076 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 09:27:28,076 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 09:27:28,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 09:27:28,142 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-07-12 09:27:28,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 09:27:28,151 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-12 09:27:28,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 09:27:28,158 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-07-12 09:27:28,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 09:27:28,162 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-07-12 09:27:28,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 09:27:28,163 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2022-07-12 09:27:28,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 09:27:28,164 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2022-07-12 09:27:28,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 09:27:28,165 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2022-07-12 09:27:28,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 09:27:28,169 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-07-12 09:27:28,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 09:27:28,171 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2022-07-12 09:27:28,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 09:27:28,175 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-07-12 09:27:28,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 09:27:28,177 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2022-07-12 09:27:28,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 09:27:28,179 INFO L134 CoverageAnalysis]: Checked inductivity of 82 backedges. 19 proven. 0 refuted. 0 times theorem prover too weak. 63 trivial. 0 not checked. [2022-07-12 09:27:28,179 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 09:27:28,179 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [118610679] [2022-07-12 09:27:28,179 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [118610679] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 09:27:28,179 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 09:27:28,179 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-12 09:27:28,180 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [605636239] [2022-07-12 09:27:28,180 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 09:27:28,180 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-12 09:27:28,180 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 09:27:28,181 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-12 09:27:28,181 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-12 09:27:28,181 INFO L87 Difference]: Start difference. First operand 1130 states and 1296 transitions. Second operand has 6 states, 6 states have (on average 13.5) internal successors, (81), 4 states have internal predecessors, (81), 5 states have call successors, (10), 4 states have call predecessors, (10), 1 states have return successors, (9), 3 states have call predecessors, (9), 4 states have call successors, (9) [2022-07-12 09:27:28,736 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 09:27:28,736 INFO L93 Difference]: Finished difference Result 2094 states and 2378 transitions. [2022-07-12 09:27:28,736 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-07-12 09:27:28,736 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 13.5) internal successors, (81), 4 states have internal predecessors, (81), 5 states have call successors, (10), 4 states have call predecessors, (10), 1 states have return successors, (9), 3 states have call predecessors, (9), 4 states have call successors, (9) Word has length 137 [2022-07-12 09:27:28,737 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 09:27:28,742 INFO L225 Difference]: With dead ends: 2094 [2022-07-12 09:27:28,743 INFO L226 Difference]: Without dead ends: 2091 [2022-07-12 09:27:28,743 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=45, Invalid=111, Unknown=0, NotChecked=0, Total=156 [2022-07-12 09:27:28,744 INFO L413 NwaCegarLoop]: 217 mSDtfsCounter, 489 mSDsluCounter, 307 mSDsCounter, 0 mSdLazyCounter, 341 mSolverCounterSat, 91 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 512 SdHoareTripleChecker+Valid, 524 SdHoareTripleChecker+Invalid, 432 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 91 IncrementalHoareTripleChecker+Valid, 341 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-07-12 09:27:28,744 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [512 Valid, 524 Invalid, 432 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [91 Valid, 341 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-07-12 09:27:28,746 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2091 states. [2022-07-12 09:27:28,865 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2091 to 1506. [2022-07-12 09:27:28,867 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1506 states, 1241 states have (on average 1.1402095084609185) internal successors, (1415), 1256 states have internal predecessors, (1415), 146 states have call successors, (146), 104 states have call predecessors, (146), 118 states have return successors, (163), 146 states have call predecessors, (163), 144 states have call successors, (163) [2022-07-12 09:27:28,870 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1506 states to 1506 states and 1724 transitions. [2022-07-12 09:27:28,870 INFO L78 Accepts]: Start accepts. Automaton has 1506 states and 1724 transitions. Word has length 137 [2022-07-12 09:27:28,871 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 09:27:28,871 INFO L495 AbstractCegarLoop]: Abstraction has 1506 states and 1724 transitions. [2022-07-12 09:27:28,871 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 13.5) internal successors, (81), 4 states have internal predecessors, (81), 5 states have call successors, (10), 4 states have call predecessors, (10), 1 states have return successors, (9), 3 states have call predecessors, (9), 4 states have call successors, (9) [2022-07-12 09:27:28,871 INFO L276 IsEmpty]: Start isEmpty. Operand 1506 states and 1724 transitions. [2022-07-12 09:27:28,873 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 142 [2022-07-12 09:27:28,873 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 09:27:28,874 INFO L195 NwaCegarLoop]: trace histogram [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] [2022-07-12 09:27:28,874 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2022-07-12 09:27:28,874 INFO L420 AbstractCegarLoop]: === Iteration 25 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 09:27:28,874 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 09:27:28,874 INFO L85 PathProgramCache]: Analyzing trace with hash -1645790282, now seen corresponding path program 1 times [2022-07-12 09:27:28,875 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 09:27:28,875 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [12149620] [2022-07-12 09:27:28,875 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 09:27:28,875 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 09:27:28,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 09:27:28,897 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-07-12 09:27:28,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 09:27:28,904 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-12 09:27:28,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 09:27:28,911 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-07-12 09:27:28,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 09:27:28,913 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-07-12 09:27:28,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 09:27:28,915 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2022-07-12 09:27:28,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 09:27:28,916 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2022-07-12 09:27:28,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 09:27:28,917 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2022-07-12 09:27:28,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 09:27:28,919 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-07-12 09:27:28,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 09:27:28,921 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2022-07-12 09:27:28,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 09:27:28,924 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-07-12 09:27:28,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 09:27:28,926 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2022-07-12 09:27:28,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 09:27:28,927 INFO L134 CoverageAnalysis]: Checked inductivity of 82 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 82 trivial. 0 not checked. [2022-07-12 09:27:28,927 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 09:27:28,928 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [12149620] [2022-07-12 09:27:28,928 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [12149620] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 09:27:28,928 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 09:27:28,928 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-07-12 09:27:28,928 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [979813829] [2022-07-12 09:27:28,928 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 09:27:28,929 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-07-12 09:27:28,929 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 09:27:28,929 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-12 09:27:28,929 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-07-12 09:27:28,930 INFO L87 Difference]: Start difference. First operand 1506 states and 1724 transitions. Second operand has 5 states, 5 states have (on average 15.0) internal successors, (75), 3 states have internal predecessors, (75), 3 states have call successors, (9), 4 states have call predecessors, (9), 1 states have return successors, (8), 1 states have call predecessors, (8), 2 states have call successors, (8) [2022-07-12 09:27:29,256 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 09:27:29,257 INFO L93 Difference]: Finished difference Result 2729 states and 3212 transitions. [2022-07-12 09:27:29,257 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-07-12 09:27:29,257 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 15.0) internal successors, (75), 3 states have internal predecessors, (75), 3 states have call successors, (9), 4 states have call predecessors, (9), 1 states have return successors, (8), 1 states have call predecessors, (8), 2 states have call successors, (8) Word has length 141 [2022-07-12 09:27:29,258 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 09:27:29,264 INFO L225 Difference]: With dead ends: 2729 [2022-07-12 09:27:29,264 INFO L226 Difference]: Without dead ends: 1869 [2022-07-12 09:27:29,266 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 23 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-12 09:27:29,266 INFO L413 NwaCegarLoop]: 193 mSDtfsCounter, 142 mSDsluCounter, 278 mSDsCounter, 0 mSdLazyCounter, 204 mSolverCounterSat, 34 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 155 SdHoareTripleChecker+Valid, 471 SdHoareTripleChecker+Invalid, 238 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 34 IncrementalHoareTripleChecker+Valid, 204 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-07-12 09:27:29,267 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [155 Valid, 471 Invalid, 238 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [34 Valid, 204 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-07-12 09:27:29,268 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1869 states. [2022-07-12 09:27:29,391 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1869 to 1508. [2022-07-12 09:27:29,393 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1508 states, 1243 states have (on average 1.1399839098954143) internal successors, (1417), 1258 states have internal predecessors, (1417), 146 states have call successors, (146), 104 states have call predecessors, (146), 118 states have return successors, (163), 146 states have call predecessors, (163), 144 states have call successors, (163) [2022-07-12 09:27:29,396 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1508 states to 1508 states and 1726 transitions. [2022-07-12 09:27:29,397 INFO L78 Accepts]: Start accepts. Automaton has 1508 states and 1726 transitions. Word has length 141 [2022-07-12 09:27:29,397 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 09:27:29,397 INFO L495 AbstractCegarLoop]: Abstraction has 1508 states and 1726 transitions. [2022-07-12 09:27:29,398 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 15.0) internal successors, (75), 3 states have internal predecessors, (75), 3 states have call successors, (9), 4 states have call predecessors, (9), 1 states have return successors, (8), 1 states have call predecessors, (8), 2 states have call successors, (8) [2022-07-12 09:27:29,398 INFO L276 IsEmpty]: Start isEmpty. Operand 1508 states and 1726 transitions. [2022-07-12 09:27:29,400 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 143 [2022-07-12 09:27:29,400 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 09:27:29,400 INFO L195 NwaCegarLoop]: trace histogram [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] [2022-07-12 09:27:29,400 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2022-07-12 09:27:29,401 INFO L420 AbstractCegarLoop]: === Iteration 26 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 09:27:29,401 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 09:27:29,401 INFO L85 PathProgramCache]: Analyzing trace with hash 1749276047, now seen corresponding path program 1 times [2022-07-12 09:27:29,401 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 09:27:29,401 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [884797303] [2022-07-12 09:27:29,402 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 09:27:29,402 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 09:27:29,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-12 09:27:29,414 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-12 09:27:29,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-12 09:27:29,468 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-12 09:27:29,469 INFO L271 BasicCegarLoop]: Counterexample is feasible [2022-07-12 09:27:29,470 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location error2Err0ASSERT_VIOLATIONERROR_FUNCTION (1 of 2 remaining) [2022-07-12 09:27:29,471 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location error1Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 2 remaining) [2022-07-12 09:27:29,472 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2022-07-12 09:27:29,474 INFO L356 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 09:27:29,478 INFO L176 ceAbstractionStarter]: Computing trace abstraction results [2022-07-12 09:27:29,596 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 12.07 09:27:29 BoogieIcfgContainer [2022-07-12 09:27:29,596 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-07-12 09:27:29,597 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-07-12 09:27:29,597 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-07-12 09:27:29,597 INFO L275 PluginConnector]: Witness Printer initialized [2022-07-12 09:27:29,598 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.07 09:27:12" (3/4) ... [2022-07-12 09:27:29,599 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2022-07-12 09:27:29,690 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2022-07-12 09:27:29,691 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-07-12 09:27:29,691 INFO L158 Benchmark]: Toolchain (without parser) took 17651.44ms. Allocated memory was 98.6MB in the beginning and 348.1MB in the end (delta: 249.6MB). Free memory was 66.6MB in the beginning and 121.3MB in the end (delta: -54.7MB). Peak memory consumption was 194.6MB. Max. memory is 16.1GB. [2022-07-12 09:27:29,695 INFO L158 Benchmark]: CDTParser took 0.22ms. Allocated memory is still 81.8MB. Free memory was 40.6MB in the beginning and 40.6MB in the end (delta: 39.8kB). There was no memory consumed. Max. memory is 16.1GB. [2022-07-12 09:27:29,695 INFO L158 Benchmark]: CACSL2BoogieTranslator took 327.78ms. Allocated memory is still 98.6MB. Free memory was 66.4MB in the beginning and 71.4MB in the end (delta: -5.0MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2022-07-12 09:27:29,696 INFO L158 Benchmark]: Boogie Procedure Inliner took 47.74ms. Allocated memory is still 98.6MB. Free memory was 71.4MB in the beginning and 68.3MB in the end (delta: 3.1MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2022-07-12 09:27:29,696 INFO L158 Benchmark]: Boogie Preprocessor took 41.10ms. Allocated memory is still 98.6MB. Free memory was 68.3MB in the beginning and 66.2MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-07-12 09:27:29,696 INFO L158 Benchmark]: RCFGBuilder took 524.23ms. Allocated memory is still 98.6MB. Free memory was 66.2MB in the beginning and 44.2MB in the end (delta: 22.0MB). Peak memory consumption was 21.0MB. Max. memory is 16.1GB. [2022-07-12 09:27:29,696 INFO L158 Benchmark]: TraceAbstraction took 16604.91ms. Allocated memory was 98.6MB in the beginning and 348.1MB in the end (delta: 249.6MB). Free memory was 43.6MB in the beginning and 137.1MB in the end (delta: -93.5MB). Peak memory consumption was 157.6MB. Max. memory is 16.1GB. [2022-07-12 09:27:29,697 INFO L158 Benchmark]: Witness Printer took 94.13ms. Allocated memory is still 348.1MB. Free memory was 137.1MB in the beginning and 121.3MB in the end (delta: 15.7MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. [2022-07-12 09:27:29,698 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.22ms. Allocated memory is still 81.8MB. Free memory was 40.6MB in the beginning and 40.6MB in the end (delta: 39.8kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 327.78ms. Allocated memory is still 98.6MB. Free memory was 66.4MB in the beginning and 71.4MB in the end (delta: -5.0MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 47.74ms. Allocated memory is still 98.6MB. Free memory was 71.4MB in the beginning and 68.3MB in the end (delta: 3.1MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 41.10ms. Allocated memory is still 98.6MB. Free memory was 68.3MB in the beginning and 66.2MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 524.23ms. Allocated memory is still 98.6MB. Free memory was 66.2MB in the beginning and 44.2MB in the end (delta: 22.0MB). Peak memory consumption was 21.0MB. Max. memory is 16.1GB. * TraceAbstraction took 16604.91ms. Allocated memory was 98.6MB in the beginning and 348.1MB in the end (delta: 249.6MB). Free memory was 43.6MB in the beginning and 137.1MB in the end (delta: -93.5MB). Peak memory consumption was 157.6MB. Max. memory is 16.1GB. * Witness Printer took 94.13ms. Allocated memory is still 348.1MB. Free memory was 137.1MB in the beginning and 121.3MB in the end (delta: 15.7MB). Peak memory consumption was 14.7MB. 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: 390]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L32] int q_buf_0 ; [L33] int q_free ; [L34] int q_read_ev ; [L35] int q_write_ev ; [L36] int p_num_write ; [L37] int p_last_write ; [L38] int p_dw_st ; [L39] int p_dw_pc ; [L40] int p_dw_i ; [L41] int c_num_read ; [L42] int c_last_read ; [L43] int c_dr_st ; [L44] int c_dr_pc ; [L45] int c_dr_i ; [L152] static int a_t ; [L394] int m_pc = 0; [L395] int t1_pc = 0; [L396] int m_st ; [L397] int t1_st ; [L398] int m_i ; [L399] int t1_i ; [L400] int M_E = 2; [L401] int T1_E = 2; [L402] int E_M = 2; [L403] int E_1 = 2; [L407] int token ; [L409] 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_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_free=0, q_read_ev=0, q_write_ev=0, T1_E=2, t1_i=0, t1_pc=0, t1_st=0, token=0] [L868] COND FALSE !(__VERIFIER_nondet_int()) [L871] CALL main2() [L855] int __retres1 ; [L859] CALL init_model2() [L770] m_i = 1 [L771] t1_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_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_free=0, q_read_ev=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, token=0] [L859] RET init_model2() [L860] CALL start_simulation2() [L796] int kernel_st ; [L797] int tmp ; [L798] int tmp___0 ; [L802] 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_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_free=0, q_read_ev=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, token=0] [L803] 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_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_free=0, q_read_ev=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, token=0] [L804] CALL init_threads2() [L552] COND TRUE m_i == 1 [L553] 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_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_free=0, q_read_ev=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, token=0] [L557] COND TRUE t1_i == 1 [L558] 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_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_free=0, q_read_ev=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, token=0] [L804] RET init_threads2() [L805] CALL fire_delta_events2() VAL [\old(E_1)=2, \old(E_M)=2, \old(M_E)=2, \old(T1_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_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_free=0, q_read_ev=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, token=0] [L641] COND FALSE !(M_E == 0) VAL [\old(E_1)=2, \old(E_M)=2, \old(M_E)=2, \old(T1_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_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_free=0, q_read_ev=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, token=0] [L646] COND FALSE !(T1_E == 0) VAL [\old(E_1)=2, \old(E_M)=2, \old(M_E)=2, \old(T1_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_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_free=0, q_read_ev=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, token=0] [L651] COND FALSE !(E_M == 0) VAL [\old(E_1)=2, \old(E_M)=2, \old(M_E)=2, \old(T1_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_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_free=0, q_read_ev=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, token=0] [L656] COND FALSE !(E_1 == 0) VAL [\old(E_1)=2, \old(E_M)=2, \old(M_E)=2, \old(T1_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_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_free=0, q_read_ev=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, token=0] [L805] 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_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_free=0, q_read_ev=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, token=0] [L806] CALL activate_threads2() VAL [\old(m_st)=0, \old(t1_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_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_free=0, q_read_ev=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, token=0] [L694] int tmp ; [L695] int tmp___0 ; [L699] CALL, EXPR is_master_triggered() [L503] int __retres1 ; VAL [\old(m_st)=0, \old(t1_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_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_free=0, q_read_ev=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, token=0] [L506] COND FALSE !(m_pc == 1) VAL [\old(m_st)=0, \old(t1_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_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_free=0, q_read_ev=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, token=0] [L516] __retres1 = 0 VAL [\old(m_st)=0, \old(t1_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_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_free=0, q_read_ev=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, token=0] [L518] return (__retres1); VAL [\old(m_st)=0, \old(t1_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_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_free=0, q_read_ev=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, token=0] [L699] RET, EXPR is_master_triggered() [L699] tmp = is_master_triggered() [L701] COND FALSE !(\read(tmp)) VAL [\old(m_st)=0, \old(t1_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_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_free=0, q_read_ev=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, tmp=0, token=0] [L707] CALL, EXPR is_transmit1_triggered() [L522] int __retres1 ; VAL [\old(m_st)=0, \old(t1_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_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_free=0, q_read_ev=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, token=0] [L525] COND FALSE !(t1_pc == 1) VAL [\old(m_st)=0, \old(t1_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_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_free=0, q_read_ev=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, token=0] [L535] __retres1 = 0 VAL [\old(m_st)=0, \old(t1_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_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_free=0, q_read_ev=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, token=0] [L537] return (__retres1); VAL [\old(m_st)=0, \old(t1_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_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_free=0, q_read_ev=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, token=0] [L707] RET, EXPR is_transmit1_triggered() [L707] tmp___0 = is_transmit1_triggered() [L709] COND FALSE !(\read(tmp___0)) VAL [\old(m_st)=0, \old(t1_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_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_free=0, q_read_ev=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, tmp=0, tmp___0=0, token=0] [L806] 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_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_free=0, q_read_ev=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, token=0] [L807] CALL reset_delta_events2() VAL [\old(E_1)=2, \old(E_M)=2, \old(M_E)=2, \old(T1_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_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_free=0, q_read_ev=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, token=0] [L669] COND FALSE !(M_E == 1) VAL [\old(E_1)=2, \old(E_M)=2, \old(M_E)=2, \old(T1_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_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_free=0, q_read_ev=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, token=0] [L674] COND FALSE !(T1_E == 1) VAL [\old(E_1)=2, \old(E_M)=2, \old(M_E)=2, \old(T1_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_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_free=0, q_read_ev=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, token=0] [L679] COND FALSE !(E_M == 1) VAL [\old(E_1)=2, \old(E_M)=2, \old(M_E)=2, \old(T1_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_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_free=0, q_read_ev=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, token=0] [L684] COND FALSE !(E_1 == 1) VAL [\old(E_1)=2, \old(E_M)=2, \old(M_E)=2, \old(T1_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_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_free=0, q_read_ev=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, token=0] [L807] 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_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_free=0, q_read_ev=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, token=0] [L810] 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_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_free=0, q_read_ev=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, token=0] [L813] kernel_st = 1 [L814] CALL eval2() [L588] 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_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_free=0, q_read_ev=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, token=0] [L592] 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_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_free=0, q_read_ev=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, token=0] [L595] 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_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_free=0, q_read_ev=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, token=0] [L567] 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_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_free=0, q_read_ev=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, token=0] [L570] COND TRUE m_st == 0 [L571] __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_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_free=0, q_read_ev=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, token=0] [L583] 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_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_free=0, q_read_ev=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, token=0] [L595] 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_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_free=0, q_read_ev=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, token=0] [L595] tmp = exists_runnable_thread2() [L597] 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_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_free=0, q_read_ev=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, tmp=1, token=0] [L602] COND TRUE m_st == 0 [L603] int tmp_ndt_1; [L604] tmp_ndt_1 = __VERIFIER_nondet_int() [L605] 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_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_free=0, q_read_ev=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, tmp=1, tmp_ndt_1=0, token=0] [L616] COND TRUE t1_st == 0 [L617] int tmp_ndt_2; [L618] tmp_ndt_2 = __VERIFIER_nondet_int() [L619] COND TRUE \read(tmp_ndt_2) [L621] t1_st = 1 [L622] CALL transmit1() [L470] 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_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_free=0, q_read_ev=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=1, token=0] [L481] 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_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_free=0, q_read_ev=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=1, token=0] [L483] t1_pc = 1 [L484] 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_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_free=0, q_read_ev=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, token=0] [L622] RET transmit1() [L592] 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_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_free=0, q_read_ev=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, tmp=1, tmp_ndt_1=0, tmp_ndt_2=1, token=0] [L595] 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_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_free=0, q_read_ev=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, token=0] [L567] 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_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_free=0, q_read_ev=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, token=0] [L570] COND TRUE m_st == 0 [L571] __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_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_free=0, q_read_ev=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, token=0] [L583] 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_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_free=0, q_read_ev=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, token=0] [L595] 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_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_free=0, q_read_ev=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, tmp=1, tmp_ndt_1=0, tmp_ndt_2=1, token=0] [L595] tmp = exists_runnable_thread2() [L597] 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_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_free=0, q_read_ev=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, tmp=1, tmp_ndt_1=0, tmp_ndt_2=1, token=0] [L602] COND TRUE m_st == 0 [L603] int tmp_ndt_1; [L604] tmp_ndt_1 = __VERIFIER_nondet_int() [L605] COND TRUE \read(tmp_ndt_1) [L607] m_st = 1 [L608] CALL master() [L412] int tmp_var = __VERIFIER_nondet_int(); [L414] 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_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_free=0, q_read_ev=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, tmp_var=0, token=0] [L425] 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_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_free=0, q_read_ev=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, tmp_var=0, token=0] [L428] token = __VERIFIER_nondet_int() [L429] local = token [L430] 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_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_free=0, q_read_ev=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, tmp_var=0, token=0] [L431] CALL immediate_notify() VAL [\old(m_st)=1, \old(t1_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_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_free=0, q_read_ev=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, token=0] [L723] CALL activate_threads2() VAL [\old(m_st)=1, \old(t1_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_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_free=0, q_read_ev=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, token=0] [L694] int tmp ; [L695] int tmp___0 ; [L699] CALL, EXPR is_master_triggered() [L503] int __retres1 ; VAL [\old(m_st)=1, \old(t1_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_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_free=0, q_read_ev=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, token=0] [L506] COND FALSE !(m_pc == 1) VAL [\old(m_st)=1, \old(t1_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_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_free=0, q_read_ev=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, token=0] [L516] __retres1 = 0 VAL [\old(m_st)=1, \old(t1_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_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_free=0, q_read_ev=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, token=0] [L518] return (__retres1); VAL [\old(m_st)=1, \old(t1_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_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_free=0, q_read_ev=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, token=0] [L699] RET, EXPR is_master_triggered() [L699] tmp = is_master_triggered() [L701] COND FALSE !(\read(tmp)) VAL [\old(m_st)=1, \old(t1_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_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_free=0, q_read_ev=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, tmp=0, token=0] [L707] CALL, EXPR is_transmit1_triggered() [L522] int __retres1 ; VAL [\old(m_st)=1, \old(t1_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_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_free=0, q_read_ev=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, token=0] [L525] COND TRUE t1_pc == 1 VAL [\old(m_st)=1, \old(t1_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_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_free=0, q_read_ev=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, token=0] [L526] COND TRUE E_1 == 1 [L527] __retres1 = 1 VAL [\old(m_st)=1, \old(t1_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_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_free=0, q_read_ev=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, token=0] [L537] return (__retres1); VAL [\old(m_st)=1, \old(t1_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_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_free=0, q_read_ev=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, token=0] [L707] RET, EXPR is_transmit1_triggered() [L707] tmp___0 = is_transmit1_triggered() [L709] COND TRUE \read(tmp___0) [L710] t1_st = 0 VAL [\old(m_st)=1, \old(t1_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_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_free=0, q_read_ev=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=0, tmp=0, tmp___0=1, token=0] [L723] RET activate_threads2() VAL [\old(m_st)=1, \old(t1_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_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_free=0, q_read_ev=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=0, token=0] [L431] 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_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_free=0, q_read_ev=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=0, tmp_var=0, token=0] [L432] E_1 = 2 [L433] m_pc = 1 [L434] 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_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_free=0, q_read_ev=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=0, tmp_var=0, token=0] [L608] RET master() [L616] COND TRUE t1_st == 0 [L617] int tmp_ndt_2; [L618] tmp_ndt_2 = __VERIFIER_nondet_int() [L619] COND TRUE \read(tmp_ndt_2) [L621] t1_st = 1 [L622] CALL transmit1() [L470] 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_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_free=0, q_read_ev=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, token=0] [L473] 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_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_free=0, q_read_ev=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, token=0] [L489] token += 1 [L490] 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_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_free=0, q_read_ev=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, token=1] [L491] CALL immediate_notify() VAL [\old(m_st)=2, \old(t1_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_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_free=0, q_read_ev=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, token=1] [L723] CALL activate_threads2() VAL [\old(m_st)=2, \old(t1_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_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_free=0, q_read_ev=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, token=1] [L694] int tmp ; [L695] int tmp___0 ; [L699] CALL, EXPR is_master_triggered() [L503] int __retres1 ; VAL [\old(m_st)=2, \old(t1_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_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_free=0, q_read_ev=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, token=1] [L506] COND TRUE m_pc == 1 VAL [\old(m_st)=2, \old(t1_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_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_free=0, q_read_ev=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, token=1] [L507] COND TRUE E_M == 1 [L508] __retres1 = 1 VAL [\old(m_st)=2, \old(t1_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_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_free=0, q_read_ev=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, token=1] [L518] return (__retres1); VAL [\old(m_st)=2, \old(t1_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_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_free=0, q_read_ev=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, token=1] [L699] RET, EXPR is_master_triggered() [L699] tmp = is_master_triggered() [L701] COND TRUE \read(tmp) [L702] m_st = 0 VAL [\old(m_st)=2, \old(t1_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_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_free=0, q_read_ev=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, tmp=1, token=1] [L707] CALL, EXPR is_transmit1_triggered() [L522] int __retres1 ; VAL [\old(m_st)=2, \old(t1_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_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_free=0, q_read_ev=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, token=1] [L525] COND TRUE t1_pc == 1 VAL [\old(m_st)=2, \old(t1_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_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_free=0, q_read_ev=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, token=1] [L526] COND FALSE !(E_1 == 1) VAL [\old(m_st)=2, \old(t1_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_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_free=0, q_read_ev=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, token=1] [L535] __retres1 = 0 VAL [\old(m_st)=2, \old(t1_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_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_free=0, q_read_ev=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, token=1] [L537] return (__retres1); VAL [\old(m_st)=2, \old(t1_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_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_free=0, q_read_ev=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, token=1] [L707] RET, EXPR is_transmit1_triggered() [L707] tmp___0 = is_transmit1_triggered() [L709] COND FALSE !(\read(tmp___0)) VAL [\old(m_st)=2, \old(t1_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_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_free=0, q_read_ev=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, tmp=1, tmp___0=0, token=1] [L723] RET activate_threads2() VAL [\old(m_st)=2, \old(t1_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_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_free=0, q_read_ev=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, token=1] [L491] 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_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_free=0, q_read_ev=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, token=1] [L492] 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_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_free=0, q_read_ev=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, token=1] [L481] 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_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_free=0, q_read_ev=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, token=1] [L483] t1_pc = 1 [L484] 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_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_free=0, q_read_ev=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, token=1] [L622] RET transmit1() [L592] 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_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_free=0, q_read_ev=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, tmp=1, tmp_ndt_1=-1, tmp_ndt_2=1, token=1] [L595] 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_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_free=0, q_read_ev=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, token=1] [L567] 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_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_free=0, q_read_ev=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, token=1] [L570] COND TRUE m_st == 0 [L571] __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_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_free=0, q_read_ev=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, token=1] [L583] 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_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_free=0, q_read_ev=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, token=1] [L595] 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_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_free=0, q_read_ev=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, tmp=1, tmp_ndt_1=-1, tmp_ndt_2=1, token=1] [L595] tmp = exists_runnable_thread2() [L597] 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_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_free=0, q_read_ev=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, tmp=1, tmp_ndt_1=-1, tmp_ndt_2=1, token=1] [L602] COND TRUE m_st == 0 [L603] int tmp_ndt_1; [L604] tmp_ndt_1 = __VERIFIER_nondet_int() [L605] COND TRUE \read(tmp_ndt_1) [L607] m_st = 1 [L608] CALL master() [L412] int tmp_var = __VERIFIER_nondet_int(); [L414] 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_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_free=0, q_read_ev=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, tmp_var=5, token=1] [L417] 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_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_free=0, q_read_ev=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, tmp_var=5, token=1] [L439] COND FALSE !(token != local + 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_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_free=0, q_read_ev=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, tmp_var=5, token=1] [L444] 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_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_free=0, q_read_ev=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, tmp_var=5, token=1] [L445] 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_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_free=0, q_read_ev=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, tmp_var=5, token=1] [L450] 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_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_free=0, q_read_ev=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, tmp_var=5, token=1] [L451] 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_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_free=0, q_read_ev=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, tmp_var=5, token=1] [L452] 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_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_free=0, q_read_ev=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, tmp_var=5, token=1] [L453] 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_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_free=0, q_read_ev=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, token=1] [L390] 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_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_free=0, q_read_ev=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, token=1] - UnprovableResult [Line: 27]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data CFG has 11 procedures, 187 locations, 2 error locations. Started 1 CEGAR loops. OverallTime: 16.4s, OverallIterations: 26, TraceHistogramMax: 3, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.1s, AutomataDifference: 7.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 6583 SdHoareTripleChecker+Valid, 3.9s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 6385 mSDsluCounter, 14719 SdHoareTripleChecker+Invalid, 3.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 8455 mSDsCounter, 905 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 4775 IncrementalHoareTripleChecker+Invalid, 5680 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 905 mSolverCounterUnsat, 6264 mSDtfsCounter, 4775 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 2206 GetRequests, 1995 SyntacticMatches, 5 SemanticMatches, 206 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 598 ImplicationChecksByTransitivity, 1.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1962occurred in iteration=17, InterpolantAutomatonStates: 188, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 2.0s AutomataMinimizationTime, 25 MinimizatonAttempts, 3176 StatesRemovedByMinimization, 23 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.3s SsaConstructionTime, 0.7s SatisfiabilityAnalysisTime, 2.6s InterpolantComputationTime, 3963 NumberOfCodeBlocks, 3963 NumberOfCodeBlocksAsserted, 39 NumberOfCheckSat, 3918 ConstructedInterpolants, 0 QuantifiedInterpolants, 6629 SizeOfPredicates, 10 NumberOfNonLiveVariables, 5146 ConjunctsInSsa, 61 ConjunctsInUnsatCore, 40 InterpolantComputations, 24 PerfectInterpolantSequences, 1572/1814 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-12 09:27:29,741 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