./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/combinations/Problem05_label45+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/Problem05_label45+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 7adc5be84218941c02109a6f05aa2044beb278121fd387aba807705fdb759027 --- Real Ultimate output --- This is Ultimate 0.2.2-?-6c24879 [2022-07-12 08:19:03,577 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-07-12 08:19:03,580 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-07-12 08:19:03,622 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-07-12 08:19:03,623 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-07-12 08:19:03,624 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-07-12 08:19:03,626 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-07-12 08:19:03,628 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-07-12 08:19:03,630 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-07-12 08:19:03,634 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-07-12 08:19:03,635 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-07-12 08:19:03,637 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-07-12 08:19:03,637 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-07-12 08:19:03,639 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-07-12 08:19:03,639 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-07-12 08:19:03,642 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-07-12 08:19:03,643 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-07-12 08:19:03,644 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-07-12 08:19:03,645 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-07-12 08:19:03,650 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-07-12 08:19:03,652 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-07-12 08:19:03,653 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-07-12 08:19:03,654 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-07-12 08:19:03,655 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-07-12 08:19:03,656 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-07-12 08:19:03,662 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-07-12 08:19:03,662 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-07-12 08:19:03,662 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-07-12 08:19:03,664 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-07-12 08:19:03,664 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-07-12 08:19:03,665 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-07-12 08:19:03,665 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-07-12 08:19:03,667 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-07-12 08:19:03,668 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-07-12 08:19:03,668 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-07-12 08:19:03,669 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-07-12 08:19:03,669 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-07-12 08:19:03,670 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-07-12 08:19:03,670 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-07-12 08:19:03,670 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-07-12 08:19:03,671 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-07-12 08:19:03,673 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-07-12 08:19:03,674 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2022-07-12 08:19:03,707 INFO L113 SettingsManager]: Loading preferences was successful [2022-07-12 08:19:03,708 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-07-12 08:19:03,708 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-07-12 08:19:03,709 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-07-12 08:19:03,709 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-07-12 08:19:03,710 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-07-12 08:19:03,711 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-07-12 08:19:03,711 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-07-12 08:19:03,712 INFO L138 SettingsManager]: * Use SBE=true [2022-07-12 08:19:03,712 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-07-12 08:19:03,713 INFO L138 SettingsManager]: * sizeof long=4 [2022-07-12 08:19:03,713 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-07-12 08:19:03,713 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-07-12 08:19:03,713 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-07-12 08:19:03,713 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-07-12 08:19:03,714 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-07-12 08:19:03,714 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-07-12 08:19:03,714 INFO L138 SettingsManager]: * sizeof long double=12 [2022-07-12 08:19:03,714 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-07-12 08:19:03,714 INFO L138 SettingsManager]: * Use constant arrays=true [2022-07-12 08:19:03,715 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-07-12 08:19:03,715 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-07-12 08:19:03,715 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-07-12 08:19:03,715 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-07-12 08:19:03,715 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-12 08:19:03,716 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-07-12 08:19:03,716 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-07-12 08:19:03,716 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-07-12 08:19:03,716 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-07-12 08:19:03,717 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-07-12 08:19:03,717 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-07-12 08:19:03,717 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-07-12 08:19:03,717 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-07-12 08:19:03,718 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 -> 7adc5be84218941c02109a6f05aa2044beb278121fd387aba807705fdb759027 [2022-07-12 08:19:03,978 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-07-12 08:19:04,001 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-07-12 08:19:04,004 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-07-12 08:19:04,005 INFO L271 PluginConnector]: Initializing CDTParser... [2022-07-12 08:19:04,006 INFO L275 PluginConnector]: CDTParser initialized [2022-07-12 08:19:04,007 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/combinations/Problem05_label45+token_ring.01.cil-2.c [2022-07-12 08:19:04,066 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ef317fdf4/9ac4a66e5c8a428baffdf05eed965efb/FLAG846bfbdfb [2022-07-12 08:19:04,961 INFO L306 CDTParser]: Found 1 translation units. [2022-07-12 08:19:04,962 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/combinations/Problem05_label45+token_ring.01.cil-2.c [2022-07-12 08:19:05,020 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ef317fdf4/9ac4a66e5c8a428baffdf05eed965efb/FLAG846bfbdfb [2022-07-12 08:19:05,085 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ef317fdf4/9ac4a66e5c8a428baffdf05eed965efb [2022-07-12 08:19:05,088 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-07-12 08:19:05,089 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-07-12 08:19:05,092 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-07-12 08:19:05,092 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-07-12 08:19:05,095 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-07-12 08:19:05,096 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.07 08:19:05" (1/1) ... [2022-07-12 08:19:05,096 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7e00f66c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 08:19:05, skipping insertion in model container [2022-07-12 08:19:05,097 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.07 08:19:05" (1/1) ... [2022-07-12 08:19:05,103 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-07-12 08:19:05,289 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-07-12 08:19:06,949 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/Problem05_label45+token_ring.01.cil-2.c[380323,380336] [2022-07-12 08:19:06,973 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/Problem05_label45+token_ring.01.cil-2.c[383339,383352] [2022-07-12 08:19:07,118 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-12 08:19:07,128 INFO L203 MainTranslator]: Completed pre-run [2022-07-12 08:19:07,868 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/Problem05_label45+token_ring.01.cil-2.c[380323,380336] [2022-07-12 08:19:07,874 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/Problem05_label45+token_ring.01.cil-2.c[383339,383352] [2022-07-12 08:19:07,891 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-12 08:19:07,943 INFO L208 MainTranslator]: Completed translation [2022-07-12 08:19:07,944 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 08:19:07 WrapperNode [2022-07-12 08:19:07,944 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-07-12 08:19:07,945 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-07-12 08:19:07,945 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-07-12 08:19:07,945 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-07-12 08:19:07,951 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 08:19:07" (1/1) ... [2022-07-12 08:19:08,061 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 08:19:07" (1/1) ... [2022-07-12 08:19:08,388 INFO L137 Inliner]: procedures = 46, calls = 45, calls flagged for inlining = 23, calls inlined = 23, statements flattened = 12566 [2022-07-12 08:19:08,388 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-07-12 08:19:08,389 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-07-12 08:19:08,389 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-07-12 08:19:08,390 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-07-12 08:19:08,397 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 08:19:07" (1/1) ... [2022-07-12 08:19:08,398 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 08:19:07" (1/1) ... [2022-07-12 08:19:08,439 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 08:19:07" (1/1) ... [2022-07-12 08:19:08,440 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 08:19:07" (1/1) ... [2022-07-12 08:19:08,641 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 08:19:07" (1/1) ... [2022-07-12 08:19:08,683 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 08:19:07" (1/1) ... [2022-07-12 08:19:08,710 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 08:19:07" (1/1) ... [2022-07-12 08:19:08,761 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-07-12 08:19:08,763 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-07-12 08:19:08,763 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-07-12 08:19:08,763 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-07-12 08:19:08,765 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 08:19:07" (1/1) ... [2022-07-12 08:19:08,772 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-12 08:19:08,782 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-12 08:19:08,796 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 08:19:08,825 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 08:19:08,841 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-07-12 08:19:08,842 INFO L130 BoogieDeclarations]: Found specification of procedure error [2022-07-12 08:19:08,842 INFO L138 BoogieDeclarations]: Found implementation of procedure error [2022-07-12 08:19:08,842 INFO L130 BoogieDeclarations]: Found specification of procedure fire_delta_events [2022-07-12 08:19:08,842 INFO L138 BoogieDeclarations]: Found implementation of procedure fire_delta_events [2022-07-12 08:19:08,842 INFO L130 BoogieDeclarations]: Found specification of procedure activate_threads [2022-07-12 08:19:08,842 INFO L138 BoogieDeclarations]: Found implementation of procedure activate_threads [2022-07-12 08:19:08,842 INFO L130 BoogieDeclarations]: Found specification of procedure immediate_notify [2022-07-12 08:19:08,843 INFO L138 BoogieDeclarations]: Found implementation of procedure immediate_notify [2022-07-12 08:19:08,843 INFO L130 BoogieDeclarations]: Found specification of procedure exists_runnable_thread [2022-07-12 08:19:08,843 INFO L138 BoogieDeclarations]: Found implementation of procedure exists_runnable_thread [2022-07-12 08:19:08,843 INFO L130 BoogieDeclarations]: Found specification of procedure reset_delta_events [2022-07-12 08:19:08,843 INFO L138 BoogieDeclarations]: Found implementation of procedure reset_delta_events [2022-07-12 08:19:08,843 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-07-12 08:19:08,843 INFO L130 BoogieDeclarations]: Found specification of procedure update_channels [2022-07-12 08:19:08,844 INFO L138 BoogieDeclarations]: Found implementation of procedure update_channels [2022-07-12 08:19:08,844 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-07-12 08:19:08,844 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-07-12 08:19:08,979 INFO L234 CfgBuilder]: Building ICFG [2022-07-12 08:19:08,981 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-07-12 08:19:14,674 INFO L275 CfgBuilder]: Performing block encoding [2022-07-12 08:19:14,696 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-07-12 08:19:14,697 INFO L299 CfgBuilder]: Removed 5 assume(true) statements. [2022-07-12 08:19:14,700 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.07 08:19:14 BoogieIcfgContainer [2022-07-12 08:19:14,700 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-07-12 08:19:14,702 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-07-12 08:19:14,702 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-07-12 08:19:14,705 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-07-12 08:19:14,705 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 12.07 08:19:05" (1/3) ... [2022-07-12 08:19:14,706 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5182cfd0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.07 08:19:14, skipping insertion in model container [2022-07-12 08:19:14,706 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 08:19:07" (2/3) ... [2022-07-12 08:19:14,706 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5182cfd0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.07 08:19:14, skipping insertion in model container [2022-07-12 08:19:14,706 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.07 08:19:14" (3/3) ... [2022-07-12 08:19:14,707 INFO L111 eAbstractionObserver]: Analyzing ICFG Problem05_label45+token_ring.01.cil-2.c [2022-07-12 08:19:14,719 INFO L201 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-07-12 08:19:14,719 INFO L160 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2022-07-12 08:19:14,789 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-07-12 08:19:14,794 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@5d33f2c8, mLbeIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@482fbde2 [2022-07-12 08:19:14,794 INFO L358 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2022-07-12 08:19:14,804 INFO L276 IsEmpty]: Start isEmpty. Operand has 2298 states, 2271 states have (on average 1.8590929106120653) internal successors, (4222), 2276 states have internal predecessors, (4222), 17 states have call successors, (17), 7 states have call predecessors, (17), 7 states have return successors, (17), 16 states have call predecessors, (17), 17 states have call successors, (17) [2022-07-12 08:19:14,814 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2022-07-12 08:19:14,814 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 08:19:14,815 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 08:19:14,815 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 08:19:14,819 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 08:19:14,820 INFO L85 PathProgramCache]: Analyzing trace with hash 1417964819, now seen corresponding path program 1 times [2022-07-12 08:19:14,827 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 08:19:14,827 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [680766243] [2022-07-12 08:19:14,827 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 08:19:14,828 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 08:19:14,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 08:19:15,010 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-07-12 08:19:15,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 08:19:15,030 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-12 08:19:15,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 08:19:15,079 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-07-12 08:19:15,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 08:19:15,109 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-07-12 08:19:15,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 08:19:15,123 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2022-07-12 08:19:15,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 08:19:15,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 08:19:15,132 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 08:19:15,132 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [680766243] [2022-07-12 08:19:15,133 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [680766243] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 08:19:15,133 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 08:19:15,133 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-12 08:19:15,134 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [349973807] [2022-07-12 08:19:15,135 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 08:19:15,140 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-12 08:19:15,140 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 08:19:15,165 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-12 08:19:15,166 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-12 08:19:15,172 INFO L87 Difference]: Start difference. First operand has 2298 states, 2271 states have (on average 1.8590929106120653) internal successors, (4222), 2276 states have internal predecessors, (4222), 17 states have call successors, (17), 7 states have call predecessors, (17), 7 states have return successors, (17), 16 states have call predecessors, (17), 17 states have call successors, (17) 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 08:19:15,851 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 08:19:15,851 INFO L93 Difference]: Finished difference Result 4727 states and 8720 transitions. [2022-07-12 08:19:15,855 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-07-12 08:19:15,857 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 08:19:15,857 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 08:19:15,878 INFO L225 Difference]: With dead ends: 4727 [2022-07-12 08:19:15,878 INFO L226 Difference]: Without dead ends: 2368 [2022-07-12 08:19:15,886 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 08:19:15,888 INFO L413 NwaCegarLoop]: 4199 mSDtfsCounter, 4329 mSDsluCounter, 12380 mSDsCounter, 0 mSdLazyCounter, 414 mSolverCounterSat, 80 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4337 SdHoareTripleChecker+Valid, 16579 SdHoareTripleChecker+Invalid, 494 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 80 IncrementalHoareTripleChecker+Valid, 414 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-07-12 08:19:15,889 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [4337 Valid, 16579 Invalid, 494 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [80 Valid, 414 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-07-12 08:19:15,907 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2368 states. [2022-07-12 08:19:15,977 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2368 to 2325. [2022-07-12 08:19:15,984 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2325 states, 2283 states have (on average 1.838370565045992) internal successors, (4197), 2287 states have internal predecessors, (4197), 27 states have call successors, (27), 13 states have call predecessors, (27), 13 states have return successors, (28), 25 states have call predecessors, (28), 25 states have call successors, (28) [2022-07-12 08:19:15,993 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2325 states to 2325 states and 4252 transitions. [2022-07-12 08:19:15,994 INFO L78 Accepts]: Start accepts. Automaton has 2325 states and 4252 transitions. Word has length 58 [2022-07-12 08:19:15,995 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 08:19:15,995 INFO L495 AbstractCegarLoop]: Abstraction has 2325 states and 4252 transitions. [2022-07-12 08:19:15,995 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 08:19:15,995 INFO L276 IsEmpty]: Start isEmpty. Operand 2325 states and 4252 transitions. [2022-07-12 08:19:15,998 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2022-07-12 08:19:15,998 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 08:19:15,998 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 08:19:15,998 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-07-12 08:19:15,999 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 08:19:15,999 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 08:19:16,000 INFO L85 PathProgramCache]: Analyzing trace with hash -1082743281, now seen corresponding path program 1 times [2022-07-12 08:19:16,000 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 08:19:16,000 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [861697640] [2022-07-12 08:19:16,000 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 08:19:16,001 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 08:19:16,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 08:19:16,094 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-07-12 08:19:16,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 08:19:16,118 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-12 08:19:16,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 08:19:16,155 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-07-12 08:19:16,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 08:19:16,165 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-07-12 08:19:16,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 08:19:16,170 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2022-07-12 08:19:16,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 08:19:16,173 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 08:19:16,173 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 08:19:16,174 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [861697640] [2022-07-12 08:19:16,174 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [861697640] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 08:19:16,174 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 08:19:16,174 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-07-12 08:19:16,175 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1591981736] [2022-07-12 08:19:16,175 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 08:19:16,176 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-07-12 08:19:16,176 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 08:19:16,177 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-07-12 08:19:16,177 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-07-12 08:19:16,177 INFO L87 Difference]: Start difference. First operand 2325 states and 4252 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 08:19:16,814 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 08:19:16,814 INFO L93 Difference]: Finished difference Result 2676 states and 4760 transitions. [2022-07-12 08:19:16,814 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-07-12 08:19:16,815 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 08:19:16,815 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 08:19:16,831 INFO L225 Difference]: With dead ends: 2676 [2022-07-12 08:19:16,832 INFO L226 Difference]: Without dead ends: 2481 [2022-07-12 08:19:16,835 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 08:19:16,837 INFO L413 NwaCegarLoop]: 4200 mSDtfsCounter, 4245 mSDsluCounter, 16382 mSDsCounter, 0 mSdLazyCounter, 649 mSolverCounterSat, 57 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4253 SdHoareTripleChecker+Valid, 20582 SdHoareTripleChecker+Invalid, 706 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 57 IncrementalHoareTripleChecker+Valid, 649 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-07-12 08:19:16,837 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [4253 Valid, 20582 Invalid, 706 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [57 Valid, 649 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-07-12 08:19:16,841 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2481 states. [2022-07-12 08:19:16,884 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2481 to 2415. [2022-07-12 08:19:16,889 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2415 states, 2356 states have (on average 1.8259762308998302) internal successors, (4302), 2361 states have internal predecessors, (4302), 37 states have call successors, (37), 19 states have call predecessors, (37), 20 states have return successors, (40), 36 states have call predecessors, (40), 35 states have call successors, (40) [2022-07-12 08:19:16,898 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2415 states to 2415 states and 4379 transitions. [2022-07-12 08:19:16,898 INFO L78 Accepts]: Start accepts. Automaton has 2415 states and 4379 transitions. Word has length 58 [2022-07-12 08:19:16,899 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 08:19:16,899 INFO L495 AbstractCegarLoop]: Abstraction has 2415 states and 4379 transitions. [2022-07-12 08:19:16,899 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 08:19:16,900 INFO L276 IsEmpty]: Start isEmpty. Operand 2415 states and 4379 transitions. [2022-07-12 08:19:16,901 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2022-07-12 08:19:16,901 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 08:19:16,901 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 08:19:16,902 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-07-12 08:19:16,902 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 08:19:16,902 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 08:19:16,903 INFO L85 PathProgramCache]: Analyzing trace with hash -189256943, now seen corresponding path program 1 times [2022-07-12 08:19:16,903 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 08:19:16,903 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2018272539] [2022-07-12 08:19:16,903 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 08:19:16,904 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 08:19:16,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 08:19:16,929 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-07-12 08:19:16,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 08:19:16,938 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-12 08:19:16,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 08:19:16,965 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-07-12 08:19:16,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 08:19:16,973 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-07-12 08:19:16,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 08:19:16,977 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2022-07-12 08:19:16,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 08:19:16,980 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 08:19:16,980 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 08:19:16,980 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2018272539] [2022-07-12 08:19:16,980 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2018272539] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 08:19:16,980 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 08:19:16,981 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-07-12 08:19:16,981 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1163154899] [2022-07-12 08:19:16,981 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 08:19:16,982 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-07-12 08:19:16,982 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 08:19:16,982 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-07-12 08:19:16,983 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-07-12 08:19:16,983 INFO L87 Difference]: Start difference. First operand 2415 states and 4379 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 08:19:17,659 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 08:19:17,659 INFO L93 Difference]: Finished difference Result 3027 states and 5257 transitions. [2022-07-12 08:19:17,660 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-07-12 08:19:17,660 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 08:19:17,660 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 08:19:17,672 INFO L225 Difference]: With dead ends: 3027 [2022-07-12 08:19:17,672 INFO L226 Difference]: Without dead ends: 2742 [2022-07-12 08:19:17,674 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 46 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=73, Invalid=199, Unknown=0, NotChecked=0, Total=272 [2022-07-12 08:19:17,675 INFO L413 NwaCegarLoop]: 4190 mSDtfsCounter, 4299 mSDsluCounter, 16374 mSDsCounter, 0 mSdLazyCounter, 644 mSolverCounterSat, 65 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4309 SdHoareTripleChecker+Valid, 20564 SdHoareTripleChecker+Invalid, 709 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 65 IncrementalHoareTripleChecker+Valid, 644 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-07-12 08:19:17,676 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [4309 Valid, 20564 Invalid, 709 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [65 Valid, 644 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-07-12 08:19:17,679 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2742 states. [2022-07-12 08:19:17,728 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2742 to 2590. [2022-07-12 08:19:17,734 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2590 states, 2499 states have (on average 1.8043217286914766) internal successors, (4509), 2506 states have internal predecessors, (4509), 55 states have call successors, (55), 31 states have call predecessors, (55), 34 states have return successors, (66), 56 states have call predecessors, (66), 53 states have call successors, (66) [2022-07-12 08:19:17,743 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2590 states to 2590 states and 4630 transitions. [2022-07-12 08:19:17,744 INFO L78 Accepts]: Start accepts. Automaton has 2590 states and 4630 transitions. Word has length 58 [2022-07-12 08:19:17,744 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 08:19:17,744 INFO L495 AbstractCegarLoop]: Abstraction has 2590 states and 4630 transitions. [2022-07-12 08:19:17,745 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 08:19:17,745 INFO L276 IsEmpty]: Start isEmpty. Operand 2590 states and 4630 transitions. [2022-07-12 08:19:17,746 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2022-07-12 08:19:17,747 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 08:19:17,747 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 08:19:17,747 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-07-12 08:19:17,747 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 08:19:17,748 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 08:19:17,748 INFO L85 PathProgramCache]: Analyzing trace with hash 2056322511, now seen corresponding path program 1 times [2022-07-12 08:19:17,748 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 08:19:17,748 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1109071137] [2022-07-12 08:19:17,748 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 08:19:17,749 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 08:19:17,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 08:19:17,769 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-07-12 08:19:17,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 08:19:17,777 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-12 08:19:17,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 08:19:17,803 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-07-12 08:19:17,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 08:19:17,813 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-07-12 08:19:17,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 08:19:17,819 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2022-07-12 08:19:17,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 08:19:17,825 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 08:19:17,827 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 08:19:17,827 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1109071137] [2022-07-12 08:19:17,828 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1109071137] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 08:19:17,828 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 08:19:17,828 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-07-12 08:19:17,828 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1307954822] [2022-07-12 08:19:17,828 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 08:19:17,829 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-07-12 08:19:17,829 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 08:19:17,830 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-07-12 08:19:17,830 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-07-12 08:19:17,830 INFO L87 Difference]: Start difference. First operand 2590 states and 4630 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 08:19:18,522 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 08:19:18,522 INFO L93 Difference]: Finished difference Result 3579 states and 6048 transitions. [2022-07-12 08:19:18,523 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-07-12 08:19:18,523 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 08:19:18,523 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 08:19:18,538 INFO L225 Difference]: With dead ends: 3579 [2022-07-12 08:19:18,538 INFO L226 Difference]: Without dead ends: 3119 [2022-07-12 08:19:18,541 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 43 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=73, Invalid=199, Unknown=0, NotChecked=0, Total=272 [2022-07-12 08:19:18,542 INFO L413 NwaCegarLoop]: 4191 mSDtfsCounter, 4242 mSDsluCounter, 16356 mSDsCounter, 0 mSdLazyCounter, 681 mSolverCounterSat, 65 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4249 SdHoareTripleChecker+Valid, 20547 SdHoareTripleChecker+Invalid, 746 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 65 IncrementalHoareTripleChecker+Valid, 681 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-07-12 08:19:18,542 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [4249 Valid, 20547 Invalid, 746 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [65 Valid, 681 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-07-12 08:19:18,546 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3119 states. [2022-07-12 08:19:18,609 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3119 to 2889. [2022-07-12 08:19:18,614 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2889 states, 2740 states have (on average 1.7682481751824817) internal successors, (4845), 2751 states have internal predecessors, (4845), 87 states have call successors, (87), 53 states have call predecessors, (87), 60 states have return successors, (120), 92 states have call predecessors, (120), 85 states have call successors, (120) [2022-07-12 08:19:18,625 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2889 states to 2889 states and 5052 transitions. [2022-07-12 08:19:18,625 INFO L78 Accepts]: Start accepts. Automaton has 2889 states and 5052 transitions. Word has length 58 [2022-07-12 08:19:18,626 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 08:19:18,626 INFO L495 AbstractCegarLoop]: Abstraction has 2889 states and 5052 transitions. [2022-07-12 08:19:18,626 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 08:19:18,626 INFO L276 IsEmpty]: Start isEmpty. Operand 2889 states and 5052 transitions. [2022-07-12 08:19:18,628 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2022-07-12 08:19:18,628 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 08:19:18,628 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 08:19:18,628 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-07-12 08:19:18,629 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 08:19:18,629 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 08:19:18,629 INFO L85 PathProgramCache]: Analyzing trace with hash 1158929233, now seen corresponding path program 1 times [2022-07-12 08:19:18,629 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 08:19:18,630 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1371017] [2022-07-12 08:19:18,630 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 08:19:18,630 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 08:19:18,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 08:19:18,652 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-07-12 08:19:18,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 08:19:18,665 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-12 08:19:18,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 08:19:18,675 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-07-12 08:19:18,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 08:19:18,695 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-07-12 08:19:18,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 08:19:18,699 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2022-07-12 08:19:18,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 08:19:18,701 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 08:19:18,701 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 08:19:18,701 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1371017] [2022-07-12 08:19:18,701 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1371017] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 08:19:18,702 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 08:19:18,702 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-12 08:19:18,702 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1907608490] [2022-07-12 08:19:18,702 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 08:19:18,703 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-12 08:19:18,703 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 08:19:18,703 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-12 08:19:18,704 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-12 08:19:18,704 INFO L87 Difference]: Start difference. First operand 2889 states and 5052 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 08:19:19,324 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 08:19:19,325 INFO L93 Difference]: Finished difference Result 4253 states and 6998 transitions. [2022-07-12 08:19:19,325 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-07-12 08:19:19,326 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 08:19:19,326 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 08:19:19,340 INFO L225 Difference]: With dead ends: 4253 [2022-07-12 08:19:19,341 INFO L226 Difference]: Without dead ends: 3495 [2022-07-12 08:19:19,343 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 08:19:19,344 INFO L413 NwaCegarLoop]: 4225 mSDtfsCounter, 4354 mSDsluCounter, 12183 mSDsCounter, 0 mSdLazyCounter, 472 mSolverCounterSat, 83 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4377 SdHoareTripleChecker+Valid, 16408 SdHoareTripleChecker+Invalid, 555 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 83 IncrementalHoareTripleChecker+Valid, 472 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-07-12 08:19:19,344 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [4377 Valid, 16408 Invalid, 555 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [83 Valid, 472 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-07-12 08:19:19,348 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3495 states. [2022-07-12 08:19:19,414 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3495 to 3290. [2022-07-12 08:19:19,420 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3290 states, 3058 states have (on average 1.723675604970569) internal successors, (5271), 3078 states have internal predecessors, (5271), 136 states have call successors, (136), 83 states have call predecessors, (136), 94 states have return successors, (179), 136 states have call predecessors, (179), 134 states have call successors, (179) [2022-07-12 08:19:19,428 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3290 states to 3290 states and 5586 transitions. [2022-07-12 08:19:19,429 INFO L78 Accepts]: Start accepts. Automaton has 3290 states and 5586 transitions. Word has length 58 [2022-07-12 08:19:19,429 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 08:19:19,429 INFO L495 AbstractCegarLoop]: Abstraction has 3290 states and 5586 transitions. [2022-07-12 08:19:19,430 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 08:19:19,430 INFO L276 IsEmpty]: Start isEmpty. Operand 3290 states and 5586 transitions. [2022-07-12 08:19:19,433 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2022-07-12 08:19:19,433 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 08:19:19,433 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 08:19:19,433 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-07-12 08:19:19,433 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 08:19:19,434 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 08:19:19,434 INFO L85 PathProgramCache]: Analyzing trace with hash 747002154, now seen corresponding path program 1 times [2022-07-12 08:19:19,434 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 08:19:19,434 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1110133449] [2022-07-12 08:19:19,435 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 08:19:19,435 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 08:19:19,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 08:19:19,453 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-07-12 08:19:19,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 08:19:19,461 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-12 08:19:19,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 08:19:19,473 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-07-12 08:19:19,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 08:19:19,509 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-07-12 08:19:19,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 08:19:19,512 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2022-07-12 08:19:19,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 08:19:19,514 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2022-07-12 08:19:19,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 08:19:19,517 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-07-12 08:19:19,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 08:19:19,520 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2022-07-12 08:19:19,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 08:19:19,522 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 08:19:19,522 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 08:19:19,523 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1110133449] [2022-07-12 08:19:19,523 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1110133449] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-12 08:19:19,523 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1922635022] [2022-07-12 08:19:19,523 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 08:19:19,523 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 08:19:19,524 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-12 08:19:19,527 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 08:19:19,534 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 08:19:19,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 08:19:19,612 INFO L263 TraceCheckSpWp]: Trace formula consists of 332 conjuncts, 2 conjunts are in the unsatisfiable core [2022-07-12 08:19:19,617 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 08:19:19,643 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 08:19:19,644 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-12 08:19:19,644 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1922635022] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 08:19:19,644 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-07-12 08:19:19,644 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [7] total 8 [2022-07-12 08:19:19,645 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [402127155] [2022-07-12 08:19:19,645 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 08:19:19,645 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-12 08:19:19,645 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 08:19:19,646 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-12 08:19:19,646 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2022-07-12 08:19:19,646 INFO L87 Difference]: Start difference. First operand 3290 states and 5586 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 08:19:19,740 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 08:19:19,740 INFO L93 Difference]: Finished difference Result 5496 states and 8712 transitions. [2022-07-12 08:19:19,741 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-12 08:19:19,741 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 08:19:19,741 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 08:19:19,759 INFO L225 Difference]: With dead ends: 5496 [2022-07-12 08:19:19,759 INFO L226 Difference]: Without dead ends: 4338 [2022-07-12 08:19:19,763 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 08:19:19,764 INFO L413 NwaCegarLoop]: 4229 mSDtfsCounter, 114 mSDsluCounter, 4108 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 114 SdHoareTripleChecker+Valid, 8337 SdHoareTripleChecker+Invalid, 13 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-12 08:19:19,764 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [114 Valid, 8337 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-12 08:19:19,769 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4338 states. [2022-07-12 08:19:19,872 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4338 to 4338. [2022-07-12 08:19:19,879 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4338 states, 3897 states have (on average 1.6440851937387735) internal successors, (6407), 3930 states have internal predecessors, (6407), 255 states have call successors, (255), 161 states have call predecessors, (255), 184 states have return successors, (376), 262 states have call predecessors, (376), 253 states have call successors, (376) [2022-07-12 08:19:19,889 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4338 states to 4338 states and 7038 transitions. [2022-07-12 08:19:19,890 INFO L78 Accepts]: Start accepts. Automaton has 4338 states and 7038 transitions. Word has length 93 [2022-07-12 08:19:19,891 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 08:19:19,891 INFO L495 AbstractCegarLoop]: Abstraction has 4338 states and 7038 transitions. [2022-07-12 08:19:19,891 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 08:19:19,891 INFO L276 IsEmpty]: Start isEmpty. Operand 4338 states and 7038 transitions. [2022-07-12 08:19:19,897 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2022-07-12 08:19:19,897 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 08:19:19,897 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 08:19:19,926 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 08:19:20,120 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,SelfDestructingSolverStorable5 [2022-07-12 08:19:20,120 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 08:19:20,120 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 08:19:20,120 INFO L85 PathProgramCache]: Analyzing trace with hash 385246456, now seen corresponding path program 1 times [2022-07-12 08:19:20,121 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 08:19:20,121 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2110338056] [2022-07-12 08:19:20,121 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 08:19:20,121 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 08:19:20,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 08:19:20,142 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-07-12 08:19:20,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 08:19:20,161 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-12 08:19:20,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 08:19:20,169 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-07-12 08:19:20,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 08:19:20,210 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-07-12 08:19:20,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 08:19:20,213 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2022-07-12 08:19:20,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 08:19:20,214 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2022-07-12 08:19:20,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 08:19:20,222 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-07-12 08:19:20,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 08:19:20,235 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2022-07-12 08:19:20,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 08:19:20,240 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-07-12 08:19:20,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 08:19:20,249 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2022-07-12 08:19:20,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 08:19:20,253 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 08:19:20,254 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 08:19:20,254 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2110338056] [2022-07-12 08:19:20,254 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2110338056] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-12 08:19:20,255 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [332415592] [2022-07-12 08:19:20,256 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 08:19:20,256 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 08:19:20,256 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-12 08:19:20,258 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 08:19:20,284 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 08:19:20,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 08:19:20,348 INFO L263 TraceCheckSpWp]: Trace formula consists of 406 conjuncts, 2 conjunts are in the unsatisfiable core [2022-07-12 08:19:20,354 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 08:19:20,438 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 08:19:20,439 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-12 08:19:20,439 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [332415592] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 08:19:20,439 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-07-12 08:19:20,439 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [7] total 8 [2022-07-12 08:19:20,439 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1691560673] [2022-07-12 08:19:20,439 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 08:19:20,440 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-12 08:19:20,440 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 08:19:20,440 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-12 08:19:20,440 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2022-07-12 08:19:20,440 INFO L87 Difference]: Start difference. First operand 4338 states and 7038 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 08:19:20,587 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 08:19:20,588 INFO L93 Difference]: Finished difference Result 8608 states and 13011 transitions. [2022-07-12 08:19:20,588 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-12 08:19:20,588 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 08:19:20,589 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 08:19:20,618 INFO L225 Difference]: With dead ends: 8608 [2022-07-12 08:19:20,619 INFO L226 Difference]: Without dead ends: 6405 [2022-07-12 08:19:20,629 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 08:19:20,630 INFO L413 NwaCegarLoop]: 4141 mSDtfsCounter, 4038 mSDsluCounter, 132 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4038 SdHoareTripleChecker+Valid, 4273 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 08:19:20,630 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [4038 Valid, 4273 Invalid, 12 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-12 08:19:20,638 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6405 states. [2022-07-12 08:19:20,824 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6405 to 6345. [2022-07-12 08:19:20,833 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6345 states, 5510 states have (on average 1.561705989110708) internal successors, (8605), 5572 states have internal predecessors, (8605), 475 states have call successors, (475), 311 states have call predecessors, (475), 358 states have return successors, (688), 477 states have call predecessors, (688), 473 states have call successors, (688) [2022-07-12 08:19:20,854 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6345 states to 6345 states and 9768 transitions. [2022-07-12 08:19:20,855 INFO L78 Accepts]: Start accepts. Automaton has 6345 states and 9768 transitions. Word has length 119 [2022-07-12 08:19:20,855 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 08:19:20,855 INFO L495 AbstractCegarLoop]: Abstraction has 6345 states and 9768 transitions. [2022-07-12 08:19:20,856 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 08:19:20,856 INFO L276 IsEmpty]: Start isEmpty. Operand 6345 states and 9768 transitions. [2022-07-12 08:19:20,866 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 136 [2022-07-12 08:19:20,867 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 08:19:20,867 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 08:19:20,893 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 08:19:21,085 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,SelfDestructingSolverStorable6 [2022-07-12 08:19:21,085 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 08:19:21,086 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 08:19:21,086 INFO L85 PathProgramCache]: Analyzing trace with hash -1965387098, now seen corresponding path program 1 times [2022-07-12 08:19:21,086 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 08:19:21,086 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1910902277] [2022-07-12 08:19:21,086 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 08:19:21,086 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 08:19:21,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 08:19:21,119 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-07-12 08:19:21,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 08:19:21,127 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-12 08:19:21,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 08:19:21,134 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-07-12 08:19:21,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 08:19:21,173 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-07-12 08:19:21,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 08:19:21,187 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2022-07-12 08:19:21,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 08:19:21,189 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2022-07-12 08:19:21,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 08:19:21,191 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2022-07-12 08:19:21,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 08:19:21,195 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-07-12 08:19:21,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 08:19:21,197 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2022-07-12 08:19:21,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 08:19:21,200 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-07-12 08:19:21,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 08:19:21,203 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 120 [2022-07-12 08:19:21,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 08:19:21,205 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 08:19:21,205 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 08:19:21,205 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1910902277] [2022-07-12 08:19:21,206 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1910902277] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-12 08:19:21,206 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [846490448] [2022-07-12 08:19:21,206 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 08:19:21,206 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 08:19:21,206 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-12 08:19:21,208 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 08:19:21,209 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 08:19:21,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 08:19:21,294 INFO L263 TraceCheckSpWp]: Trace formula consists of 443 conjuncts, 3 conjunts are in the unsatisfiable core [2022-07-12 08:19:21,297 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 08:19:21,382 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 08:19:21,382 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-12 08:19:21,382 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [846490448] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 08:19:21,382 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-07-12 08:19:21,382 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [7] total 8 [2022-07-12 08:19:21,382 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2118903572] [2022-07-12 08:19:21,383 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 08:19:21,383 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-12 08:19:21,383 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 08:19:21,383 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-12 08:19:21,384 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2022-07-12 08:19:21,384 INFO L87 Difference]: Start difference. First operand 6345 states and 9768 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 08:19:21,556 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 08:19:21,556 INFO L93 Difference]: Finished difference Result 9619 states and 14299 transitions. [2022-07-12 08:19:21,557 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-12 08:19:21,557 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 08:19:21,558 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 08:19:21,580 INFO L225 Difference]: With dead ends: 9619 [2022-07-12 08:19:21,581 INFO L226 Difference]: Without dead ends: 6673 [2022-07-12 08:19:21,591 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 08:19:21,592 INFO L413 NwaCegarLoop]: 4132 mSDtfsCounter, 4059 mSDsluCounter, 140 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4059 SdHoareTripleChecker+Valid, 4272 SdHoareTripleChecker+Invalid, 10 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-12 08:19:21,592 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [4059 Valid, 4272 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-12 08:19:21,600 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6673 states. [2022-07-12 08:19:21,792 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6673 to 6635. [2022-07-12 08:19:21,801 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6635 states, 5768 states have (on average 1.535887656033287) internal successors, (8859), 5830 states have internal predecessors, (8859), 481 states have call successors, (481), 337 states have call predecessors, (481), 384 states have return successors, (720), 483 states have call predecessors, (720), 479 states have call successors, (720) [2022-07-12 08:19:21,817 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6635 states to 6635 states and 10060 transitions. [2022-07-12 08:19:21,819 INFO L78 Accepts]: Start accepts. Automaton has 6635 states and 10060 transitions. Word has length 135 [2022-07-12 08:19:21,819 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 08:19:21,820 INFO L495 AbstractCegarLoop]: Abstraction has 6635 states and 10060 transitions. [2022-07-12 08:19:21,820 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 08:19:21,820 INFO L276 IsEmpty]: Start isEmpty. Operand 6635 states and 10060 transitions. [2022-07-12 08:19:21,830 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137 [2022-07-12 08:19:21,831 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 08:19:21,831 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 08:19:21,855 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 08:19:22,047 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 08:19:22,048 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 08:19:22,048 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 08:19:22,048 INFO L85 PathProgramCache]: Analyzing trace with hash 946429697, now seen corresponding path program 1 times [2022-07-12 08:19:22,048 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 08:19:22,049 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [323617283] [2022-07-12 08:19:22,049 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 08:19:22,049 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 08:19:22,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 08:19:22,066 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-07-12 08:19:22,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 08:19:22,074 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-12 08:19:22,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 08:19:22,080 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-07-12 08:19:22,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 08:19:22,117 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-07-12 08:19:22,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 08:19:22,120 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2022-07-12 08:19:22,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 08:19:22,121 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2022-07-12 08:19:22,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 08:19:22,123 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2022-07-12 08:19:22,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 08:19:22,127 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-07-12 08:19:22,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 08:19:22,130 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2022-07-12 08:19:22,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 08:19:22,133 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-07-12 08:19:22,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 08:19:22,136 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 121 [2022-07-12 08:19:22,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 08:19:22,138 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 08:19:22,138 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 08:19:22,138 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [323617283] [2022-07-12 08:19:22,138 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [323617283] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-12 08:19:22,138 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [368009135] [2022-07-12 08:19:22,138 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 08:19:22,138 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 08:19:22,139 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-12 08:19:22,140 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 08:19:22,141 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 08:19:22,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 08:19:22,229 INFO L263 TraceCheckSpWp]: Trace formula consists of 450 conjuncts, 3 conjunts are in the unsatisfiable core [2022-07-12 08:19:22,234 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 08:19:22,272 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 08:19:22,272 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-12 08:19:22,273 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [368009135] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 08:19:22,273 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-07-12 08:19:22,273 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [7] total 8 [2022-07-12 08:19:22,273 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1695874274] [2022-07-12 08:19:22,273 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 08:19:22,274 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-12 08:19:22,274 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 08:19:22,274 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-12 08:19:22,274 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2022-07-12 08:19:22,275 INFO L87 Difference]: Start difference. First operand 6635 states and 10060 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 08:19:22,440 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 08:19:22,440 INFO L93 Difference]: Finished difference Result 9031 states and 13439 transitions. [2022-07-12 08:19:22,441 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-12 08:19:22,441 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 08:19:22,441 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 08:19:22,464 INFO L225 Difference]: With dead ends: 9031 [2022-07-12 08:19:22,464 INFO L226 Difference]: Without dead ends: 6671 [2022-07-12 08:19:22,475 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 08:19:22,475 INFO L413 NwaCegarLoop]: 4217 mSDtfsCounter, 111 mSDsluCounter, 4099 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 111 SdHoareTripleChecker+Valid, 8316 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 08:19:22,476 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [111 Valid, 8316 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-12 08:19:22,484 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6671 states. [2022-07-12 08:19:22,669 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6671 to 6611. [2022-07-12 08:19:22,678 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6611 states, 5744 states have (on average 1.5217618384401115) internal successors, (8741), 5806 states have internal predecessors, (8741), 481 states have call successors, (481), 337 states have call predecessors, (481), 384 states have return successors, (720), 483 states have call predecessors, (720), 479 states have call successors, (720) [2022-07-12 08:19:22,696 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6611 states to 6611 states and 9942 transitions. [2022-07-12 08:19:22,697 INFO L78 Accepts]: Start accepts. Automaton has 6611 states and 9942 transitions. Word has length 136 [2022-07-12 08:19:22,698 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 08:19:22,698 INFO L495 AbstractCegarLoop]: Abstraction has 6611 states and 9942 transitions. [2022-07-12 08:19:22,698 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 08:19:22,698 INFO L276 IsEmpty]: Start isEmpty. Operand 6611 states and 9942 transitions. [2022-07-12 08:19:22,709 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137 [2022-07-12 08:19:22,709 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 08:19:22,710 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 08:19:22,736 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2022-07-12 08:19:22,930 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 08:19:22,931 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 08:19:22,931 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 08:19:22,931 INFO L85 PathProgramCache]: Analyzing trace with hash 1815303137, now seen corresponding path program 1 times [2022-07-12 08:19:22,931 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 08:19:22,931 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1828677504] [2022-07-12 08:19:22,932 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 08:19:22,932 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 08:19:22,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 08:19:22,960 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-07-12 08:19:22,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 08:19:22,972 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-12 08:19:22,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 08:19:22,978 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-07-12 08:19:22,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 08:19:23,011 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-07-12 08:19:23,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 08:19:23,014 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2022-07-12 08:19:23,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 08:19:23,018 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2022-07-12 08:19:23,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 08:19:23,020 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2022-07-12 08:19:23,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 08:19:23,026 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-07-12 08:19:23,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 08:19:23,030 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2022-07-12 08:19:23,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 08:19:23,034 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-07-12 08:19:23,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 08:19:23,037 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 121 [2022-07-12 08:19:23,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 08:19:23,042 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 08:19:23,042 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 08:19:23,042 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1828677504] [2022-07-12 08:19:23,042 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1828677504] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-12 08:19:23,042 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [944131270] [2022-07-12 08:19:23,042 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 08:19:23,042 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 08:19:23,043 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-12 08:19:23,044 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 08:19:23,045 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 08:19:23,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 08:19:23,135 INFO L263 TraceCheckSpWp]: Trace formula consists of 456 conjuncts, 2 conjunts are in the unsatisfiable core [2022-07-12 08:19:23,141 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 08:19:23,167 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 08:19:23,168 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-12 08:19:23,168 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [944131270] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 08:19:23,168 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-07-12 08:19:23,168 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [7] total 8 [2022-07-12 08:19:23,168 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [441885493] [2022-07-12 08:19:23,168 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 08:19:23,169 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-12 08:19:23,169 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 08:19:23,169 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-12 08:19:23,169 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2022-07-12 08:19:23,169 INFO L87 Difference]: Start difference. First operand 6611 states and 9942 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 08:19:23,373 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 08:19:23,373 INFO L93 Difference]: Finished difference Result 9935 states and 14498 transitions. [2022-07-12 08:19:23,373 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-12 08:19:23,373 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 08:19:23,374 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 08:19:23,396 INFO L225 Difference]: With dead ends: 9935 [2022-07-12 08:19:23,396 INFO L226 Difference]: Without dead ends: 5993 [2022-07-12 08:19:23,408 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 08:19:23,408 INFO L413 NwaCegarLoop]: 4112 mSDtfsCounter, 4089 mSDsluCounter, 24 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4089 SdHoareTripleChecker+Valid, 4136 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 08:19:23,409 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [4089 Valid, 4136 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-12 08:19:23,418 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5993 states. [2022-07-12 08:19:23,570 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5993 to 5763. [2022-07-12 08:19:23,576 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5763 states, 5062 states have (on average 1.5205452390359542) internal successors, (7697), 5108 states have internal predecessors, (7697), 393 states have call successors, (393), 275 states have call predecessors, (393), 306 states have return successors, (510), 387 states have call predecessors, (510), 391 states have call successors, (510) [2022-07-12 08:19:23,591 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5763 states to 5763 states and 8600 transitions. [2022-07-12 08:19:23,593 INFO L78 Accepts]: Start accepts. Automaton has 5763 states and 8600 transitions. Word has length 136 [2022-07-12 08:19:23,593 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 08:19:23,593 INFO L495 AbstractCegarLoop]: Abstraction has 5763 states and 8600 transitions. [2022-07-12 08:19:23,593 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 08:19:23,593 INFO L276 IsEmpty]: Start isEmpty. Operand 5763 states and 8600 transitions. [2022-07-12 08:19:23,608 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 138 [2022-07-12 08:19:23,608 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 08:19:23,608 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 08:19:23,634 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 08:19:23,823 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,SelfDestructingSolverStorable9 [2022-07-12 08:19:23,823 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 08:19:23,825 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 08:19:23,825 INFO L85 PathProgramCache]: Analyzing trace with hash 874736092, now seen corresponding path program 1 times [2022-07-12 08:19:23,825 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 08:19:23,825 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [300639613] [2022-07-12 08:19:23,825 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 08:19:23,825 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 08:19:23,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 08:19:23,850 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-07-12 08:19:23,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 08:19:23,857 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-12 08:19:23,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 08:19:23,863 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-07-12 08:19:23,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 08:19:23,901 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-07-12 08:19:23,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 08:19:23,903 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2022-07-12 08:19:23,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 08:19:23,905 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2022-07-12 08:19:23,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 08:19:23,906 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2022-07-12 08:19:23,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 08:19:23,909 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-07-12 08:19:23,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 08:19:23,911 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2022-07-12 08:19:23,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 08:19:23,915 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-07-12 08:19:23,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 08:19:23,918 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2022-07-12 08:19:23,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 08:19:23,920 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 08:19:23,920 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 08:19:23,920 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [300639613] [2022-07-12 08:19:23,921 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [300639613] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-12 08:19:23,921 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2053929181] [2022-07-12 08:19:23,921 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 08:19:23,921 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 08:19:23,921 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-12 08:19:23,923 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 08:19:23,924 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 08:19:24,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 08:19:24,009 INFO L263 TraceCheckSpWp]: Trace formula consists of 452 conjuncts, 6 conjunts are in the unsatisfiable core [2022-07-12 08:19:24,012 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 08:19:24,110 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 08:19:24,111 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-12 08:19:24,111 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2053929181] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 08:19:24,111 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-07-12 08:19:24,111 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [7] total 10 [2022-07-12 08:19:24,113 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1053302755] [2022-07-12 08:19:24,113 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 08:19:24,113 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-07-12 08:19:24,113 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 08:19:24,114 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-12 08:19:24,114 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2022-07-12 08:19:24,114 INFO L87 Difference]: Start difference. First operand 5763 states and 8600 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 08:19:24,341 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 08:19:24,342 INFO L93 Difference]: Finished difference Result 7191 states and 10479 transitions. [2022-07-12 08:19:24,342 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-12 08:19:24,342 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 08:19:24,343 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 08:19:24,356 INFO L225 Difference]: With dead ends: 7191 [2022-07-12 08:19:24,356 INFO L226 Difference]: Without dead ends: 4833 [2022-07-12 08:19:24,364 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 08:19:24,366 INFO L413 NwaCegarLoop]: 4090 mSDtfsCounter, 4107 mSDsluCounter, 8071 mSDsCounter, 0 mSdLazyCounter, 100 mSolverCounterSat, 24 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4115 SdHoareTripleChecker+Valid, 12161 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 08:19:24,366 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [4115 Valid, 12161 Invalid, 124 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [24 Valid, 100 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-12 08:19:24,372 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4833 states. [2022-07-12 08:19:24,512 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4833 to 4821. [2022-07-12 08:19:24,519 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4821 states, 4302 states have (on average 1.5488145048814506) internal successors, (6663), 4330 states have internal predecessors, (6663), 297 states have call successors, (297), 205 states have call predecessors, (297), 220 states have return successors, (354), 289 states have call predecessors, (354), 295 states have call successors, (354) [2022-07-12 08:19:24,530 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4821 states to 4821 states and 7314 transitions. [2022-07-12 08:19:24,531 INFO L78 Accepts]: Start accepts. Automaton has 4821 states and 7314 transitions. Word has length 137 [2022-07-12 08:19:24,531 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 08:19:24,532 INFO L495 AbstractCegarLoop]: Abstraction has 4821 states and 7314 transitions. [2022-07-12 08:19:24,532 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 08:19:24,532 INFO L276 IsEmpty]: Start isEmpty. Operand 4821 states and 7314 transitions. [2022-07-12 08:19:24,536 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 138 [2022-07-12 08:19:24,537 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 08:19:24,537 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 08:19:24,563 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2022-07-12 08:19:24,750 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 08:19:24,750 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 08:19:24,750 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 08:19:24,750 INFO L85 PathProgramCache]: Analyzing trace with hash -991972582, now seen corresponding path program 1 times [2022-07-12 08:19:24,751 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 08:19:24,751 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [809529022] [2022-07-12 08:19:24,751 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 08:19:24,751 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 08:19:24,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 08:19:24,769 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-07-12 08:19:24,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 08:19:24,776 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-12 08:19:24,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 08:19:24,781 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-07-12 08:19:24,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 08:19:24,812 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-07-12 08:19:24,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 08:19:24,815 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2022-07-12 08:19:24,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 08:19:24,818 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2022-07-12 08:19:24,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 08:19:24,819 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2022-07-12 08:19:24,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 08:19:24,822 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-07-12 08:19:24,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 08:19:24,824 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2022-07-12 08:19:24,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 08:19:24,830 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-07-12 08:19:24,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 08:19:24,834 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2022-07-12 08:19:24,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 08:19:24,837 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 08:19:24,837 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 08:19:24,837 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [809529022] [2022-07-12 08:19:24,837 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [809529022] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-12 08:19:24,837 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [139735533] [2022-07-12 08:19:24,837 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 08:19:24,838 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 08:19:24,838 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-12 08:19:24,839 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 08:19:24,840 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 08:19:24,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 08:19:24,926 INFO L263 TraceCheckSpWp]: Trace formula consists of 449 conjuncts, 6 conjunts are in the unsatisfiable core [2022-07-12 08:19:24,929 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 08:19:24,997 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 08:19:24,997 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-12 08:19:24,997 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [139735533] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 08:19:24,997 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-07-12 08:19:24,997 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [7] total 10 [2022-07-12 08:19:24,997 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1552601075] [2022-07-12 08:19:24,998 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 08:19:24,998 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-07-12 08:19:24,998 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 08:19:24,999 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-12 08:19:24,999 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2022-07-12 08:19:24,999 INFO L87 Difference]: Start difference. First operand 4821 states and 7314 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 08:19:25,277 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 08:19:25,278 INFO L93 Difference]: Finished difference Result 7162 states and 10301 transitions. [2022-07-12 08:19:25,278 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-07-12 08:19:25,278 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 08:19:25,279 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 08:19:25,292 INFO L225 Difference]: With dead ends: 7162 [2022-07-12 08:19:25,292 INFO L226 Difference]: Without dead ends: 4769 [2022-07-12 08:19:25,300 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 08:19:25,301 INFO L413 NwaCegarLoop]: 4102 mSDtfsCounter, 4128 mSDsluCounter, 8066 mSDsCounter, 0 mSdLazyCounter, 150 mSolverCounterSat, 29 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4136 SdHoareTripleChecker+Valid, 12168 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 08:19:25,301 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [4136 Valid, 12168 Invalid, 179 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [29 Valid, 150 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-12 08:19:25,307 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4769 states. [2022-07-12 08:19:25,491 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4769 to 3795. [2022-07-12 08:19:25,497 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3795 states, 3488 states have (on average 1.6023509174311927) internal successors, (5589), 3504 states have internal predecessors, (5589), 175 states have call successors, (175), 123 states have call predecessors, (175), 130 states have return successors, (203), 169 states have call predecessors, (203), 173 states have call successors, (203) [2022-07-12 08:19:25,505 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3795 states to 3795 states and 5967 transitions. [2022-07-12 08:19:25,506 INFO L78 Accepts]: Start accepts. Automaton has 3795 states and 5967 transitions. Word has length 137 [2022-07-12 08:19:25,506 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 08:19:25,506 INFO L495 AbstractCegarLoop]: Abstraction has 3795 states and 5967 transitions. [2022-07-12 08:19:25,507 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 08:19:25,507 INFO L276 IsEmpty]: Start isEmpty. Operand 3795 states and 5967 transitions. [2022-07-12 08:19:25,510 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 138 [2022-07-12 08:19:25,510 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 08:19:25,510 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 08:19:25,536 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 08:19:25,726 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 08:19:25,726 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 08:19:25,726 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 08:19:25,727 INFO L85 PathProgramCache]: Analyzing trace with hash 1995852316, now seen corresponding path program 1 times [2022-07-12 08:19:25,727 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 08:19:25,727 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1015130857] [2022-07-12 08:19:25,727 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 08:19:25,727 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 08:19:25,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 08:19:25,744 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-07-12 08:19:25,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 08:19:25,752 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-12 08:19:25,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 08:19:25,758 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-07-12 08:19:25,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 08:19:25,796 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-07-12 08:19:25,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 08:19:25,798 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2022-07-12 08:19:25,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 08:19:25,800 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2022-07-12 08:19:25,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 08:19:25,801 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2022-07-12 08:19:25,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 08:19:25,804 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-07-12 08:19:25,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 08:19:25,807 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2022-07-12 08:19:25,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 08:19:25,810 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-07-12 08:19:25,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 08:19:25,812 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2022-07-12 08:19:25,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 08:19:25,814 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 08:19:25,814 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 08:19:25,814 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1015130857] [2022-07-12 08:19:25,814 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1015130857] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-12 08:19:25,815 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1778018931] [2022-07-12 08:19:25,815 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 08:19:25,815 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 08:19:25,815 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-12 08:19:25,817 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 08:19:25,818 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 08:19:25,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 08:19:25,907 INFO L263 TraceCheckSpWp]: Trace formula consists of 446 conjuncts, 7 conjunts are in the unsatisfiable core [2022-07-12 08:19:25,910 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 08:19:25,941 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 08:19:25,941 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-12 08:19:25,942 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1778018931] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 08:19:25,942 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-07-12 08:19:25,942 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [7] total 7 [2022-07-12 08:19:25,942 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1609856583] [2022-07-12 08:19:25,942 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 08:19:25,943 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-07-12 08:19:25,943 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 08:19:25,943 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-12 08:19:25,943 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-07-12 08:19:25,943 INFO L87 Difference]: Start difference. First operand 3795 states and 5967 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 08:19:26,103 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 08:19:26,103 INFO L93 Difference]: Finished difference Result 4934 states and 7353 transitions. [2022-07-12 08:19:26,104 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-07-12 08:19:26,104 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 08:19:26,104 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 08:19:26,113 INFO L225 Difference]: With dead ends: 4934 [2022-07-12 08:19:26,113 INFO L226 Difference]: Without dead ends: 3270 [2022-07-12 08:19:26,118 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 08:19:26,119 INFO L413 NwaCegarLoop]: 4102 mSDtfsCounter, 48 mSDsluCounter, 12315 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 48 SdHoareTripleChecker+Valid, 16417 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 08:19:26,119 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [48 Valid, 16417 Invalid, 14 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-12 08:19:26,123 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3270 states. [2022-07-12 08:19:26,224 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3270 to 3234. [2022-07-12 08:19:26,229 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3234 states, 3034 states have (on average 1.654911008569545) internal successors, (5021), 3046 states have internal predecessors, (5021), 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 08:19:26,236 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3234 states to 3234 states and 5254 transitions. [2022-07-12 08:19:26,237 INFO L78 Accepts]: Start accepts. Automaton has 3234 states and 5254 transitions. Word has length 137 [2022-07-12 08:19:26,237 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 08:19:26,237 INFO L495 AbstractCegarLoop]: Abstraction has 3234 states and 5254 transitions. [2022-07-12 08:19:26,237 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 08:19:26,237 INFO L276 IsEmpty]: Start isEmpty. Operand 3234 states and 5254 transitions. [2022-07-12 08:19:26,240 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 138 [2022-07-12 08:19:26,240 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 08:19:26,240 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 08:19:26,265 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 08:19:26,455 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,SelfDestructingSolverStorable12 [2022-07-12 08:19:26,456 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 08:19:26,456 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 08:19:26,456 INFO L85 PathProgramCache]: Analyzing trace with hash 688947232, now seen corresponding path program 1 times [2022-07-12 08:19:26,456 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 08:19:26,456 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1057524994] [2022-07-12 08:19:26,456 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 08:19:26,457 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 08:19:26,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 08:19:26,480 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-07-12 08:19:26,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 08:19:26,488 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-12 08:19:26,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 08:19:26,495 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-07-12 08:19:26,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 08:19:26,530 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-07-12 08:19:26,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 08:19:26,533 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2022-07-12 08:19:26,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 08:19:26,535 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2022-07-12 08:19:26,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 08:19:26,536 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2022-07-12 08:19:26,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 08:19:26,540 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-07-12 08:19:26,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 08:19:26,543 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2022-07-12 08:19:26,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 08:19:26,547 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-07-12 08:19:26,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 08:19:26,550 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2022-07-12 08:19:26,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 08:19:26,552 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 08:19:26,553 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 08:19:26,553 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1057524994] [2022-07-12 08:19:26,553 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1057524994] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-12 08:19:26,553 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [785408235] [2022-07-12 08:19:26,553 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 08:19:26,554 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 08:19:26,554 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-12 08:19:26,555 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 08:19:26,557 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 08:19:26,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 08:19:26,656 INFO L263 TraceCheckSpWp]: Trace formula consists of 444 conjuncts, 7 conjunts are in the unsatisfiable core [2022-07-12 08:19:26,658 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 08:19:26,683 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 08:19:26,684 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-12 08:19:26,684 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [785408235] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 08:19:26,684 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-07-12 08:19:26,684 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [7] total 7 [2022-07-12 08:19:26,684 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2103750973] [2022-07-12 08:19:26,685 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 08:19:26,685 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-07-12 08:19:26,685 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 08:19:26,686 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-12 08:19:26,686 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-07-12 08:19:26,686 INFO L87 Difference]: Start difference. First operand 3234 states and 5254 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 08:19:26,838 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 08:19:26,839 INFO L93 Difference]: Finished difference Result 4365 states and 6615 transitions. [2022-07-12 08:19:26,839 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-07-12 08:19:26,839 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 08:19:26,840 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 08:19:26,847 INFO L225 Difference]: With dead ends: 4365 [2022-07-12 08:19:26,847 INFO L226 Difference]: Without dead ends: 3262 [2022-07-12 08:19:26,851 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 08:19:26,851 INFO L413 NwaCegarLoop]: 4101 mSDtfsCounter, 10 mSDsluCounter, 12302 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 16403 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 08:19:26,852 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [10 Valid, 16403 Invalid, 14 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-12 08:19:26,855 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3262 states. [2022-07-12 08:19:26,963 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3262 to 3246. [2022-07-12 08:19:26,968 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3246 states, 3046 states have (on average 1.6454366382140513) internal successors, (5012), 3058 states have internal predecessors, (5012), 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 08:19:26,975 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3246 states to 3246 states and 5245 transitions. [2022-07-12 08:19:26,975 INFO L78 Accepts]: Start accepts. Automaton has 3246 states and 5245 transitions. Word has length 137 [2022-07-12 08:19:26,976 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 08:19:26,976 INFO L495 AbstractCegarLoop]: Abstraction has 3246 states and 5245 transitions. [2022-07-12 08:19:26,976 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 08:19:26,976 INFO L276 IsEmpty]: Start isEmpty. Operand 3246 states and 5245 transitions. [2022-07-12 08:19:26,979 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 138 [2022-07-12 08:19:26,979 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 08:19:26,979 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 08:19:27,003 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 08:19:27,195 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13 [2022-07-12 08:19:27,195 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 08:19:27,196 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 08:19:27,196 INFO L85 PathProgramCache]: Analyzing trace with hash -1312364636, now seen corresponding path program 1 times [2022-07-12 08:19:27,196 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 08:19:27,196 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [514605892] [2022-07-12 08:19:27,196 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 08:19:27,196 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 08:19:27,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 08:19:27,262 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-07-12 08:19:27,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 08:19:27,275 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-12 08:19:27,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 08:19:27,288 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-07-12 08:19:27,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 08:19:27,291 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-07-12 08:19:27,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 08:19:27,293 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2022-07-12 08:19:27,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 08:19:27,294 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2022-07-12 08:19:27,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 08:19:27,295 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2022-07-12 08:19:27,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 08:19:27,298 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-07-12 08:19:27,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 08:19:27,299 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2022-07-12 08:19:27,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 08:19:27,302 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-07-12 08:19:27,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 08:19:27,310 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2022-07-12 08:19:27,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 08:19:27,313 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 08:19:27,313 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 08:19:27,313 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [514605892] [2022-07-12 08:19:27,313 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [514605892] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 08:19:27,313 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 08:19:27,313 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-12 08:19:27,314 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [241652516] [2022-07-12 08:19:27,314 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 08:19:27,315 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-12 08:19:27,315 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 08:19:27,315 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-12 08:19:27,316 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-12 08:19:27,316 INFO L87 Difference]: Start difference. First operand 3246 states and 5245 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 08:19:27,908 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 08:19:27,908 INFO L93 Difference]: Finished difference Result 4206 states and 6319 transitions. [2022-07-12 08:19:27,908 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-07-12 08:19:27,909 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 08:19:27,909 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 08:19:27,917 INFO L225 Difference]: With dead ends: 4206 [2022-07-12 08:19:27,918 INFO L226 Difference]: Without dead ends: 4203 [2022-07-12 08:19:27,919 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 08:19:27,919 INFO L413 NwaCegarLoop]: 4172 mSDtfsCounter, 4444 mSDsluCounter, 12174 mSDsCounter, 0 mSdLazyCounter, 341 mSolverCounterSat, 91 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4467 SdHoareTripleChecker+Valid, 16346 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 08:19:27,920 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [4467 Valid, 16346 Invalid, 432 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [91 Valid, 341 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-07-12 08:19:27,923 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4203 states. [2022-07-12 08:19:28,048 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4203 to 3622. [2022-07-12 08:19:28,052 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3622 states, 3356 states have (on average 1.598331346841478) internal successors, (5364), 3372 states have internal predecessors, (5364), 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 08:19:28,057 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3622 states to 3622 states and 5673 transitions. [2022-07-12 08:19:28,058 INFO L78 Accepts]: Start accepts. Automaton has 3622 states and 5673 transitions. Word has length 137 [2022-07-12 08:19:28,058 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 08:19:28,058 INFO L495 AbstractCegarLoop]: Abstraction has 3622 states and 5673 transitions. [2022-07-12 08:19:28,058 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 08:19:28,059 INFO L276 IsEmpty]: Start isEmpty. Operand 3622 states and 5673 transitions. [2022-07-12 08:19:28,061 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 142 [2022-07-12 08:19:28,061 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 08:19:28,061 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 08:19:28,062 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2022-07-12 08:19:28,062 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 08:19:28,062 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 08:19:28,062 INFO L85 PathProgramCache]: Analyzing trace with hash -1384992052, now seen corresponding path program 1 times [2022-07-12 08:19:28,062 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 08:19:28,062 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1380768868] [2022-07-12 08:19:28,063 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 08:19:28,063 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 08:19:28,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 08:19:28,086 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-07-12 08:19:28,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 08:19:28,093 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-12 08:19:28,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 08:19:28,099 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-07-12 08:19:28,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 08:19:28,101 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-07-12 08:19:28,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 08:19:28,102 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2022-07-12 08:19:28,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 08:19:28,103 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2022-07-12 08:19:28,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 08:19:28,104 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2022-07-12 08:19:28,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 08:19:28,106 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-07-12 08:19:28,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 08:19:28,108 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2022-07-12 08:19:28,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 08:19:28,110 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-07-12 08:19:28,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 08:19:28,112 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2022-07-12 08:19:28,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 08:19:28,113 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 08:19:28,113 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 08:19:28,113 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1380768868] [2022-07-12 08:19:28,113 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1380768868] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 08:19:28,113 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 08:19:28,114 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-07-12 08:19:28,114 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [964720635] [2022-07-12 08:19:28,114 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 08:19:28,114 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-07-12 08:19:28,114 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 08:19:28,115 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-12 08:19:28,115 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-07-12 08:19:28,115 INFO L87 Difference]: Start difference. First operand 3622 states and 5673 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 08:19:28,459 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 08:19:28,459 INFO L93 Difference]: Finished difference Result 4845 states and 7161 transitions. [2022-07-12 08:19:28,460 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-07-12 08:19:28,460 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 08:19:28,460 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 08:19:28,469 INFO L225 Difference]: With dead ends: 4845 [2022-07-12 08:19:28,469 INFO L226 Difference]: Without dead ends: 3985 [2022-07-12 08:19:28,472 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 08:19:28,472 INFO L413 NwaCegarLoop]: 4150 mSDtfsCounter, 142 mSDsluCounter, 12149 mSDsCounter, 0 mSdLazyCounter, 204 mSolverCounterSat, 34 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 155 SdHoareTripleChecker+Valid, 16299 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 08:19:28,472 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [155 Valid, 16299 Invalid, 238 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [34 Valid, 204 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-07-12 08:19:28,476 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3985 states. [2022-07-12 08:19:28,663 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3985 to 3624. [2022-07-12 08:19:28,667 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3624 states, 3358 states have (on average 1.5979749851101845) internal successors, (5366), 3374 states have internal predecessors, (5366), 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 08:19:28,672 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3624 states to 3624 states and 5675 transitions. [2022-07-12 08:19:28,673 INFO L78 Accepts]: Start accepts. Automaton has 3624 states and 5675 transitions. Word has length 141 [2022-07-12 08:19:28,673 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 08:19:28,673 INFO L495 AbstractCegarLoop]: Abstraction has 3624 states and 5675 transitions. [2022-07-12 08:19:28,673 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 08:19:28,673 INFO L276 IsEmpty]: Start isEmpty. Operand 3624 states and 5675 transitions. [2022-07-12 08:19:28,676 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 143 [2022-07-12 08:19:28,676 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 08:19:28,676 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 08:19:28,676 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2022-07-12 08:19:28,676 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 08:19:28,676 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 08:19:28,677 INFO L85 PathProgramCache]: Analyzing trace with hash 1244161439, now seen corresponding path program 1 times [2022-07-12 08:19:28,677 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 08:19:28,677 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [690880200] [2022-07-12 08:19:28,677 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 08:19:28,677 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 08:19:28,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-12 08:19:28,690 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-12 08:19:28,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-12 08:19:28,740 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-12 08:19:28,740 INFO L271 BasicCegarLoop]: Counterexample is feasible [2022-07-12 08:19:28,741 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location errorErr0ASSERT_VIOLATIONERROR_FUNCTION (1 of 2 remaining) [2022-07-12 08:19:28,742 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 2 remaining) [2022-07-12 08:19:28,742 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2022-07-12 08:19:28,745 INFO L356 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 08:19:28,748 INFO L176 ceAbstractionStarter]: Computing trace abstraction results [2022-07-12 08:19:28,850 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 12.07 08:19:28 BoogieIcfgContainer [2022-07-12 08:19:28,850 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-07-12 08:19:28,850 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-07-12 08:19:28,850 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-07-12 08:19:28,851 INFO L275 PluginConnector]: Witness Printer initialized [2022-07-12 08:19:28,851 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.07 08:19:14" (3/4) ... [2022-07-12 08:19:28,852 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2022-07-12 08:19:28,959 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2022-07-12 08:19:28,959 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-07-12 08:19:28,960 INFO L158 Benchmark]: Toolchain (without parser) took 23870.80ms. Allocated memory was 96.5MB in the beginning and 1.4GB in the end (delta: 1.3GB). Free memory was 51.2MB in the beginning and 1.1GB in the end (delta: -1.1GB). Peak memory consumption was 267.4MB. Max. memory is 16.1GB. [2022-07-12 08:19:28,960 INFO L158 Benchmark]: CDTParser took 0.23ms. Allocated memory is still 96.5MB. Free memory was 74.8MB in the beginning and 74.8MB in the end (delta: 26.7kB). There was no memory consumed. Max. memory is 16.1GB. [2022-07-12 08:19:28,961 INFO L158 Benchmark]: CACSL2BoogieTranslator took 2852.43ms. Allocated memory was 96.5MB in the beginning and 211.8MB in the end (delta: 115.3MB). Free memory was 50.8MB in the beginning and 94.6MB in the end (delta: -43.8MB). Peak memory consumption was 99.2MB. Max. memory is 16.1GB. [2022-07-12 08:19:28,961 INFO L158 Benchmark]: Boogie Procedure Inliner took 443.67ms. Allocated memory was 211.8MB in the beginning and 291.5MB in the end (delta: 79.7MB). Free memory was 93.6MB in the beginning and 139.1MB in the end (delta: -45.5MB). Peak memory consumption was 44.9MB. Max. memory is 16.1GB. [2022-07-12 08:19:28,962 INFO L158 Benchmark]: Boogie Preprocessor took 371.98ms. Allocated memory is still 291.5MB. Free memory was 139.1MB in the beginning and 122.0MB in the end (delta: 17.1MB). Peak memory consumption was 62.2MB. Max. memory is 16.1GB. [2022-07-12 08:19:28,962 INFO L158 Benchmark]: RCFGBuilder took 5937.83ms. Allocated memory was 291.5MB in the beginning and 604.0MB in the end (delta: 312.5MB). Free memory was 122.0MB in the beginning and 291.3MB in the end (delta: -169.3MB). Peak memory consumption was 265.9MB. Max. memory is 16.1GB. [2022-07-12 08:19:28,962 INFO L158 Benchmark]: TraceAbstraction took 14148.12ms. Allocated memory was 604.0MB in the beginning and 1.4GB in the end (delta: 834.7MB). Free memory was 291.3MB in the beginning and 1.1GB in the end (delta: -849.7MB). There was no memory consumed. Max. memory is 16.1GB. [2022-07-12 08:19:28,963 INFO L158 Benchmark]: Witness Printer took 108.90ms. Allocated memory is still 1.4GB. Free memory was 1.1GB in the beginning and 1.1GB in the end (delta: 15.7MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. [2022-07-12 08:19:28,968 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.23ms. Allocated memory is still 96.5MB. Free memory was 74.8MB in the beginning and 74.8MB in the end (delta: 26.7kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 2852.43ms. Allocated memory was 96.5MB in the beginning and 211.8MB in the end (delta: 115.3MB). Free memory was 50.8MB in the beginning and 94.6MB in the end (delta: -43.8MB). Peak memory consumption was 99.2MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 443.67ms. Allocated memory was 211.8MB in the beginning and 291.5MB in the end (delta: 79.7MB). Free memory was 93.6MB in the beginning and 139.1MB in the end (delta: -45.5MB). Peak memory consumption was 44.9MB. Max. memory is 16.1GB. * Boogie Preprocessor took 371.98ms. Allocated memory is still 291.5MB. Free memory was 139.1MB in the beginning and 122.0MB in the end (delta: 17.1MB). Peak memory consumption was 62.2MB. Max. memory is 16.1GB. * RCFGBuilder took 5937.83ms. Allocated memory was 291.5MB in the beginning and 604.0MB in the end (delta: 312.5MB). Free memory was 122.0MB in the beginning and 291.3MB in the end (delta: -169.3MB). Peak memory consumption was 265.9MB. Max. memory is 16.1GB. * TraceAbstraction took 14148.12ms. Allocated memory was 604.0MB in the beginning and 1.4GB in the end (delta: 834.7MB). Free memory was 291.3MB in the beginning and 1.1GB in the end (delta: -849.7MB). There was no memory consumed. Max. memory is 16.1GB. * Witness Printer took 108.90ms. Allocated memory is still 1.4GB. Free memory was 1.1GB in the beginning and 1.1GB 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: 11173]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L33] int d= 4; [L34] int c= 3; [L35] int e= 5; [L36] int a= 1; [L37] int f= 6; [L38] int b= 2; [L40] int a9 = 18; [L41] int a27 = 1; [L42] int a2 = 10; [L43] int a16 = 1; [L44] int a15 = 1; [L45] int a12 = 4; [L46] int a25 = 1; [L47] int a20 = 5; [L11177] int m_pc = 0; [L11178] int t1_pc = 0; [L11179] int m_st ; [L11180] int t1_st ; [L11181] int m_i ; [L11182] int t1_i ; [L11183] int M_E = 2; [L11184] int T1_E = 2; [L11185] int E_M = 2; [L11186] int E_1 = 2; [L11190] int token ; [L11192] int local ; VAL [a=1, a12=4, a15=1, a16=1, a2=10, a20=5, a25=1, a27=1, a9=18, b=2, c=3, d=4, e=5, E_1=2, E_M=2, f=6, local=0, M_E=2, m_i=0, m_pc=0, m_st=0, T1_E=2, t1_i=0, t1_pc=0, t1_st=0, token=0] [L11651] COND FALSE !(__VERIFIER_nondet_int()) [L11654] CALL main2() [L11638] int __retres1 ; [L11642] CALL init_model() [L11553] m_i = 1 [L11554] t1_i = 1 VAL [a=1, a12=4, a15=1, a16=1, a2=10, a20=5, a25=1, a27=1, a9=18, b=2, c=3, d=4, e=5, E_1=2, E_M=2, f=6, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, token=0] [L11642] RET init_model() [L11643] CALL start_simulation() [L11579] int kernel_st ; [L11580] int tmp ; [L11581] int tmp___0 ; [L11585] kernel_st = 0 VAL [a=1, a12=4, a15=1, a16=1, a2=10, a20=5, a25=1, a27=1, a9=18, b=2, c=3, d=4, e=5, E_1=2, E_M=2, f=6, kernel_st=0, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, token=0] [L11586] FCALL update_channels() VAL [a=1, a12=4, a15=1, a16=1, a2=10, a20=5, a25=1, a27=1, a9=18, b=2, c=3, d=4, e=5, E_1=2, E_M=2, f=6, kernel_st=0, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, token=0] [L11587] CALL init_threads() [L11335] COND TRUE m_i == 1 [L11336] m_st = 0 VAL [a=1, a12=4, a15=1, a16=1, a2=10, a20=5, a25=1, a27=1, a9=18, b=2, c=3, d=4, e=5, E_1=2, E_M=2, f=6, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, token=0] [L11340] COND TRUE t1_i == 1 [L11341] t1_st = 0 VAL [a=1, a12=4, a15=1, a16=1, a2=10, a20=5, a25=1, a27=1, a9=18, b=2, c=3, d=4, e=5, E_1=2, E_M=2, f=6, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, token=0] [L11587] RET init_threads() [L11588] CALL fire_delta_events() VAL [\old(E_1)=2, \old(E_M)=2, \old(M_E)=2, \old(T1_E)=2, a=1, a12=4, a15=1, a16=1, a2=10, a20=5, a25=1, a27=1, a9=18, b=2, c=3, d=4, e=5, E_1=2, E_M=2, f=6, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, token=0] [L11424] COND FALSE !(M_E == 0) VAL [\old(E_1)=2, \old(E_M)=2, \old(M_E)=2, \old(T1_E)=2, a=1, a12=4, a15=1, a16=1, a2=10, a20=5, a25=1, a27=1, a9=18, b=2, c=3, d=4, e=5, E_1=2, E_M=2, f=6, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, token=0] [L11429] COND FALSE !(T1_E == 0) VAL [\old(E_1)=2, \old(E_M)=2, \old(M_E)=2, \old(T1_E)=2, a=1, a12=4, a15=1, a16=1, a2=10, a20=5, a25=1, a27=1, a9=18, b=2, c=3, d=4, e=5, E_1=2, E_M=2, f=6, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, token=0] [L11434] COND FALSE !(E_M == 0) VAL [\old(E_1)=2, \old(E_M)=2, \old(M_E)=2, \old(T1_E)=2, a=1, a12=4, a15=1, a16=1, a2=10, a20=5, a25=1, a27=1, a9=18, b=2, c=3, d=4, e=5, E_1=2, E_M=2, f=6, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, token=0] [L11439] COND FALSE !(E_1 == 0) VAL [\old(E_1)=2, \old(E_M)=2, \old(M_E)=2, \old(T1_E)=2, a=1, a12=4, a15=1, a16=1, a2=10, a20=5, a25=1, a27=1, a9=18, b=2, c=3, d=4, e=5, E_1=2, E_M=2, f=6, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, token=0] [L11588] RET fire_delta_events() VAL [a=1, a12=4, a15=1, a16=1, a2=10, a20=5, a25=1, a27=1, a9=18, b=2, c=3, d=4, e=5, E_1=2, E_M=2, f=6, kernel_st=0, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, token=0] [L11589] CALL activate_threads() VAL [\old(m_st)=0, \old(t1_st)=0, a=1, a12=4, a15=1, a16=1, a2=10, a20=5, a25=1, a27=1, a9=18, b=2, c=3, d=4, e=5, E_1=2, E_M=2, f=6, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, token=0] [L11477] int tmp ; [L11478] int tmp___0 ; [L11482] CALL, EXPR is_master_triggered() [L11286] int __retres1 ; VAL [\old(m_st)=0, \old(t1_st)=0, a=1, a12=4, a15=1, a16=1, a2=10, a20=5, a25=1, a27=1, a9=18, b=2, c=3, d=4, e=5, E_1=2, E_M=2, f=6, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, token=0] [L11289] COND FALSE !(m_pc == 1) VAL [\old(m_st)=0, \old(t1_st)=0, a=1, a12=4, a15=1, a16=1, a2=10, a20=5, a25=1, a27=1, a9=18, b=2, c=3, d=4, e=5, E_1=2, E_M=2, f=6, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, token=0] [L11299] __retres1 = 0 VAL [\old(m_st)=0, \old(t1_st)=0, __retres1=0, a=1, a12=4, a15=1, a16=1, a2=10, a20=5, a25=1, a27=1, a9=18, b=2, c=3, d=4, e=5, E_1=2, E_M=2, f=6, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, token=0] [L11301] return (__retres1); VAL [\old(m_st)=0, \old(t1_st)=0, \result=0, __retres1=0, a=1, a12=4, a15=1, a16=1, a2=10, a20=5, a25=1, a27=1, a9=18, b=2, c=3, d=4, e=5, E_1=2, E_M=2, f=6, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, token=0] [L11482] RET, EXPR is_master_triggered() [L11482] tmp = is_master_triggered() [L11484] COND FALSE !(\read(tmp)) VAL [\old(m_st)=0, \old(t1_st)=0, a=1, a12=4, a15=1, a16=1, a2=10, a20=5, a25=1, a27=1, a9=18, b=2, c=3, d=4, e=5, E_1=2, E_M=2, f=6, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, tmp=0, token=0] [L11490] CALL, EXPR is_transmit1_triggered() [L11305] int __retres1 ; VAL [\old(m_st)=0, \old(t1_st)=0, a=1, a12=4, a15=1, a16=1, a2=10, a20=5, a25=1, a27=1, a9=18, b=2, c=3, d=4, e=5, E_1=2, E_M=2, f=6, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, token=0] [L11308] COND FALSE !(t1_pc == 1) VAL [\old(m_st)=0, \old(t1_st)=0, a=1, a12=4, a15=1, a16=1, a2=10, a20=5, a25=1, a27=1, a9=18, b=2, c=3, d=4, e=5, E_1=2, E_M=2, f=6, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, token=0] [L11318] __retres1 = 0 VAL [\old(m_st)=0, \old(t1_st)=0, __retres1=0, a=1, a12=4, a15=1, a16=1, a2=10, a20=5, a25=1, a27=1, a9=18, b=2, c=3, d=4, e=5, E_1=2, E_M=2, f=6, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, token=0] [L11320] return (__retres1); VAL [\old(m_st)=0, \old(t1_st)=0, \result=0, __retres1=0, a=1, a12=4, a15=1, a16=1, a2=10, a20=5, a25=1, a27=1, a9=18, b=2, c=3, d=4, e=5, E_1=2, E_M=2, f=6, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, token=0] [L11490] RET, EXPR is_transmit1_triggered() [L11490] tmp___0 = is_transmit1_triggered() [L11492] COND FALSE !(\read(tmp___0)) VAL [\old(m_st)=0, \old(t1_st)=0, a=1, a12=4, a15=1, a16=1, a2=10, a20=5, a25=1, a27=1, a9=18, b=2, c=3, d=4, e=5, E_1=2, E_M=2, f=6, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, tmp=0, tmp___0=0, token=0] [L11589] RET activate_threads() VAL [a=1, a12=4, a15=1, a16=1, a2=10, a20=5, a25=1, a27=1, a9=18, b=2, c=3, d=4, e=5, E_1=2, E_M=2, f=6, kernel_st=0, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, token=0] [L11590] CALL reset_delta_events() VAL [\old(E_1)=2, \old(E_M)=2, \old(M_E)=2, \old(T1_E)=2, a=1, a12=4, a15=1, a16=1, a2=10, a20=5, a25=1, a27=1, a9=18, b=2, c=3, d=4, e=5, E_1=2, E_M=2, f=6, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, token=0] [L11452] COND FALSE !(M_E == 1) VAL [\old(E_1)=2, \old(E_M)=2, \old(M_E)=2, \old(T1_E)=2, a=1, a12=4, a15=1, a16=1, a2=10, a20=5, a25=1, a27=1, a9=18, b=2, c=3, d=4, e=5, E_1=2, E_M=2, f=6, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, token=0] [L11457] COND FALSE !(T1_E == 1) VAL [\old(E_1)=2, \old(E_M)=2, \old(M_E)=2, \old(T1_E)=2, a=1, a12=4, a15=1, a16=1, a2=10, a20=5, a25=1, a27=1, a9=18, b=2, c=3, d=4, e=5, E_1=2, E_M=2, f=6, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, token=0] [L11462] COND FALSE !(E_M == 1) VAL [\old(E_1)=2, \old(E_M)=2, \old(M_E)=2, \old(T1_E)=2, a=1, a12=4, a15=1, a16=1, a2=10, a20=5, a25=1, a27=1, a9=18, b=2, c=3, d=4, e=5, E_1=2, E_M=2, f=6, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, token=0] [L11467] COND FALSE !(E_1 == 1) VAL [\old(E_1)=2, \old(E_M)=2, \old(M_E)=2, \old(T1_E)=2, a=1, a12=4, a15=1, a16=1, a2=10, a20=5, a25=1, a27=1, a9=18, b=2, c=3, d=4, e=5, E_1=2, E_M=2, f=6, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, token=0] [L11590] RET reset_delta_events() VAL [a=1, a12=4, a15=1, a16=1, a2=10, a20=5, a25=1, a27=1, a9=18, b=2, c=3, d=4, e=5, E_1=2, E_M=2, f=6, kernel_st=0, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, token=0] [L11593] COND TRUE 1 VAL [a=1, a12=4, a15=1, a16=1, a2=10, a20=5, a25=1, a27=1, a9=18, b=2, c=3, d=4, e=5, E_1=2, E_M=2, f=6, kernel_st=0, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, token=0] [L11596] kernel_st = 1 [L11597] CALL eval() [L11371] int tmp ; VAL [a=1, a12=4, a15=1, a16=1, a2=10, a20=5, a25=1, a27=1, a9=18, b=2, c=3, d=4, e=5, E_1=2, E_M=2, f=6, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, token=0] [L11375] COND TRUE 1 VAL [a=1, a12=4, a15=1, a16=1, a2=10, a20=5, a25=1, a27=1, a9=18, b=2, c=3, d=4, e=5, E_1=2, E_M=2, f=6, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, token=0] [L11378] CALL, EXPR exists_runnable_thread() VAL [a=1, a12=4, a15=1, a16=1, a2=10, a20=5, a25=1, a27=1, a9=18, b=2, c=3, d=4, e=5, E_1=2, E_M=2, f=6, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, token=0] [L11350] int __retres1 ; VAL [a=1, a12=4, a15=1, a16=1, a2=10, a20=5, a25=1, a27=1, a9=18, b=2, c=3, d=4, e=5, E_1=2, E_M=2, f=6, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, token=0] [L11353] COND TRUE m_st == 0 [L11354] __retres1 = 1 VAL [__retres1=1, a=1, a12=4, a15=1, a16=1, a2=10, a20=5, a25=1, a27=1, a9=18, b=2, c=3, d=4, e=5, E_1=2, E_M=2, f=6, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, token=0] [L11366] return (__retres1); VAL [\result=1, __retres1=1, a=1, a12=4, a15=1, a16=1, a2=10, a20=5, a25=1, a27=1, a9=18, b=2, c=3, d=4, e=5, E_1=2, E_M=2, f=6, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, token=0] [L11378] RET, EXPR exists_runnable_thread() VAL [a=1, a12=4, a15=1, a16=1, a2=10, a20=5, a25=1, a27=1, a9=18, b=2, c=3, d=4, e=5, E_1=2, E_M=2, exists_runnable_thread()=1, f=6, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, token=0] [L11378] tmp = exists_runnable_thread() [L11380] COND TRUE \read(tmp) VAL [a=1, a12=4, a15=1, a16=1, a2=10, a20=5, a25=1, a27=1, a9=18, b=2, c=3, d=4, e=5, E_1=2, E_M=2, f=6, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, tmp=1, token=0] [L11385] COND TRUE m_st == 0 [L11386] int tmp_ndt_1; [L11387] tmp_ndt_1 = __VERIFIER_nondet_int() [L11388] COND FALSE !(\read(tmp_ndt_1)) VAL [a=1, a12=4, a15=1, a16=1, a2=10, a20=5, a25=1, a27=1, a9=18, b=2, c=3, d=4, e=5, E_1=2, E_M=2, f=6, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, tmp=1, tmp_ndt_1=0, token=0] [L11399] COND TRUE t1_st == 0 [L11400] int tmp_ndt_2; [L11401] tmp_ndt_2 = __VERIFIER_nondet_int() [L11402] COND TRUE \read(tmp_ndt_2) [L11404] t1_st = 1 [L11405] CALL transmit1() [L11253] COND TRUE t1_pc == 0 VAL [a=1, a12=4, a15=1, a16=1, a2=10, a20=5, a25=1, a27=1, a9=18, b=2, c=3, d=4, e=5, E_1=2, E_M=2, f=6, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=1, token=0] [L11264] COND TRUE 1 VAL [a=1, a12=4, a15=1, a16=1, a2=10, a20=5, a25=1, a27=1, a9=18, b=2, c=3, d=4, e=5, E_1=2, E_M=2, f=6, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=1, token=0] [L11266] t1_pc = 1 [L11267] t1_st = 2 VAL [a=1, a12=4, a15=1, a16=1, a2=10, a20=5, a25=1, a27=1, a9=18, b=2, c=3, d=4, e=5, E_1=2, E_M=2, f=6, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, token=0] [L11405] RET transmit1() [L11375] COND TRUE 1 VAL [a=1, a12=4, a15=1, a16=1, a2=10, a20=5, a25=1, a27=1, a9=18, b=2, c=3, d=4, e=5, E_1=2, E_M=2, f=6, local=0, M_E=2, m_i=1, m_pc=0, m_st=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] [L11378] CALL, EXPR exists_runnable_thread() VAL [a=1, a12=4, a15=1, a16=1, a2=10, a20=5, a25=1, a27=1, a9=18, b=2, c=3, d=4, e=5, E_1=2, E_M=2, f=6, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, token=0] [L11350] int __retres1 ; VAL [a=1, a12=4, a15=1, a16=1, a2=10, a20=5, a25=1, a27=1, a9=18, b=2, c=3, d=4, e=5, E_1=2, E_M=2, f=6, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, token=0] [L11353] COND TRUE m_st == 0 [L11354] __retres1 = 1 VAL [__retres1=1, a=1, a12=4, a15=1, a16=1, a2=10, a20=5, a25=1, a27=1, a9=18, b=2, c=3, d=4, e=5, E_1=2, E_M=2, f=6, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, token=0] [L11366] return (__retres1); VAL [\result=1, __retres1=1, a=1, a12=4, a15=1, a16=1, a2=10, a20=5, a25=1, a27=1, a9=18, b=2, c=3, d=4, e=5, E_1=2, E_M=2, f=6, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, token=0] [L11378] RET, EXPR exists_runnable_thread() VAL [a=1, a12=4, a15=1, a16=1, a2=10, a20=5, a25=1, a27=1, a9=18, b=2, c=3, d=4, e=5, E_1=2, E_M=2, exists_runnable_thread()=1, f=6, local=0, M_E=2, m_i=1, m_pc=0, m_st=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] [L11378] tmp = exists_runnable_thread() [L11380] COND TRUE \read(tmp) VAL [a=1, a12=4, a15=1, a16=1, a2=10, a20=5, a25=1, a27=1, a9=18, b=2, c=3, d=4, e=5, E_1=2, E_M=2, f=6, local=0, M_E=2, m_i=1, m_pc=0, m_st=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] [L11385] COND TRUE m_st == 0 [L11386] int tmp_ndt_1; [L11387] tmp_ndt_1 = __VERIFIER_nondet_int() [L11388] COND TRUE \read(tmp_ndt_1) [L11390] m_st = 1 [L11391] CALL master() [L11195] int tmp_var = __VERIFIER_nondet_int(); [L11197] COND TRUE m_pc == 0 VAL [a=1, a12=4, a15=1, a16=1, a2=10, a20=5, a25=1, a27=1, a9=18, b=2, c=3, d=4, e=5, E_1=2, E_M=2, f=6, local=0, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, tmp_var=0, token=0] [L11208] COND TRUE 1 VAL [a=1, a12=4, a15=1, a16=1, a2=10, a20=5, a25=1, a27=1, a9=18, b=2, c=3, d=4, e=5, E_1=2, E_M=2, f=6, local=0, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, tmp_var=0, token=0] [L11211] token = __VERIFIER_nondet_int() [L11212] local = token [L11213] E_1 = 1 VAL [a=1, a12=4, a15=1, a16=1, a2=10, a20=5, a25=1, a27=1, a9=18, b=2, c=3, d=4, e=5, E_1=1, E_M=2, f=6, local=0, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, tmp_var=0, token=0] [L11214] CALL immediate_notify() VAL [\old(m_st)=1, \old(t1_st)=2, a=1, a12=4, a15=1, a16=1, a2=10, a20=5, a25=1, a27=1, a9=18, b=2, c=3, d=4, e=5, E_1=1, E_M=2, f=6, local=0, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, token=0] [L11506] CALL activate_threads() VAL [\old(m_st)=1, \old(t1_st)=2, a=1, a12=4, a15=1, a16=1, a2=10, a20=5, a25=1, a27=1, a9=18, b=2, c=3, d=4, e=5, E_1=1, E_M=2, f=6, local=0, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, token=0] [L11477] int tmp ; [L11478] int tmp___0 ; [L11482] CALL, EXPR is_master_triggered() [L11286] int __retres1 ; VAL [\old(m_st)=1, \old(t1_st)=2, a=1, a12=4, a15=1, a16=1, a2=10, a20=5, a25=1, a27=1, a9=18, b=2, c=3, d=4, e=5, E_1=1, E_M=2, f=6, local=0, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, token=0] [L11289] COND FALSE !(m_pc == 1) VAL [\old(m_st)=1, \old(t1_st)=2, a=1, a12=4, a15=1, a16=1, a2=10, a20=5, a25=1, a27=1, a9=18, b=2, c=3, d=4, e=5, E_1=1, E_M=2, f=6, local=0, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, token=0] [L11299] __retres1 = 0 VAL [\old(m_st)=1, \old(t1_st)=2, __retres1=0, a=1, a12=4, a15=1, a16=1, a2=10, a20=5, a25=1, a27=1, a9=18, b=2, c=3, d=4, e=5, E_1=1, E_M=2, f=6, local=0, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, token=0] [L11301] return (__retres1); VAL [\old(m_st)=1, \old(t1_st)=2, \result=0, __retres1=0, a=1, a12=4, a15=1, a16=1, a2=10, a20=5, a25=1, a27=1, a9=18, b=2, c=3, d=4, e=5, E_1=1, E_M=2, f=6, local=0, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, token=0] [L11482] RET, EXPR is_master_triggered() [L11482] tmp = is_master_triggered() [L11484] COND FALSE !(\read(tmp)) VAL [\old(m_st)=1, \old(t1_st)=2, a=1, a12=4, a15=1, a16=1, a2=10, a20=5, a25=1, a27=1, a9=18, b=2, c=3, d=4, e=5, E_1=1, E_M=2, f=6, local=0, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, tmp=0, token=0] [L11490] CALL, EXPR is_transmit1_triggered() [L11305] int __retres1 ; VAL [\old(m_st)=1, \old(t1_st)=2, a=1, a12=4, a15=1, a16=1, a2=10, a20=5, a25=1, a27=1, a9=18, b=2, c=3, d=4, e=5, E_1=1, E_M=2, f=6, local=0, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, token=0] [L11308] COND TRUE t1_pc == 1 VAL [\old(m_st)=1, \old(t1_st)=2, a=1, a12=4, a15=1, a16=1, a2=10, a20=5, a25=1, a27=1, a9=18, b=2, c=3, d=4, e=5, E_1=1, E_M=2, f=6, local=0, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, token=0] [L11309] COND TRUE E_1 == 1 [L11310] __retres1 = 1 VAL [\old(m_st)=1, \old(t1_st)=2, __retres1=1, a=1, a12=4, a15=1, a16=1, a2=10, a20=5, a25=1, a27=1, a9=18, b=2, c=3, d=4, e=5, E_1=1, E_M=2, f=6, local=0, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, token=0] [L11320] return (__retres1); VAL [\old(m_st)=1, \old(t1_st)=2, \result=1, __retres1=1, a=1, a12=4, a15=1, a16=1, a2=10, a20=5, a25=1, a27=1, a9=18, b=2, c=3, d=4, e=5, E_1=1, E_M=2, f=6, local=0, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, token=0] [L11490] RET, EXPR is_transmit1_triggered() [L11490] tmp___0 = is_transmit1_triggered() [L11492] COND TRUE \read(tmp___0) [L11493] t1_st = 0 VAL [\old(m_st)=1, \old(t1_st)=2, a=1, a12=4, a15=1, a16=1, a2=10, a20=5, a25=1, a27=1, a9=18, b=2, c=3, d=4, e=5, E_1=1, E_M=2, f=6, local=0, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=0, tmp=0, tmp___0=1, token=0] [L11506] RET activate_threads() VAL [\old(m_st)=1, \old(t1_st)=2, a=1, a12=4, a15=1, a16=1, a2=10, a20=5, a25=1, a27=1, a9=18, b=2, c=3, d=4, e=5, E_1=1, E_M=2, f=6, local=0, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=0, token=0] [L11214] RET immediate_notify() VAL [a=1, a12=4, a15=1, a16=1, a2=10, a20=5, a25=1, a27=1, a9=18, b=2, c=3, d=4, e=5, E_1=1, E_M=2, f=6, local=0, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=0, tmp_var=0, token=0] [L11215] E_1 = 2 [L11216] m_pc = 1 [L11217] m_st = 2 VAL [a=1, a12=4, a15=1, a16=1, a2=10, a20=5, a25=1, a27=1, a9=18, b=2, c=3, d=4, e=5, E_1=2, E_M=2, f=6, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=0, tmp_var=0, token=0] [L11391] RET master() [L11399] COND TRUE t1_st == 0 [L11400] int tmp_ndt_2; [L11401] tmp_ndt_2 = __VERIFIER_nondet_int() [L11402] COND TRUE \read(tmp_ndt_2) [L11404] t1_st = 1 [L11405] CALL transmit1() [L11253] COND FALSE !(t1_pc == 0) VAL [a=1, a12=4, a15=1, a16=1, a2=10, a20=5, a25=1, a27=1, a9=18, b=2, c=3, d=4, e=5, E_1=2, E_M=2, f=6, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, token=0] [L11256] COND TRUE t1_pc == 1 VAL [a=1, a12=4, a15=1, a16=1, a2=10, a20=5, a25=1, a27=1, a9=18, b=2, c=3, d=4, e=5, E_1=2, E_M=2, f=6, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, token=0] [L11272] token += 1 [L11273] E_M = 1 VAL [a=1, a12=4, a15=1, a16=1, a2=10, a20=5, a25=1, a27=1, a9=18, b=2, c=3, d=4, e=5, E_1=2, E_M=1, f=6, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, token=1] [L11274] CALL immediate_notify() VAL [\old(m_st)=2, \old(t1_st)=1, a=1, a12=4, a15=1, a16=1, a2=10, a20=5, a25=1, a27=1, a9=18, b=2, c=3, d=4, e=5, E_1=2, E_M=1, f=6, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, token=1] [L11506] CALL activate_threads() VAL [\old(m_st)=2, \old(t1_st)=1, a=1, a12=4, a15=1, a16=1, a2=10, a20=5, a25=1, a27=1, a9=18, b=2, c=3, d=4, e=5, E_1=2, E_M=1, f=6, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, token=1] [L11477] int tmp ; [L11478] int tmp___0 ; [L11482] CALL, EXPR is_master_triggered() [L11286] int __retres1 ; VAL [\old(m_st)=2, \old(t1_st)=1, a=1, a12=4, a15=1, a16=1, a2=10, a20=5, a25=1, a27=1, a9=18, b=2, c=3, d=4, e=5, E_1=2, E_M=1, f=6, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, token=1] [L11289] COND TRUE m_pc == 1 VAL [\old(m_st)=2, \old(t1_st)=1, a=1, a12=4, a15=1, a16=1, a2=10, a20=5, a25=1, a27=1, a9=18, b=2, c=3, d=4, e=5, E_1=2, E_M=1, f=6, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, token=1] [L11290] COND TRUE E_M == 1 [L11291] __retres1 = 1 VAL [\old(m_st)=2, \old(t1_st)=1, __retres1=1, a=1, a12=4, a15=1, a16=1, a2=10, a20=5, a25=1, a27=1, a9=18, b=2, c=3, d=4, e=5, E_1=2, E_M=1, f=6, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, token=1] [L11301] return (__retres1); VAL [\old(m_st)=2, \old(t1_st)=1, \result=1, __retres1=1, a=1, a12=4, a15=1, a16=1, a2=10, a20=5, a25=1, a27=1, a9=18, b=2, c=3, d=4, e=5, E_1=2, E_M=1, f=6, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, token=1] [L11482] RET, EXPR is_master_triggered() [L11482] tmp = is_master_triggered() [L11484] COND TRUE \read(tmp) [L11485] m_st = 0 VAL [\old(m_st)=2, \old(t1_st)=1, a=1, a12=4, a15=1, a16=1, a2=10, a20=5, a25=1, a27=1, a9=18, b=2, c=3, d=4, e=5, E_1=2, E_M=1, f=6, local=0, M_E=2, m_i=1, m_pc=1, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, tmp=1, token=1] [L11490] CALL, EXPR is_transmit1_triggered() [L11305] int __retres1 ; VAL [\old(m_st)=2, \old(t1_st)=1, a=1, a12=4, a15=1, a16=1, a2=10, a20=5, a25=1, a27=1, a9=18, b=2, c=3, d=4, e=5, E_1=2, E_M=1, f=6, local=0, M_E=2, m_i=1, m_pc=1, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, token=1] [L11308] COND TRUE t1_pc == 1 VAL [\old(m_st)=2, \old(t1_st)=1, a=1, a12=4, a15=1, a16=1, a2=10, a20=5, a25=1, a27=1, a9=18, b=2, c=3, d=4, e=5, E_1=2, E_M=1, f=6, local=0, M_E=2, m_i=1, m_pc=1, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, token=1] [L11309] COND FALSE !(E_1 == 1) VAL [\old(m_st)=2, \old(t1_st)=1, a=1, a12=4, a15=1, a16=1, a2=10, a20=5, a25=1, a27=1, a9=18, b=2, c=3, d=4, e=5, E_1=2, E_M=1, f=6, local=0, M_E=2, m_i=1, m_pc=1, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, token=1] [L11318] __retres1 = 0 VAL [\old(m_st)=2, \old(t1_st)=1, __retres1=0, a=1, a12=4, a15=1, a16=1, a2=10, a20=5, a25=1, a27=1, a9=18, b=2, c=3, d=4, e=5, E_1=2, E_M=1, f=6, local=0, M_E=2, m_i=1, m_pc=1, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, token=1] [L11320] return (__retres1); VAL [\old(m_st)=2, \old(t1_st)=1, \result=0, __retres1=0, a=1, a12=4, a15=1, a16=1, a2=10, a20=5, a25=1, a27=1, a9=18, b=2, c=3, d=4, e=5, E_1=2, E_M=1, f=6, local=0, M_E=2, m_i=1, m_pc=1, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, token=1] [L11490] RET, EXPR is_transmit1_triggered() [L11490] tmp___0 = is_transmit1_triggered() [L11492] COND FALSE !(\read(tmp___0)) VAL [\old(m_st)=2, \old(t1_st)=1, a=1, a12=4, a15=1, a16=1, a2=10, a20=5, a25=1, a27=1, a9=18, b=2, c=3, d=4, e=5, E_1=2, E_M=1, f=6, local=0, M_E=2, m_i=1, m_pc=1, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, tmp=1, tmp___0=0, token=1] [L11506] RET activate_threads() VAL [\old(m_st)=2, \old(t1_st)=1, a=1, a12=4, a15=1, a16=1, a2=10, a20=5, a25=1, a27=1, a9=18, b=2, c=3, d=4, e=5, E_1=2, E_M=1, f=6, local=0, M_E=2, m_i=1, m_pc=1, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, token=1] [L11274] RET immediate_notify() VAL [a=1, a12=4, a15=1, a16=1, a2=10, a20=5, a25=1, a27=1, a9=18, b=2, c=3, d=4, e=5, E_1=2, E_M=1, f=6, local=0, M_E=2, m_i=1, m_pc=1, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, token=1] [L11275] E_M = 2 VAL [a=1, a12=4, a15=1, a16=1, a2=10, a20=5, a25=1, a27=1, a9=18, b=2, c=3, d=4, e=5, E_1=2, E_M=2, f=6, local=0, M_E=2, m_i=1, m_pc=1, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, token=1] [L11264] COND TRUE 1 VAL [a=1, a12=4, a15=1, a16=1, a2=10, a20=5, a25=1, a27=1, a9=18, b=2, c=3, d=4, e=5, E_1=2, E_M=2, f=6, local=0, M_E=2, m_i=1, m_pc=1, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, token=1] [L11266] t1_pc = 1 [L11267] t1_st = 2 VAL [a=1, a12=4, a15=1, a16=1, a2=10, a20=5, a25=1, a27=1, a9=18, b=2, c=3, d=4, e=5, E_1=2, E_M=2, f=6, local=0, M_E=2, m_i=1, m_pc=1, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, token=1] [L11405] RET transmit1() [L11375] COND TRUE 1 VAL [a=1, a12=4, a15=1, a16=1, a2=10, a20=5, a25=1, a27=1, a9=18, b=2, c=3, d=4, e=5, E_1=2, E_M=2, f=6, local=0, M_E=2, m_i=1, m_pc=1, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, tmp=1, tmp_ndt_1=1, tmp_ndt_2=-2, token=1] [L11378] CALL, EXPR exists_runnable_thread() VAL [a=1, a12=4, a15=1, a16=1, a2=10, a20=5, a25=1, a27=1, a9=18, b=2, c=3, d=4, e=5, E_1=2, E_M=2, f=6, local=0, M_E=2, m_i=1, m_pc=1, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, token=1] [L11350] int __retres1 ; VAL [a=1, a12=4, a15=1, a16=1, a2=10, a20=5, a25=1, a27=1, a9=18, b=2, c=3, d=4, e=5, E_1=2, E_M=2, f=6, local=0, M_E=2, m_i=1, m_pc=1, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, token=1] [L11353] COND TRUE m_st == 0 [L11354] __retres1 = 1 VAL [__retres1=1, a=1, a12=4, a15=1, a16=1, a2=10, a20=5, a25=1, a27=1, a9=18, b=2, c=3, d=4, e=5, E_1=2, E_M=2, f=6, local=0, M_E=2, m_i=1, m_pc=1, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, token=1] [L11366] return (__retres1); VAL [\result=1, __retres1=1, a=1, a12=4, a15=1, a16=1, a2=10, a20=5, a25=1, a27=1, a9=18, b=2, c=3, d=4, e=5, E_1=2, E_M=2, f=6, local=0, M_E=2, m_i=1, m_pc=1, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, token=1] [L11378] RET, EXPR exists_runnable_thread() VAL [a=1, a12=4, a15=1, a16=1, a2=10, a20=5, a25=1, a27=1, a9=18, b=2, c=3, d=4, e=5, E_1=2, E_M=2, exists_runnable_thread()=1, f=6, local=0, M_E=2, m_i=1, m_pc=1, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, tmp=1, tmp_ndt_1=1, tmp_ndt_2=-2, token=1] [L11378] tmp = exists_runnable_thread() [L11380] COND TRUE \read(tmp) VAL [a=1, a12=4, a15=1, a16=1, a2=10, a20=5, a25=1, a27=1, a9=18, b=2, c=3, d=4, e=5, E_1=2, E_M=2, f=6, local=0, M_E=2, m_i=1, m_pc=1, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, tmp=1, tmp_ndt_1=1, tmp_ndt_2=-2, token=1] [L11385] COND TRUE m_st == 0 [L11386] int tmp_ndt_1; [L11387] tmp_ndt_1 = __VERIFIER_nondet_int() [L11388] COND TRUE \read(tmp_ndt_1) [L11390] m_st = 1 [L11391] CALL master() [L11195] int tmp_var = __VERIFIER_nondet_int(); [L11197] COND FALSE !(m_pc == 0) VAL [a=1, a12=4, a15=1, a16=1, a2=10, a20=5, a25=1, a27=1, a9=18, b=2, c=3, d=4, e=5, E_1=2, E_M=2, f=6, local=0, M_E=2, m_i=1, m_pc=1, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, tmp_var=5, token=1] [L11200] COND TRUE m_pc == 1 VAL [a=1, a12=4, a15=1, a16=1, a2=10, a20=5, a25=1, a27=1, a9=18, b=2, c=3, d=4, e=5, E_1=2, E_M=2, f=6, local=0, M_E=2, m_i=1, m_pc=1, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, tmp_var=5, token=1] [L11222] COND FALSE !(token != local + 1) VAL [a=1, a12=4, a15=1, a16=1, a2=10, a20=5, a25=1, a27=1, a9=18, b=2, c=3, d=4, e=5, E_1=2, E_M=2, f=6, local=0, M_E=2, m_i=1, m_pc=1, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, tmp_var=5, token=1] [L11227] COND TRUE tmp_var <= 5 VAL [a=1, a12=4, a15=1, a16=1, a2=10, a20=5, a25=1, a27=1, a9=18, b=2, c=3, d=4, e=5, E_1=2, E_M=2, f=6, local=0, M_E=2, m_i=1, m_pc=1, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, tmp_var=5, token=1] [L11228] COND TRUE tmp_var >= 5 VAL [a=1, a12=4, a15=1, a16=1, a2=10, a20=5, a25=1, a27=1, a9=18, b=2, c=3, d=4, e=5, E_1=2, E_M=2, f=6, local=0, M_E=2, m_i=1, m_pc=1, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, tmp_var=5, token=1] [L11233] COND TRUE tmp_var <= 5 VAL [a=1, a12=4, a15=1, a16=1, a2=10, a20=5, a25=1, a27=1, a9=18, b=2, c=3, d=4, e=5, E_1=2, E_M=2, f=6, local=0, M_E=2, m_i=1, m_pc=1, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, tmp_var=5, token=1] [L11234] COND TRUE tmp_var >= 5 VAL [a=1, a12=4, a15=1, a16=1, a2=10, a20=5, a25=1, a27=1, a9=18, b=2, c=3, d=4, e=5, E_1=2, E_M=2, f=6, local=0, M_E=2, m_i=1, m_pc=1, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, tmp_var=5, token=1] [L11235] COND TRUE tmp_var == 5 VAL [a=1, a12=4, a15=1, a16=1, a2=10, a20=5, a25=1, a27=1, a9=18, b=2, c=3, d=4, e=5, E_1=2, E_M=2, f=6, local=0, M_E=2, m_i=1, m_pc=1, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, tmp_var=5, token=1] [L11236] CALL error() VAL [a=1, a12=4, a15=1, a16=1, a2=10, a20=5, a25=1, a27=1, a9=18, b=2, c=3, d=4, e=5, E_1=2, E_M=2, f=6, local=0, M_E=2, m_i=1, m_pc=1, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, token=1] [L11173] reach_error() VAL [a=1, a12=4, a15=1, a16=1, a2=10, a20=5, a25=1, a27=1, a9=18, b=2, c=3, d=4, e=5, E_1=2, E_M=2, f=6, local=0, M_E=2, m_i=1, m_pc=1, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, token=1] - UnprovableResult [Line: 11088]: 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 8 procedures, 2298 locations, 2 error locations. Started 1 CEGAR loops. OverallTime: 14.0s, OverallIterations: 17, TraceHistogramMax: 3, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.1s, AutomataDifference: 6.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 46867 SdHoareTripleChecker+Valid, 3.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 46759 mSDsluCounter, 213808 SdHoareTripleChecker+Invalid, 2.4s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 147255 mSDsCounter, 543 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 3724 IncrementalHoareTripleChecker+Invalid, 4267 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 543 mSolverCounterUnsat, 66553 mSDtfsCounter, 3724 mSolverCounterSat, 0.3s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 1605 GetRequests, 1460 SyntacticMatches, 4 SemanticMatches, 141 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 175 ImplicationChecksByTransitivity, 1.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=6635occurred in iteration=8, InterpolantAutomatonStates: 120, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 2.3s AutomataMinimizationTime, 16 MinimizatonAttempts, 3064 StatesRemovedByMinimization, 15 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.2s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 2.0s InterpolantComputationTime, 3044 NumberOfCodeBlocks, 3044 NumberOfCodeBlocksAsserted, 26 NumberOfCheckSat, 2877 ConstructedInterpolants, 0 QuantifiedInterpolants, 4651 SizeOfPredicates, 6 NumberOfNonLiveVariables, 3878 ConjunctsInSsa, 38 ConjunctsInUnsatCore, 25 InterpolantComputations, 16 PerfectInterpolantSequences, 1302/1472 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 08:19:29,010 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