./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/combinations/Problem05_label45+token_ring.02.cil-2.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 839c364b Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/combinations/Problem05_label45+token_ring.02.cil-2.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 5d56dff15b0de2a89db18b71695d59ff3710bc2ebb344dc571e9d71343d9d530 --- Real Ultimate output --- This is Ultimate 0.2.2-839c364b5d67a0f615c82cb70ab247790648d4a9-839c364 [2021-12-14 15:43:29,525 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-12-14 15:43:29,527 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-12-14 15:43:29,588 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-12-14 15:43:29,588 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-12-14 15:43:29,591 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-12-14 15:43:29,592 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-12-14 15:43:29,594 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-12-14 15:43:29,595 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-12-14 15:43:29,598 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-12-14 15:43:29,599 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-12-14 15:43:29,600 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-12-14 15:43:29,600 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-12-14 15:43:29,602 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-12-14 15:43:29,603 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-12-14 15:43:29,605 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-12-14 15:43:29,607 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-12-14 15:43:29,607 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-12-14 15:43:29,609 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-12-14 15:43:29,613 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-12-14 15:43:29,614 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-12-14 15:43:29,615 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-12-14 15:43:29,616 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-12-14 15:43:29,616 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-12-14 15:43:29,621 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-12-14 15:43:29,621 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-12-14 15:43:29,621 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-12-14 15:43:29,622 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-12-14 15:43:29,623 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-12-14 15:43:29,623 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-12-14 15:43:29,623 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-12-14 15:43:29,624 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-12-14 15:43:29,625 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-12-14 15:43:29,626 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-12-14 15:43:29,627 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-12-14 15:43:29,627 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-12-14 15:43:29,627 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-12-14 15:43:29,628 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-12-14 15:43:29,628 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-12-14 15:43:29,628 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-12-14 15:43:29,629 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-12-14 15:43:29,630 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2021-12-14 15:43:29,656 INFO L113 SettingsManager]: Loading preferences was successful [2021-12-14 15:43:29,656 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-12-14 15:43:29,657 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2021-12-14 15:43:29,657 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2021-12-14 15:43:29,657 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2021-12-14 15:43:29,658 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2021-12-14 15:43:29,658 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-12-14 15:43:29,658 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-12-14 15:43:29,658 INFO L138 SettingsManager]: * Use SBE=true [2021-12-14 15:43:29,659 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-12-14 15:43:29,659 INFO L138 SettingsManager]: * sizeof long=4 [2021-12-14 15:43:29,659 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-12-14 15:43:29,659 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-12-14 15:43:29,660 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-12-14 15:43:29,660 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-12-14 15:43:29,660 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-12-14 15:43:29,660 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-12-14 15:43:29,660 INFO L138 SettingsManager]: * sizeof long double=12 [2021-12-14 15:43:29,660 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-12-14 15:43:29,661 INFO L138 SettingsManager]: * Use constant arrays=true [2021-12-14 15:43:29,661 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-12-14 15:43:29,661 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-12-14 15:43:29,661 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-12-14 15:43:29,661 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-12-14 15:43:29,661 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-12-14 15:43:29,662 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-12-14 15:43:29,662 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-12-14 15:43:29,662 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-12-14 15:43:29,662 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-12-14 15:43:29,662 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-12-14 15:43:29,662 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2021-12-14 15:43:29,663 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2021-12-14 15:43:29,663 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2021-12-14 15:43:29,663 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-12-14 15:43:29,663 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 -> 5d56dff15b0de2a89db18b71695d59ff3710bc2ebb344dc571e9d71343d9d530 [2021-12-14 15:43:29,852 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-12-14 15:43:29,870 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-12-14 15:43:29,872 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-12-14 15:43:29,873 INFO L271 PluginConnector]: Initializing CDTParser... [2021-12-14 15:43:29,873 INFO L275 PluginConnector]: CDTParser initialized [2021-12-14 15:43:29,874 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/combinations/Problem05_label45+token_ring.02.cil-2.c [2021-12-14 15:43:29,931 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/72def79ce/5d203eeac3a64b1a98bd902d2d36d7f7/FLAGf012a51e0 [2021-12-14 15:43:30,587 INFO L306 CDTParser]: Found 1 translation units. [2021-12-14 15:43:30,588 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/combinations/Problem05_label45+token_ring.02.cil-2.c [2021-12-14 15:43:30,618 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/72def79ce/5d203eeac3a64b1a98bd902d2d36d7f7/FLAGf012a51e0 [2021-12-14 15:43:30,900 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/72def79ce/5d203eeac3a64b1a98bd902d2d36d7f7 [2021-12-14 15:43:30,901 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-12-14 15:43:30,902 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-12-14 15:43:30,903 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-12-14 15:43:30,903 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-12-14 15:43:30,906 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-12-14 15:43:30,906 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.12 03:43:30" (1/1) ... [2021-12-14 15:43:30,907 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@640f968f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 03:43:30, skipping insertion in model container [2021-12-14 15:43:30,907 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.12 03:43:30" (1/1) ... [2021-12-14 15:43:30,911 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-12-14 15:43:31,052 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-12-14 15:43:32,182 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.02.cil-2.c[380323,380336] [2021-12-14 15:43:32,198 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.02.cil-2.c[383339,383352] [2021-12-14 15:43:32,296 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-12-14 15:43:32,303 INFO L203 MainTranslator]: Completed pre-run [2021-12-14 15:43:32,940 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.02.cil-2.c[380323,380336] [2021-12-14 15:43:32,945 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.02.cil-2.c[383339,383352] [2021-12-14 15:43:32,960 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-12-14 15:43:32,999 INFO L208 MainTranslator]: Completed translation [2021-12-14 15:43:32,999 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 03:43:32 WrapperNode [2021-12-14 15:43:33,000 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-12-14 15:43:33,001 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-12-14 15:43:33,001 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-12-14 15:43:33,001 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-12-14 15:43:33,005 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 03:43:32" (1/1) ... [2021-12-14 15:43:33,074 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 03:43:32" (1/1) ... [2021-12-14 15:43:33,332 INFO L137 Inliner]: procedures = 48, calls = 48, calls flagged for inlining = 25, calls inlined = 25, statements flattened = 12624 [2021-12-14 15:43:33,333 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-12-14 15:43:33,334 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-12-14 15:43:33,334 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-12-14 15:43:33,334 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-12-14 15:43:33,340 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 03:43:32" (1/1) ... [2021-12-14 15:43:33,341 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 03:43:32" (1/1) ... [2021-12-14 15:43:33,391 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 03:43:32" (1/1) ... [2021-12-14 15:43:33,392 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 03:43:32" (1/1) ... [2021-12-14 15:43:33,581 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 03:43:32" (1/1) ... [2021-12-14 15:43:33,616 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 03:43:32" (1/1) ... [2021-12-14 15:43:33,663 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 03:43:32" (1/1) ... [2021-12-14 15:43:33,778 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-12-14 15:43:33,780 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-12-14 15:43:33,780 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-12-14 15:43:33,780 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-12-14 15:43:33,782 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 03:43:32" (1/1) ... [2021-12-14 15:43:33,791 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-12-14 15:43:33,798 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-14 15:43:33,820 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2021-12-14 15:43:33,856 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2021-12-14 15:43:33,887 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2021-12-14 15:43:33,887 INFO L130 BoogieDeclarations]: Found specification of procedure error [2021-12-14 15:43:33,887 INFO L138 BoogieDeclarations]: Found implementation of procedure error [2021-12-14 15:43:33,887 INFO L130 BoogieDeclarations]: Found specification of procedure fire_delta_events [2021-12-14 15:43:33,887 INFO L138 BoogieDeclarations]: Found implementation of procedure fire_delta_events [2021-12-14 15:43:33,887 INFO L130 BoogieDeclarations]: Found specification of procedure activate_threads [2021-12-14 15:43:33,887 INFO L138 BoogieDeclarations]: Found implementation of procedure activate_threads [2021-12-14 15:43:33,887 INFO L130 BoogieDeclarations]: Found specification of procedure immediate_notify [2021-12-14 15:43:33,887 INFO L138 BoogieDeclarations]: Found implementation of procedure immediate_notify [2021-12-14 15:43:33,887 INFO L130 BoogieDeclarations]: Found specification of procedure exists_runnable_thread [2021-12-14 15:43:33,887 INFO L138 BoogieDeclarations]: Found implementation of procedure exists_runnable_thread [2021-12-14 15:43:33,887 INFO L130 BoogieDeclarations]: Found specification of procedure reset_delta_events [2021-12-14 15:43:33,887 INFO L138 BoogieDeclarations]: Found implementation of procedure reset_delta_events [2021-12-14 15:43:33,888 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-12-14 15:43:33,888 INFO L130 BoogieDeclarations]: Found specification of procedure update_channels [2021-12-14 15:43:33,888 INFO L138 BoogieDeclarations]: Found implementation of procedure update_channels [2021-12-14 15:43:33,888 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-12-14 15:43:33,888 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-12-14 15:43:33,964 INFO L236 CfgBuilder]: Building ICFG [2021-12-14 15:43:33,965 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2021-12-14 15:43:38,823 INFO L277 CfgBuilder]: Performing block encoding [2021-12-14 15:43:38,843 INFO L296 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-12-14 15:43:38,844 INFO L301 CfgBuilder]: Removed 6 assume(true) statements. [2021-12-14 15:43:38,846 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.12 03:43:38 BoogieIcfgContainer [2021-12-14 15:43:38,847 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-12-14 15:43:38,848 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-12-14 15:43:38,848 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-12-14 15:43:38,851 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-12-14 15:43:38,851 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 14.12 03:43:30" (1/3) ... [2021-12-14 15:43:38,851 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7ae0acd3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.12 03:43:38, skipping insertion in model container [2021-12-14 15:43:38,851 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 03:43:32" (2/3) ... [2021-12-14 15:43:38,852 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7ae0acd3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.12 03:43:38, skipping insertion in model container [2021-12-14 15:43:38,852 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.12 03:43:38" (3/3) ... [2021-12-14 15:43:38,853 INFO L111 eAbstractionObserver]: Analyzing ICFG Problem05_label45+token_ring.02.cil-2.c [2021-12-14 15:43:38,856 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-12-14 15:43:38,856 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2021-12-14 15:43:38,894 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2021-12-14 15:43:38,898 INFO L339 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mLoopAccelerationTechnique=FAST_UPR [2021-12-14 15:43:38,899 INFO L340 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2021-12-14 15:43:38,932 INFO L276 IsEmpty]: Start isEmpty. Operand has 2323 states, 2295 states have (on average 1.857516339869281) internal successors, (4263), 2300 states have internal predecessors, (4263), 18 states have call successors, (18), 7 states have call predecessors, (18), 7 states have return successors, (18), 17 states have call predecessors, (18), 18 states have call successors, (18) [2021-12-14 15:43:38,938 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2021-12-14 15:43:38,939 INFO L506 BasicCegarLoop]: Found error trace [2021-12-14 15:43:38,939 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-14 15:43:38,940 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-14 15:43:38,943 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 15:43:38,943 INFO L85 PathProgramCache]: Analyzing trace with hash -2062992276, now seen corresponding path program 1 times [2021-12-14 15:43:38,949 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-14 15:43:38,949 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1768681193] [2021-12-14 15:43:38,950 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 15:43:38,950 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-14 15:43:39,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 15:43:39,105 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2021-12-14 15:43:39,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 15:43:39,140 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2021-12-14 15:43:39,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 15:43:39,179 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2021-12-14 15:43:39,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 15:43:39,203 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2021-12-14 15:43:39,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 15:43:39,211 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2021-12-14 15:43:39,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 15:43:39,233 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-14 15:43:39,233 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-14 15:43:39,233 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1768681193] [2021-12-14 15:43:39,234 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1768681193] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-14 15:43:39,234 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-14 15:43:39,234 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-12-14 15:43:39,235 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1781784016] [2021-12-14 15:43:39,235 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-14 15:43:39,238 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-12-14 15:43:39,238 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-14 15:43:39,254 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-12-14 15:43:39,254 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-12-14 15:43:39,260 INFO L87 Difference]: Start difference. First operand has 2323 states, 2295 states have (on average 1.857516339869281) internal successors, (4263), 2300 states have internal predecessors, (4263), 18 states have call successors, (18), 7 states have call predecessors, (18), 7 states have return successors, (18), 17 states have call predecessors, (18), 18 states have call successors, (18) Second operand has 6 states, 6 states have (on average 9.666666666666666) internal successors, (58), 4 states have internal predecessors, (58), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2021-12-14 15:43:39,894 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-14 15:43:39,894 INFO L93 Difference]: Finished difference Result 4824 states and 8887 transitions. [2021-12-14 15:43:39,895 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-12-14 15:43:39,897 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 9.666666666666666) internal successors, (58), 4 states have internal predecessors, (58), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 69 [2021-12-14 15:43:39,897 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-14 15:43:39,913 INFO L225 Difference]: With dead ends: 4824 [2021-12-14 15:43:39,913 INFO L226 Difference]: Without dead ends: 2441 [2021-12-14 15:43:39,920 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=33, Invalid=77, Unknown=0, NotChecked=0, Total=110 [2021-12-14 15:43:39,923 INFO L933 BasicCegarLoop]: 4249 mSDtfsCounter, 4444 mSDsluCounter, 12475 mSDsCounter, 0 mSdLazyCounter, 528 mSolverCounterSat, 84 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4453 SdHoareTripleChecker+Valid, 16724 SdHoareTripleChecker+Invalid, 612 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 84 IncrementalHoareTripleChecker+Valid, 528 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2021-12-14 15:43:39,924 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [4453 Valid, 16724 Invalid, 612 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [84 Valid, 528 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2021-12-14 15:43:39,938 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2441 states. [2021-12-14 15:43:40,024 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2441 to 2376. [2021-12-14 15:43:40,028 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2376 states, 2332 states have (on average 1.8340480274442539) internal successors, (4277), 2336 states have internal predecessors, (4277), 29 states have call successors, (29), 13 states have call predecessors, (29), 13 states have return successors, (30), 27 states have call predecessors, (30), 27 states have call successors, (30) [2021-12-14 15:43:40,035 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2376 states to 2376 states and 4336 transitions. [2021-12-14 15:43:40,036 INFO L78 Accepts]: Start accepts. Automaton has 2376 states and 4336 transitions. Word has length 69 [2021-12-14 15:43:40,036 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-14 15:43:40,037 INFO L470 AbstractCegarLoop]: Abstraction has 2376 states and 4336 transitions. [2021-12-14 15:43:40,037 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 9.666666666666666) internal successors, (58), 4 states have internal predecessors, (58), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2021-12-14 15:43:40,037 INFO L276 IsEmpty]: Start isEmpty. Operand 2376 states and 4336 transitions. [2021-12-14 15:43:40,039 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2021-12-14 15:43:40,040 INFO L506 BasicCegarLoop]: Found error trace [2021-12-14 15:43:40,040 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-14 15:43:40,040 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-12-14 15:43:40,040 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-14 15:43:40,041 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 15:43:40,041 INFO L85 PathProgramCache]: Analyzing trace with hash -1960277912, now seen corresponding path program 1 times [2021-12-14 15:43:40,041 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-14 15:43:40,041 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2062934362] [2021-12-14 15:43:40,041 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 15:43:40,041 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-14 15:43:40,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 15:43:40,106 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2021-12-14 15:43:40,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 15:43:40,120 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2021-12-14 15:43:40,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 15:43:40,150 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2021-12-14 15:43:40,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 15:43:40,164 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2021-12-14 15:43:40,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 15:43:40,168 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2021-12-14 15:43:40,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 15:43:40,172 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-14 15:43:40,172 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-14 15:43:40,172 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2062934362] [2021-12-14 15:43:40,172 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2062934362] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-14 15:43:40,172 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-14 15:43:40,173 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-12-14 15:43:40,173 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1961097736] [2021-12-14 15:43:40,173 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-14 15:43:40,174 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2021-12-14 15:43:40,174 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-14 15:43:40,175 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-12-14 15:43:40,175 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2021-12-14 15:43:40,175 INFO L87 Difference]: Start difference. First operand 2376 states and 4336 transitions. Second operand has 7 states, 7 states have (on average 8.285714285714286) internal successors, (58), 5 states have internal predecessors, (58), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2021-12-14 15:43:40,560 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-14 15:43:40,561 INFO L93 Difference]: Finished difference Result 2686 states and 4809 transitions. [2021-12-14 15:43:40,561 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-12-14 15:43:40,561 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 8.285714285714286) internal successors, (58), 5 states have internal predecessors, (58), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 69 [2021-12-14 15:43:40,562 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-14 15:43:40,571 INFO L225 Difference]: With dead ends: 2686 [2021-12-14 15:43:40,572 INFO L226 Difference]: Without dead ends: 2441 [2021-12-14 15:43:40,573 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=36, Invalid=74, Unknown=0, NotChecked=0, Total=110 [2021-12-14 15:43:40,574 INFO L933 BasicCegarLoop]: 4142 mSDtfsCounter, 4269 mSDsluCounter, 16164 mSDsCounter, 0 mSdLazyCounter, 424 mSolverCounterSat, 62 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4279 SdHoareTripleChecker+Valid, 20306 SdHoareTripleChecker+Invalid, 486 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 62 IncrementalHoareTripleChecker+Valid, 424 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2021-12-14 15:43:40,575 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [4279 Valid, 20306 Invalid, 486 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [62 Valid, 424 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2021-12-14 15:43:40,577 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2441 states. [2021-12-14 15:43:40,611 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2441 to 2376. [2021-12-14 15:43:40,615 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2376 states, 2332 states have (on average 1.8331903945111492) internal successors, (4275), 2336 states have internal predecessors, (4275), 29 states have call successors, (29), 13 states have call predecessors, (29), 13 states have return successors, (30), 27 states have call predecessors, (30), 27 states have call successors, (30) [2021-12-14 15:43:40,622 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2376 states to 2376 states and 4334 transitions. [2021-12-14 15:43:40,622 INFO L78 Accepts]: Start accepts. Automaton has 2376 states and 4334 transitions. Word has length 69 [2021-12-14 15:43:40,622 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-14 15:43:40,622 INFO L470 AbstractCegarLoop]: Abstraction has 2376 states and 4334 transitions. [2021-12-14 15:43:40,623 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 8.285714285714286) internal successors, (58), 5 states have internal predecessors, (58), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2021-12-14 15:43:40,623 INFO L276 IsEmpty]: Start isEmpty. Operand 2376 states and 4334 transitions. [2021-12-14 15:43:40,624 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2021-12-14 15:43:40,624 INFO L506 BasicCegarLoop]: Found error trace [2021-12-14 15:43:40,624 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-14 15:43:40,624 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2021-12-14 15:43:40,625 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-14 15:43:40,625 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 15:43:40,625 INFO L85 PathProgramCache]: Analyzing trace with hash -573492502, now seen corresponding path program 1 times [2021-12-14 15:43:40,625 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-14 15:43:40,625 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1696206091] [2021-12-14 15:43:40,626 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 15:43:40,626 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-14 15:43:40,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 15:43:40,657 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2021-12-14 15:43:40,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 15:43:40,670 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2021-12-14 15:43:40,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 15:43:40,711 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2021-12-14 15:43:40,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 15:43:40,724 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2021-12-14 15:43:40,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 15:43:40,730 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2021-12-14 15:43:40,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 15:43:40,736 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-14 15:43:40,736 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-14 15:43:40,736 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1696206091] [2021-12-14 15:43:40,736 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1696206091] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-14 15:43:40,737 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-14 15:43:40,737 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-12-14 15:43:40,737 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1542321826] [2021-12-14 15:43:40,737 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-14 15:43:40,737 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2021-12-14 15:43:40,737 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-14 15:43:40,738 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-12-14 15:43:40,738 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2021-12-14 15:43:40,738 INFO L87 Difference]: Start difference. First operand 2376 states and 4334 transitions. Second operand has 7 states, 7 states have (on average 8.285714285714286) internal successors, (58), 5 states have internal predecessors, (58), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2021-12-14 15:43:41,427 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-14 15:43:41,427 INFO L93 Difference]: Finished difference Result 2834 states and 5016 transitions. [2021-12-14 15:43:41,428 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2021-12-14 15:43:41,428 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 8.285714285714286) internal successors, (58), 5 states have internal predecessors, (58), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 69 [2021-12-14 15:43:41,428 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-14 15:43:41,437 INFO L225 Difference]: With dead ends: 2834 [2021-12-14 15:43:41,437 INFO L226 Difference]: Without dead ends: 2589 [2021-12-14 15:43:41,439 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=66, Invalid=174, Unknown=0, NotChecked=0, Total=240 [2021-12-14 15:43:41,439 INFO L933 BasicCegarLoop]: 4190 mSDtfsCounter, 4387 mSDsluCounter, 16343 mSDsCounter, 0 mSdLazyCounter, 743 mSolverCounterSat, 80 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4396 SdHoareTripleChecker+Valid, 20533 SdHoareTripleChecker+Invalid, 823 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 80 IncrementalHoareTripleChecker+Valid, 743 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2021-12-14 15:43:41,440 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [4396 Valid, 20533 Invalid, 823 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [80 Valid, 743 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2021-12-14 15:43:41,443 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2589 states. [2021-12-14 15:43:41,481 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2589 to 2490. [2021-12-14 15:43:41,485 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2490 states, 2428 states have (on average 1.8187808896210873) internal successors, (4416), 2433 states have internal predecessors, (4416), 40 states have call successors, (40), 19 states have call predecessors, (40), 20 states have return successors, (43), 39 states have call predecessors, (43), 38 states have call successors, (43) [2021-12-14 15:43:41,493 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2490 states to 2490 states and 4499 transitions. [2021-12-14 15:43:41,493 INFO L78 Accepts]: Start accepts. Automaton has 2490 states and 4499 transitions. Word has length 69 [2021-12-14 15:43:41,494 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-14 15:43:41,494 INFO L470 AbstractCegarLoop]: Abstraction has 2490 states and 4499 transitions. [2021-12-14 15:43:41,494 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 8.285714285714286) internal successors, (58), 5 states have internal predecessors, (58), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2021-12-14 15:43:41,494 INFO L276 IsEmpty]: Start isEmpty. Operand 2490 states and 4499 transitions. [2021-12-14 15:43:41,495 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2021-12-14 15:43:41,495 INFO L506 BasicCegarLoop]: Found error trace [2021-12-14 15:43:41,496 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-14 15:43:41,496 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2021-12-14 15:43:41,496 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-14 15:43:41,496 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 15:43:41,497 INFO L85 PathProgramCache]: Analyzing trace with hash 302526504, now seen corresponding path program 1 times [2021-12-14 15:43:41,497 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-14 15:43:41,497 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [534562517] [2021-12-14 15:43:41,497 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 15:43:41,497 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-14 15:43:41,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 15:43:41,515 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2021-12-14 15:43:41,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 15:43:41,528 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2021-12-14 15:43:41,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 15:43:41,552 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2021-12-14 15:43:41,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 15:43:41,566 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2021-12-14 15:43:41,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 15:43:41,573 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2021-12-14 15:43:41,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 15:43:41,580 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-14 15:43:41,634 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-14 15:43:41,634 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [534562517] [2021-12-14 15:43:41,634 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [534562517] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-14 15:43:41,634 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-14 15:43:41,634 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-12-14 15:43:41,635 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1324079647] [2021-12-14 15:43:41,635 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-14 15:43:41,635 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2021-12-14 15:43:41,635 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-14 15:43:41,635 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-12-14 15:43:41,635 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2021-12-14 15:43:41,636 INFO L87 Difference]: Start difference. First operand 2490 states and 4499 transitions. Second operand has 7 states, 7 states have (on average 8.285714285714286) internal successors, (58), 5 states have internal predecessors, (58), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2021-12-14 15:43:42,291 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-14 15:43:42,292 INFO L93 Difference]: Finished difference Result 3280 states and 5671 transitions. [2021-12-14 15:43:42,292 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2021-12-14 15:43:42,292 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 8.285714285714286) internal successors, (58), 5 states have internal predecessors, (58), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 69 [2021-12-14 15:43:42,294 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-14 15:43:42,305 INFO L225 Difference]: With dead ends: 3280 [2021-12-14 15:43:42,306 INFO L226 Difference]: Without dead ends: 2921 [2021-12-14 15:43:42,310 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=73, Invalid=199, Unknown=0, NotChecked=0, Total=272 [2021-12-14 15:43:42,317 INFO L933 BasicCegarLoop]: 4277 mSDtfsCounter, 4371 mSDsluCounter, 16532 mSDsCounter, 0 mSdLazyCounter, 893 mSolverCounterSat, 73 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4379 SdHoareTripleChecker+Valid, 20809 SdHoareTripleChecker+Invalid, 966 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 73 IncrementalHoareTripleChecker+Valid, 893 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2021-12-14 15:43:42,319 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [4379 Valid, 20809 Invalid, 966 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [73 Valid, 893 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2021-12-14 15:43:42,323 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2921 states. [2021-12-14 15:43:42,379 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2921 to 2697. [2021-12-14 15:43:42,384 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2697 states, 2601 states have (on average 1.794309880815071) internal successors, (4667), 2608 states have internal predecessors, (4667), 60 states have call successors, (60), 31 states have call predecessors, (60), 34 states have return successors, (71), 61 states have call predecessors, (71), 58 states have call successors, (71) [2021-12-14 15:43:42,391 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2697 states to 2697 states and 4798 transitions. [2021-12-14 15:43:42,391 INFO L78 Accepts]: Start accepts. Automaton has 2697 states and 4798 transitions. Word has length 69 [2021-12-14 15:43:42,392 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-14 15:43:42,392 INFO L470 AbstractCegarLoop]: Abstraction has 2697 states and 4798 transitions. [2021-12-14 15:43:42,392 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 8.285714285714286) internal successors, (58), 5 states have internal predecessors, (58), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2021-12-14 15:43:42,392 INFO L276 IsEmpty]: Start isEmpty. Operand 2697 states and 4798 transitions. [2021-12-14 15:43:42,393 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2021-12-14 15:43:42,393 INFO L506 BasicCegarLoop]: Found error trace [2021-12-14 15:43:42,393 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-14 15:43:42,394 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2021-12-14 15:43:42,394 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-14 15:43:42,394 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 15:43:42,394 INFO L85 PathProgramCache]: Analyzing trace with hash 1840866534, now seen corresponding path program 1 times [2021-12-14 15:43:42,394 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-14 15:43:42,395 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1268385863] [2021-12-14 15:43:42,395 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 15:43:42,395 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-14 15:43:42,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 15:43:42,410 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2021-12-14 15:43:42,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 15:43:42,419 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2021-12-14 15:43:42,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 15:43:42,442 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2021-12-14 15:43:42,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 15:43:42,452 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2021-12-14 15:43:42,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 15:43:42,455 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2021-12-14 15:43:42,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 15:43:42,458 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-14 15:43:42,458 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-14 15:43:42,458 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1268385863] [2021-12-14 15:43:42,459 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1268385863] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-14 15:43:42,459 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-14 15:43:42,459 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-12-14 15:43:42,459 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1380935147] [2021-12-14 15:43:42,459 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-14 15:43:42,460 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2021-12-14 15:43:42,460 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-14 15:43:42,460 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-12-14 15:43:42,461 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2021-12-14 15:43:42,461 INFO L87 Difference]: Start difference. First operand 2697 states and 4798 transitions. Second operand has 7 states, 7 states have (on average 8.285714285714286) internal successors, (58), 5 states have internal predecessors, (58), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2021-12-14 15:43:43,135 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-14 15:43:43,136 INFO L93 Difference]: Finished difference Result 3979 states and 6676 transitions. [2021-12-14 15:43:43,136 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2021-12-14 15:43:43,136 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 8.285714285714286) internal successors, (58), 5 states have internal predecessors, (58), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 69 [2021-12-14 15:43:43,136 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-14 15:43:43,146 INFO L225 Difference]: With dead ends: 3979 [2021-12-14 15:43:43,147 INFO L226 Difference]: Without dead ends: 3413 [2021-12-14 15:43:43,149 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=73, Invalid=199, Unknown=0, NotChecked=0, Total=272 [2021-12-14 15:43:43,150 INFO L933 BasicCegarLoop]: 4246 mSDtfsCounter, 4373 mSDsluCounter, 16535 mSDsCounter, 0 mSdLazyCounter, 780 mSolverCounterSat, 74 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4385 SdHoareTripleChecker+Valid, 20781 SdHoareTripleChecker+Invalid, 854 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 74 IncrementalHoareTripleChecker+Valid, 780 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2021-12-14 15:43:43,150 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [4385 Valid, 20781 Invalid, 854 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [74 Valid, 780 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2021-12-14 15:43:43,153 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3413 states. [2021-12-14 15:43:43,221 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3413 to 3126. [2021-12-14 15:43:43,225 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3126 states, 2964 states have (on average 1.75472334682861) internal successors, (5201), 2975 states have internal predecessors, (5201), 98 states have call successors, (98), 55 states have call predecessors, (98), 62 states have return successors, (131), 103 states have call predecessors, (131), 96 states have call successors, (131) [2021-12-14 15:43:43,238 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3126 states to 3126 states and 5430 transitions. [2021-12-14 15:43:43,239 INFO L78 Accepts]: Start accepts. Automaton has 3126 states and 5430 transitions. Word has length 69 [2021-12-14 15:43:43,239 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-14 15:43:43,240 INFO L470 AbstractCegarLoop]: Abstraction has 3126 states and 5430 transitions. [2021-12-14 15:43:43,240 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 8.285714285714286) internal successors, (58), 5 states have internal predecessors, (58), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2021-12-14 15:43:43,240 INFO L276 IsEmpty]: Start isEmpty. Operand 3126 states and 5430 transitions. [2021-12-14 15:43:43,241 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2021-12-14 15:43:43,242 INFO L506 BasicCegarLoop]: Found error trace [2021-12-14 15:43:43,242 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-14 15:43:43,242 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2021-12-14 15:43:43,242 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-14 15:43:43,242 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 15:43:43,242 INFO L85 PathProgramCache]: Analyzing trace with hash -187719576, now seen corresponding path program 1 times [2021-12-14 15:43:43,243 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-14 15:43:43,243 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [503657890] [2021-12-14 15:43:43,243 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 15:43:43,243 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-14 15:43:43,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 15:43:43,259 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2021-12-14 15:43:43,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 15:43:43,267 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2021-12-14 15:43:43,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 15:43:43,274 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2021-12-14 15:43:43,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 15:43:43,286 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2021-12-14 15:43:43,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 15:43:43,293 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2021-12-14 15:43:43,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 15:43:43,296 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-14 15:43:43,296 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-14 15:43:43,296 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [503657890] [2021-12-14 15:43:43,296 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [503657890] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-14 15:43:43,296 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-14 15:43:43,296 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-12-14 15:43:43,297 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [479447622] [2021-12-14 15:43:43,297 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-14 15:43:43,298 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-12-14 15:43:43,298 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-14 15:43:43,298 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-12-14 15:43:43,298 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-12-14 15:43:43,299 INFO L87 Difference]: Start difference. First operand 3126 states and 5430 transitions. Second operand has 6 states, 6 states have (on average 9.666666666666666) internal successors, (58), 4 states have internal predecessors, (58), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2021-12-14 15:43:43,832 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-14 15:43:43,832 INFO L93 Difference]: Finished difference Result 4980 states and 8171 transitions. [2021-12-14 15:43:43,832 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-12-14 15:43:43,833 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 9.666666666666666) internal successors, (58), 4 states have internal predecessors, (58), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 69 [2021-12-14 15:43:43,833 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-14 15:43:43,852 INFO L225 Difference]: With dead ends: 4980 [2021-12-14 15:43:43,852 INFO L226 Difference]: Without dead ends: 3986 [2021-12-14 15:43:43,858 INFO L932 BasicCegarLoop]: 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 [2021-12-14 15:43:43,859 INFO L933 BasicCegarLoop]: 4304 mSDtfsCounter, 4501 mSDsluCounter, 12283 mSDsCounter, 0 mSdLazyCounter, 620 mSolverCounterSat, 93 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4527 SdHoareTripleChecker+Valid, 16587 SdHoareTripleChecker+Invalid, 713 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 93 IncrementalHoareTripleChecker+Valid, 620 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2021-12-14 15:43:43,860 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [4527 Valid, 16587 Invalid, 713 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [93 Valid, 620 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2021-12-14 15:43:43,864 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3986 states. [2021-12-14 15:43:43,942 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3986 to 3655. [2021-12-14 15:43:43,948 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3655 states, 3405 states have (on average 1.7101321585903084) internal successors, (5823), 3425 states have internal predecessors, (5823), 152 states have call successors, (152), 85 states have call predecessors, (152), 96 states have return successors, (195), 152 states have call predecessors, (195), 150 states have call successors, (195) [2021-12-14 15:43:44,014 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3655 states to 3655 states and 6170 transitions. [2021-12-14 15:43:44,015 INFO L78 Accepts]: Start accepts. Automaton has 3655 states and 6170 transitions. Word has length 69 [2021-12-14 15:43:44,015 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-14 15:43:44,015 INFO L470 AbstractCegarLoop]: Abstraction has 3655 states and 6170 transitions. [2021-12-14 15:43:44,015 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 9.666666666666666) internal successors, (58), 4 states have internal predecessors, (58), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2021-12-14 15:43:44,015 INFO L276 IsEmpty]: Start isEmpty. Operand 3655 states and 6170 transitions. [2021-12-14 15:43:44,018 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2021-12-14 15:43:44,018 INFO L506 BasicCegarLoop]: Found error trace [2021-12-14 15:43:44,018 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-14 15:43:44,018 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2021-12-14 15:43:44,018 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-14 15:43:44,018 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 15:43:44,018 INFO L85 PathProgramCache]: Analyzing trace with hash 770021099, now seen corresponding path program 1 times [2021-12-14 15:43:44,019 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-14 15:43:44,019 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1700199327] [2021-12-14 15:43:44,019 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 15:43:44,019 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-14 15:43:44,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 15:43:44,061 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2021-12-14 15:43:44,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 15:43:44,068 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2021-12-14 15:43:44,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 15:43:44,075 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2021-12-14 15:43:44,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 15:43:44,111 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2021-12-14 15:43:44,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 15:43:44,117 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2021-12-14 15:43:44,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 15:43:44,123 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2021-12-14 15:43:44,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 15:43:44,129 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-12-14 15:43:44,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 15:43:44,133 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2021-12-14 15:43:44,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 15:43:44,135 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 0 proven. 17 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2021-12-14 15:43:44,135 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-14 15:43:44,136 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1700199327] [2021-12-14 15:43:44,136 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1700199327] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-14 15:43:44,136 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1062316722] [2021-12-14 15:43:44,136 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 15:43:44,136 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-14 15:43:44,136 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-14 15:43:44,156 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-14 15:43:44,161 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2021-12-14 15:43:44,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 15:43:44,246 INFO L263 TraceCheckSpWp]: Trace formula consists of 416 conjuncts, 2 conjunts are in the unsatisfiable core [2021-12-14 15:43:44,251 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-14 15:43:44,418 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2021-12-14 15:43:44,418 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-14 15:43:44,419 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1062316722] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-14 15:43:44,419 INFO L186 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2021-12-14 15:43:44,419 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [7] total 8 [2021-12-14 15:43:44,419 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [59033402] [2021-12-14 15:43:44,419 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-14 15:43:44,420 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-12-14 15:43:44,420 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-14 15:43:44,420 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-12-14 15:43:44,420 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2021-12-14 15:43:44,420 INFO L87 Difference]: Start difference. First operand 3655 states and 6170 transitions. Second operand has 3 states, 3 states have (on average 26.666666666666668) internal successors, (80), 2 states have internal predecessors, (80), 2 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2021-12-14 15:43:44,509 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-14 15:43:44,509 INFO L93 Difference]: Finished difference Result 6624 states and 10494 transitions. [2021-12-14 15:43:44,509 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-12-14 15:43:44,510 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 26.666666666666668) internal successors, (80), 2 states have internal predecessors, (80), 2 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) Word has length 111 [2021-12-14 15:43:44,510 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-14 15:43:44,525 INFO L225 Difference]: With dead ends: 6624 [2021-12-14 15:43:44,525 INFO L226 Difference]: Without dead ends: 5101 [2021-12-14 15:43:44,530 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 132 GetRequests, 126 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2021-12-14 15:43:44,531 INFO L933 BasicCegarLoop]: 4161 mSDtfsCounter, 4109 mSDsluCounter, 170 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4109 SdHoareTripleChecker+Valid, 4331 SdHoareTripleChecker+Invalid, 12 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-14 15:43:44,531 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [4109 Valid, 4331 Invalid, 12 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-14 15:43:44,536 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5101 states. [2021-12-14 15:43:44,635 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5101 to 5069. [2021-12-14 15:43:44,643 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5069 states, 4595 states have (on average 1.6426550598476606) internal successors, (7548), 4632 states have internal predecessors, (7548), 282 states have call successors, (282), 167 states have call predecessors, (282), 190 states have return successors, (363), 277 states have call predecessors, (363), 280 states have call successors, (363) [2021-12-14 15:43:44,654 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5069 states to 5069 states and 8193 transitions. [2021-12-14 15:43:44,655 INFO L78 Accepts]: Start accepts. Automaton has 5069 states and 8193 transitions. Word has length 111 [2021-12-14 15:43:44,655 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-14 15:43:44,655 INFO L470 AbstractCegarLoop]: Abstraction has 5069 states and 8193 transitions. [2021-12-14 15:43:44,655 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 26.666666666666668) internal successors, (80), 2 states have internal predecessors, (80), 2 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2021-12-14 15:43:44,656 INFO L276 IsEmpty]: Start isEmpty. Operand 5069 states and 8193 transitions. [2021-12-14 15:43:44,659 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2021-12-14 15:43:44,660 INFO L506 BasicCegarLoop]: Found error trace [2021-12-14 15:43:44,660 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-14 15:43:44,694 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2021-12-14 15:43:44,863 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-14 15:43:44,864 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-14 15:43:44,864 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 15:43:44,864 INFO L85 PathProgramCache]: Analyzing trace with hash -122535733, now seen corresponding path program 1 times [2021-12-14 15:43:44,864 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-14 15:43:44,864 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1623516623] [2021-12-14 15:43:44,864 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 15:43:44,864 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-14 15:43:44,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 15:43:44,895 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2021-12-14 15:43:44,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 15:43:44,906 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2021-12-14 15:43:44,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 15:43:44,914 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2021-12-14 15:43:44,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 15:43:44,954 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2021-12-14 15:43:44,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 15:43:44,958 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2021-12-14 15:43:44,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 15:43:44,960 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2021-12-14 15:43:44,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 15:43:44,964 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-12-14 15:43:44,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 15:43:44,967 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2021-12-14 15:43:44,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 15:43:44,969 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 0 proven. 17 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2021-12-14 15:43:44,969 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-14 15:43:44,969 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1623516623] [2021-12-14 15:43:44,969 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1623516623] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-14 15:43:44,969 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [520240941] [2021-12-14 15:43:44,970 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 15:43:44,970 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-14 15:43:44,970 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-14 15:43:44,971 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-14 15:43:44,972 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2021-12-14 15:43:45,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 15:43:45,043 INFO L263 TraceCheckSpWp]: Trace formula consists of 410 conjuncts, 2 conjunts are in the unsatisfiable core [2021-12-14 15:43:45,045 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-14 15:43:45,201 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2021-12-14 15:43:45,201 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-14 15:43:45,202 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [520240941] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-14 15:43:45,202 INFO L186 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2021-12-14 15:43:45,202 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [7] total 8 [2021-12-14 15:43:45,202 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [765835148] [2021-12-14 15:43:45,202 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-14 15:43:45,202 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-12-14 15:43:45,202 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-14 15:43:45,203 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-12-14 15:43:45,203 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2021-12-14 15:43:45,203 INFO L87 Difference]: Start difference. First operand 5069 states and 8193 transitions. Second operand has 3 states, 3 states have (on average 25.0) internal successors, (75), 3 states have internal predecessors, (75), 3 states have call successors, (9), 3 states have call predecessors, (9), 2 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2021-12-14 15:43:45,366 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-14 15:43:45,366 INFO L93 Difference]: Finished difference Result 10733 states and 16467 transitions. [2021-12-14 15:43:45,366 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-12-14 15:43:45,367 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 25.0) internal successors, (75), 3 states have internal predecessors, (75), 3 states have call successors, (9), 3 states have call predecessors, (9), 2 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) Word has length 111 [2021-12-14 15:43:45,367 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-14 15:43:45,390 INFO L225 Difference]: With dead ends: 10733 [2021-12-14 15:43:45,390 INFO L226 Difference]: Without dead ends: 7797 [2021-12-14 15:43:45,400 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 132 GetRequests, 126 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2021-12-14 15:43:45,402 INFO L933 BasicCegarLoop]: 4309 mSDtfsCounter, 153 mSDsluCounter, 4149 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 153 SdHoareTripleChecker+Valid, 8458 SdHoareTripleChecker+Invalid, 13 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-14 15:43:45,402 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [153 Valid, 8458 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-14 15:43:45,411 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7797 states. [2021-12-14 15:43:45,592 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7797 to 7797. [2021-12-14 15:43:45,607 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7797 states, 6882 states have (on average 1.568584713746004) internal successors, (10795), 6944 states have internal predecessors, (10795), 537 states have call successors, (537), 329 states have call predecessors, (537), 376 states have return successors, (786), 539 states have call predecessors, (786), 535 states have call successors, (786) [2021-12-14 15:43:45,626 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7797 states to 7797 states and 12118 transitions. [2021-12-14 15:43:45,627 INFO L78 Accepts]: Start accepts. Automaton has 7797 states and 12118 transitions. Word has length 111 [2021-12-14 15:43:45,628 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-14 15:43:45,628 INFO L470 AbstractCegarLoop]: Abstraction has 7797 states and 12118 transitions. [2021-12-14 15:43:45,628 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 25.0) internal successors, (75), 3 states have internal predecessors, (75), 3 states have call successors, (9), 3 states have call predecessors, (9), 2 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2021-12-14 15:43:45,629 INFO L276 IsEmpty]: Start isEmpty. Operand 7797 states and 12118 transitions. [2021-12-14 15:43:45,639 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2021-12-14 15:43:45,639 INFO L506 BasicCegarLoop]: Found error trace [2021-12-14 15:43:45,639 INFO L514 BasicCegarLoop]: 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, 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] [2021-12-14 15:43:45,660 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2021-12-14 15:43:45,855 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable7 [2021-12-14 15:43:45,855 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-14 15:43:45,856 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 15:43:45,856 INFO L85 PathProgramCache]: Analyzing trace with hash 327119452, now seen corresponding path program 1 times [2021-12-14 15:43:45,856 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-14 15:43:45,856 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [371532307] [2021-12-14 15:43:45,856 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 15:43:45,856 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-14 15:43:45,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 15:43:45,887 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2021-12-14 15:43:45,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 15:43:45,895 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2021-12-14 15:43:45,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 15:43:45,902 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2021-12-14 15:43:45,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 15:43:45,934 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2021-12-14 15:43:45,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 15:43:45,937 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2021-12-14 15:43:45,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 15:43:45,939 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2021-12-14 15:43:45,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 15:43:45,944 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-12-14 15:43:45,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 15:43:45,947 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2021-12-14 15:43:45,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 15:43:45,952 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-12-14 15:43:45,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 15:43:45,957 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2021-12-14 15:43:45,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 15:43:45,960 INFO L134 CoverageAnalysis]: Checked inductivity of 73 backedges. 0 proven. 34 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2021-12-14 15:43:45,961 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-14 15:43:45,961 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [371532307] [2021-12-14 15:43:45,961 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [371532307] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-14 15:43:45,961 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1401041637] [2021-12-14 15:43:45,961 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 15:43:45,961 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-14 15:43:45,962 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-14 15:43:45,962 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-14 15:43:45,964 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2021-12-14 15:43:46,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 15:43:46,096 INFO L263 TraceCheckSpWp]: Trace formula consists of 505 conjuncts, 2 conjunts are in the unsatisfiable core [2021-12-14 15:43:46,099 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-14 15:43:46,312 INFO L134 CoverageAnalysis]: Checked inductivity of 73 backedges. 53 proven. 0 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2021-12-14 15:43:46,312 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-14 15:43:46,312 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1401041637] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-14 15:43:46,312 INFO L186 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2021-12-14 15:43:46,313 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [7] total 8 [2021-12-14 15:43:46,313 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1010685538] [2021-12-14 15:43:46,313 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-14 15:43:46,313 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-12-14 15:43:46,313 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-14 15:43:46,313 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-12-14 15:43:46,314 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2021-12-14 15:43:46,314 INFO L87 Difference]: Start difference. First operand 7797 states and 12118 transitions. Second operand has 3 states, 3 states have (on average 34.333333333333336) internal successors, (103), 2 states have internal predecessors, (103), 2 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) [2021-12-14 15:43:46,678 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-14 15:43:46,678 INFO L93 Difference]: Finished difference Result 18877 states and 28229 transitions. [2021-12-14 15:43:46,679 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-12-14 15:43:46,679 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 34.333333333333336) internal successors, (103), 2 states have internal predecessors, (103), 2 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) Word has length 143 [2021-12-14 15:43:46,680 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-14 15:43:46,726 INFO L225 Difference]: With dead ends: 18877 [2021-12-14 15:43:46,727 INFO L226 Difference]: Without dead ends: 13217 [2021-12-14 15:43:46,748 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 168 GetRequests, 162 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2021-12-14 15:43:46,749 INFO L933 BasicCegarLoop]: 4182 mSDtfsCounter, 4067 mSDsluCounter, 170 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4067 SdHoareTripleChecker+Valid, 4352 SdHoareTripleChecker+Invalid, 12 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-14 15:43:46,749 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [4067 Valid, 4352 Invalid, 12 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-14 15:43:46,762 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13217 states. [2021-12-14 15:43:47,152 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13217 to 13101. [2021-12-14 15:43:47,172 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13101 states, 11334 states have (on average 1.5130580554085054) internal successors, (17149), 11454 states have internal predecessors, (17149), 1023 states have call successors, (1023), 647 states have call predecessors, (1023), 742 states have return successors, (1484), 1015 states have call predecessors, (1484), 1021 states have call successors, (1484) [2021-12-14 15:43:47,215 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13101 states to 13101 states and 19656 transitions. [2021-12-14 15:43:47,217 INFO L78 Accepts]: Start accepts. Automaton has 13101 states and 19656 transitions. Word has length 143 [2021-12-14 15:43:47,218 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-14 15:43:47,218 INFO L470 AbstractCegarLoop]: Abstraction has 13101 states and 19656 transitions. [2021-12-14 15:43:47,219 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 34.333333333333336) internal successors, (103), 2 states have internal predecessors, (103), 2 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) [2021-12-14 15:43:47,219 INFO L276 IsEmpty]: Start isEmpty. Operand 13101 states and 19656 transitions. [2021-12-14 15:43:47,244 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 161 [2021-12-14 15:43:47,244 INFO L506 BasicCegarLoop]: Found error trace [2021-12-14 15:43:47,244 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-14 15:43:47,265 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2021-12-14 15:43:47,459 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-14 15:43:47,460 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-14 15:43:47,460 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 15:43:47,460 INFO L85 PathProgramCache]: Analyzing trace with hash 382011958, now seen corresponding path program 1 times [2021-12-14 15:43:47,460 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-14 15:43:47,460 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2002110613] [2021-12-14 15:43:47,461 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 15:43:47,461 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-14 15:43:47,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 15:43:47,478 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2021-12-14 15:43:47,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 15:43:47,487 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2021-12-14 15:43:47,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 15:43:47,493 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2021-12-14 15:43:47,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 15:43:47,525 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2021-12-14 15:43:47,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 15:43:47,529 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2021-12-14 15:43:47,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 15:43:47,531 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2021-12-14 15:43:47,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 15:43:47,533 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2021-12-14 15:43:47,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 15:43:47,537 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-12-14 15:43:47,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 15:43:47,540 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 115 [2021-12-14 15:43:47,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 15:43:47,545 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-12-14 15:43:47,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 15:43:47,548 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 145 [2021-12-14 15:43:47,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 15:43:47,551 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 0 proven. 34 refuted. 0 times theorem prover too weak. 66 trivial. 0 not checked. [2021-12-14 15:43:47,551 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-14 15:43:47,551 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2002110613] [2021-12-14 15:43:47,552 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2002110613] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-14 15:43:47,552 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1218718] [2021-12-14 15:43:47,552 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 15:43:47,552 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-14 15:43:47,552 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-14 15:43:47,553 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-14 15:43:47,555 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2021-12-14 15:43:47,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 15:43:47,663 INFO L263 TraceCheckSpWp]: Trace formula consists of 543 conjuncts, 2 conjunts are in the unsatisfiable core [2021-12-14 15:43:47,666 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-14 15:43:47,921 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 84 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2021-12-14 15:43:47,921 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-14 15:43:47,921 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1218718] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-14 15:43:47,921 INFO L186 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2021-12-14 15:43:47,922 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [7] total 8 [2021-12-14 15:43:47,922 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1241811776] [2021-12-14 15:43:47,922 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-14 15:43:47,922 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-12-14 15:43:47,923 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-14 15:43:47,923 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-12-14 15:43:47,923 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2021-12-14 15:43:47,923 INFO L87 Difference]: Start difference. First operand 13101 states and 19656 transitions. Second operand has 3 states, 3 states have (on average 42.333333333333336) internal successors, (127), 3 states have internal predecessors, (127), 3 states have call successors, (10), 3 states have call predecessors, (10), 3 states have return successors, (10), 3 states have call predecessors, (10), 3 states have call successors, (10) [2021-12-14 15:43:48,302 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-14 15:43:48,302 INFO L93 Difference]: Finished difference Result 25341 states and 37502 transitions. [2021-12-14 15:43:48,302 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-12-14 15:43:48,303 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 42.333333333333336) internal successors, (127), 3 states have internal predecessors, (127), 3 states have call successors, (10), 3 states have call predecessors, (10), 3 states have return successors, (10), 3 states have call predecessors, (10), 3 states have call successors, (10) Word has length 160 [2021-12-14 15:43:48,303 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-14 15:43:48,344 INFO L225 Difference]: With dead ends: 25341 [2021-12-14 15:43:48,345 INFO L226 Difference]: Without dead ends: 14375 [2021-12-14 15:43:48,371 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 187 GetRequests, 181 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2021-12-14 15:43:48,372 INFO L933 BasicCegarLoop]: 4148 mSDtfsCounter, 4086 mSDsluCounter, 34 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4086 SdHoareTripleChecker+Valid, 4182 SdHoareTripleChecker+Invalid, 12 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-14 15:43:48,372 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [4086 Valid, 4182 Invalid, 12 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-14 15:43:48,383 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14375 states. [2021-12-14 15:43:48,695 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14375 to 14375. [2021-12-14 15:43:48,710 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14375 states, 12492 states have (on average 1.4571725904578932) internal successors, (18203), 12612 states have internal predecessors, (18203), 1053 states have call successors, (1053), 733 states have call predecessors, (1053), 828 states have return successors, (1522), 1045 states have call predecessors, (1522), 1051 states have call successors, (1522) [2021-12-14 15:43:48,742 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14375 states to 14375 states and 20778 transitions. [2021-12-14 15:43:48,744 INFO L78 Accepts]: Start accepts. Automaton has 14375 states and 20778 transitions. Word has length 160 [2021-12-14 15:43:48,744 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-14 15:43:48,744 INFO L470 AbstractCegarLoop]: Abstraction has 14375 states and 20778 transitions. [2021-12-14 15:43:48,745 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 42.333333333333336) internal successors, (127), 3 states have internal predecessors, (127), 3 states have call successors, (10), 3 states have call predecessors, (10), 3 states have return successors, (10), 3 states have call predecessors, (10), 3 states have call successors, (10) [2021-12-14 15:43:48,745 INFO L276 IsEmpty]: Start isEmpty. Operand 14375 states and 20778 transitions. [2021-12-14 15:43:48,767 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 161 [2021-12-14 15:43:48,767 INFO L506 BasicCegarLoop]: Found error trace [2021-12-14 15:43:48,767 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1] [2021-12-14 15:43:48,789 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2021-12-14 15:43:48,979 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-14 15:43:48,979 INFO L402 AbstractCegarLoop]: === Iteration 11 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-14 15:43:48,980 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 15:43:48,980 INFO L85 PathProgramCache]: Analyzing trace with hash 228383827, now seen corresponding path program 1 times [2021-12-14 15:43:48,980 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-14 15:43:48,980 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1701314924] [2021-12-14 15:43:48,980 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 15:43:48,980 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-14 15:43:48,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 15:43:49,004 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2021-12-14 15:43:49,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 15:43:49,013 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2021-12-14 15:43:49,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 15:43:49,020 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2021-12-14 15:43:49,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 15:43:49,056 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2021-12-14 15:43:49,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 15:43:49,062 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2021-12-14 15:43:49,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 15:43:49,064 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2021-12-14 15:43:49,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 15:43:49,065 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2021-12-14 15:43:49,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 15:43:49,070 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-12-14 15:43:49,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 15:43:49,072 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 115 [2021-12-14 15:43:49,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 15:43:49,077 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-12-14 15:43:49,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 15:43:49,080 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 145 [2021-12-14 15:43:49,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 15:43:49,082 INFO L134 CoverageAnalysis]: Checked inductivity of 102 backedges. 0 proven. 34 refuted. 0 times theorem prover too weak. 68 trivial. 0 not checked. [2021-12-14 15:43:49,082 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-14 15:43:49,083 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1701314924] [2021-12-14 15:43:49,083 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1701314924] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-14 15:43:49,083 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2090681430] [2021-12-14 15:43:49,083 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 15:43:49,083 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-14 15:43:49,083 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-14 15:43:49,084 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-14 15:43:49,086 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2021-12-14 15:43:49,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 15:43:49,177 INFO L263 TraceCheckSpWp]: Trace formula consists of 537 conjuncts, 3 conjunts are in the unsatisfiable core [2021-12-14 15:43:49,179 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-14 15:43:49,400 INFO L134 CoverageAnalysis]: Checked inductivity of 102 backedges. 60 proven. 0 refuted. 0 times theorem prover too weak. 42 trivial. 0 not checked. [2021-12-14 15:43:49,400 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-14 15:43:49,400 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2090681430] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-14 15:43:49,401 INFO L186 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2021-12-14 15:43:49,401 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [7] total 8 [2021-12-14 15:43:49,402 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1023540934] [2021-12-14 15:43:49,402 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-14 15:43:49,403 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-12-14 15:43:49,403 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-14 15:43:49,403 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-12-14 15:43:49,403 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2021-12-14 15:43:49,404 INFO L87 Difference]: Start difference. First operand 14375 states and 20778 transitions. Second operand has 3 states, 3 states have (on average 34.0) internal successors, (102), 3 states have internal predecessors, (102), 3 states have call successors, (10), 3 states have call predecessors, (10), 3 states have return successors, (9), 3 states have call predecessors, (9), 3 states have call successors, (9) [2021-12-14 15:43:49,737 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-14 15:43:49,737 INFO L93 Difference]: Finished difference Result 23728 states and 33596 transitions. [2021-12-14 15:43:49,738 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-12-14 15:43:49,738 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 34.0) internal successors, (102), 3 states have internal predecessors, (102), 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 160 [2021-12-14 15:43:49,738 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-14 15:43:49,780 INFO L225 Difference]: With dead ends: 23728 [2021-12-14 15:43:49,780 INFO L226 Difference]: Without dead ends: 15235 [2021-12-14 15:43:49,800 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 187 GetRequests, 181 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2021-12-14 15:43:49,800 INFO L933 BasicCegarLoop]: 4170 mSDtfsCounter, 4087 mSDsluCounter, 177 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4087 SdHoareTripleChecker+Valid, 4347 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 [2021-12-14 15:43:49,801 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [4087 Valid, 4347 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-14 15:43:49,813 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15235 states. [2021-12-14 15:43:50,146 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15235 to 15159. [2021-12-14 15:43:50,160 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15159 states, 13212 states have (on average 1.4319557977596125) internal successors, (18919), 13332 states have internal predecessors, (18919), 1065 states have call successors, (1065), 785 states have call predecessors, (1065), 880 states have return successors, (1586), 1057 states have call predecessors, (1586), 1063 states have call successors, (1586) [2021-12-14 15:43:50,197 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15159 states to 15159 states and 21570 transitions. [2021-12-14 15:43:50,200 INFO L78 Accepts]: Start accepts. Automaton has 15159 states and 21570 transitions. Word has length 160 [2021-12-14 15:43:50,200 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-14 15:43:50,200 INFO L470 AbstractCegarLoop]: Abstraction has 15159 states and 21570 transitions. [2021-12-14 15:43:50,200 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 34.0) internal successors, (102), 3 states have internal predecessors, (102), 3 states have call successors, (10), 3 states have call predecessors, (10), 3 states have return successors, (9), 3 states have call predecessors, (9), 3 states have call successors, (9) [2021-12-14 15:43:50,200 INFO L276 IsEmpty]: Start isEmpty. Operand 15159 states and 21570 transitions. [2021-12-14 15:43:50,227 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 162 [2021-12-14 15:43:50,227 INFO L506 BasicCegarLoop]: Found error trace [2021-12-14 15:43:50,227 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1] [2021-12-14 15:43:50,246 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2021-12-14 15:43:50,438 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable10 [2021-12-14 15:43:50,438 INFO L402 AbstractCegarLoop]: === Iteration 12 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-14 15:43:50,439 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 15:43:50,439 INFO L85 PathProgramCache]: Analyzing trace with hash 1570525413, now seen corresponding path program 1 times [2021-12-14 15:43:50,439 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-14 15:43:50,439 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1313668774] [2021-12-14 15:43:50,439 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 15:43:50,439 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-14 15:43:50,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 15:43:50,457 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2021-12-14 15:43:50,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 15:43:50,465 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2021-12-14 15:43:50,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 15:43:50,472 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2021-12-14 15:43:50,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 15:43:50,503 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2021-12-14 15:43:50,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 15:43:50,506 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2021-12-14 15:43:50,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 15:43:50,509 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2021-12-14 15:43:50,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 15:43:50,513 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-12-14 15:43:50,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 15:43:50,516 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2021-12-14 15:43:50,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 15:43:50,518 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2021-12-14 15:43:50,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 15:43:50,524 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-12-14 15:43:50,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 15:43:50,527 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 146 [2021-12-14 15:43:50,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 15:43:50,529 INFO L134 CoverageAnalysis]: Checked inductivity of 102 backedges. 0 proven. 34 refuted. 0 times theorem prover too weak. 68 trivial. 0 not checked. [2021-12-14 15:43:50,529 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-14 15:43:50,530 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1313668774] [2021-12-14 15:43:50,530 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1313668774] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-14 15:43:50,530 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [939722143] [2021-12-14 15:43:50,530 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 15:43:50,530 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-14 15:43:50,530 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-14 15:43:50,531 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-14 15:43:50,532 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2021-12-14 15:43:50,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 15:43:50,617 INFO L263 TraceCheckSpWp]: Trace formula consists of 538 conjuncts, 2 conjunts are in the unsatisfiable core [2021-12-14 15:43:50,619 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-14 15:43:50,815 INFO L134 CoverageAnalysis]: Checked inductivity of 102 backedges. 76 proven. 0 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2021-12-14 15:43:50,816 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-14 15:43:50,817 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [939722143] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-14 15:43:50,817 INFO L186 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2021-12-14 15:43:50,817 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [7] total 8 [2021-12-14 15:43:50,818 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1155377867] [2021-12-14 15:43:50,818 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-14 15:43:50,818 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-12-14 15:43:50,818 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-14 15:43:50,819 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-12-14 15:43:50,819 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2021-12-14 15:43:50,819 INFO L87 Difference]: Start difference. First operand 15159 states and 21570 transitions. Second operand has 3 states, 3 states have (on average 38.333333333333336) internal successors, (115), 3 states have internal predecessors, (115), 3 states have call successors, (12), 3 states have call predecessors, (12), 2 states have return successors, (11), 2 states have call predecessors, (11), 3 states have call successors, (11) [2021-12-14 15:43:51,444 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-14 15:43:51,444 INFO L93 Difference]: Finished difference Result 40537 states and 56372 transitions. [2021-12-14 15:43:51,445 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-12-14 15:43:51,445 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 38.333333333333336) internal successors, (115), 3 states have internal predecessors, (115), 3 states have call successors, (12), 3 states have call predecessors, (12), 2 states have return successors, (11), 2 states have call predecessors, (11), 3 states have call successors, (11) Word has length 161 [2021-12-14 15:43:51,445 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-14 15:43:51,536 INFO L225 Difference]: With dead ends: 40537 [2021-12-14 15:43:51,537 INFO L226 Difference]: Without dead ends: 27517 [2021-12-14 15:43:51,566 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 188 GetRequests, 182 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2021-12-14 15:43:51,567 INFO L933 BasicCegarLoop]: 4318 mSDtfsCounter, 162 mSDsluCounter, 4146 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 162 SdHoareTripleChecker+Valid, 8464 SdHoareTripleChecker+Invalid, 13 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-14 15:43:51,567 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [162 Valid, 8464 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-14 15:43:51,588 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27517 states. [2021-12-14 15:43:52,254 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27517 to 27489. [2021-12-14 15:43:52,287 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 27489 states, 23696 states have (on average 1.3850860904794058) internal successors, (32821), 23934 states have internal predecessors, (32821), 2063 states have call successors, (2063), 1537 states have call predecessors, (2063), 1728 states have return successors, (3558), 2049 states have call predecessors, (3558), 2061 states have call successors, (3558) [2021-12-14 15:43:52,353 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27489 states to 27489 states and 38442 transitions. [2021-12-14 15:43:52,358 INFO L78 Accepts]: Start accepts. Automaton has 27489 states and 38442 transitions. Word has length 161 [2021-12-14 15:43:52,359 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-14 15:43:52,359 INFO L470 AbstractCegarLoop]: Abstraction has 27489 states and 38442 transitions. [2021-12-14 15:43:52,359 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 38.333333333333336) internal successors, (115), 3 states have internal predecessors, (115), 3 states have call successors, (12), 3 states have call predecessors, (12), 2 states have return successors, (11), 2 states have call predecessors, (11), 3 states have call successors, (11) [2021-12-14 15:43:52,359 INFO L276 IsEmpty]: Start isEmpty. Operand 27489 states and 38442 transitions. [2021-12-14 15:43:52,468 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 162 [2021-12-14 15:43:52,468 INFO L506 BasicCegarLoop]: Found error trace [2021-12-14 15:43:52,468 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-14 15:43:52,485 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2021-12-14 15:43:52,681 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-14 15:43:52,681 INFO L402 AbstractCegarLoop]: === Iteration 13 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-14 15:43:52,682 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 15:43:52,682 INFO L85 PathProgramCache]: Analyzing trace with hash -948353227, now seen corresponding path program 1 times [2021-12-14 15:43:52,682 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-14 15:43:52,682 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1668173794] [2021-12-14 15:43:52,682 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 15:43:52,682 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-14 15:43:52,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 15:43:52,700 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2021-12-14 15:43:52,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 15:43:52,709 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2021-12-14 15:43:52,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 15:43:52,716 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2021-12-14 15:43:52,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 15:43:52,748 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2021-12-14 15:43:52,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 15:43:52,768 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2021-12-14 15:43:52,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 15:43:52,772 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2021-12-14 15:43:52,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 15:43:52,776 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-12-14 15:43:52,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 15:43:52,778 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2021-12-14 15:43:52,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 15:43:52,781 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2021-12-14 15:43:52,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 15:43:52,784 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-12-14 15:43:52,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 15:43:52,788 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 146 [2021-12-14 15:43:52,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 15:43:52,789 INFO L134 CoverageAnalysis]: Checked inductivity of 98 backedges. 0 proven. 33 refuted. 0 times theorem prover too weak. 65 trivial. 0 not checked. [2021-12-14 15:43:52,790 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-14 15:43:52,790 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1668173794] [2021-12-14 15:43:52,790 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1668173794] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-14 15:43:52,790 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1768385215] [2021-12-14 15:43:52,790 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 15:43:52,790 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-14 15:43:52,790 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-14 15:43:52,791 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-14 15:43:52,797 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2021-12-14 15:43:52,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 15:43:52,887 INFO L263 TraceCheckSpWp]: Trace formula consists of 544 conjuncts, 2 conjunts are in the unsatisfiable core [2021-12-14 15:43:52,889 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-14 15:43:53,086 INFO L134 CoverageAnalysis]: Checked inductivity of 98 backedges. 70 proven. 0 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2021-12-14 15:43:53,086 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-14 15:43:53,086 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1768385215] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-14 15:43:53,086 INFO L186 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2021-12-14 15:43:53,087 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [7] total 8 [2021-12-14 15:43:53,087 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [394677660] [2021-12-14 15:43:53,087 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-14 15:43:53,088 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-12-14 15:43:53,088 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-14 15:43:53,088 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-12-14 15:43:53,088 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2021-12-14 15:43:53,089 INFO L87 Difference]: Start difference. First operand 27489 states and 38442 transitions. Second operand has 3 states, 3 states have (on average 39.333333333333336) internal successors, (118), 3 states have internal predecessors, (118), 3 states have call successors, (10), 3 states have call predecessors, (10), 3 states have return successors, (10), 3 states have call predecessors, (10), 3 states have call successors, (10) [2021-12-14 15:43:53,745 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-14 15:43:53,745 INFO L93 Difference]: Finished difference Result 45781 states and 64487 transitions. [2021-12-14 15:43:53,745 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-12-14 15:43:53,745 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 39.333333333333336) internal successors, (118), 3 states have internal predecessors, (118), 3 states have call successors, (10), 3 states have call predecessors, (10), 3 states have return successors, (10), 3 states have call predecessors, (10), 3 states have call successors, (10) Word has length 161 [2021-12-14 15:43:53,746 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-14 15:43:53,830 INFO L225 Difference]: With dead ends: 45781 [2021-12-14 15:43:53,830 INFO L226 Difference]: Without dead ends: 24869 [2021-12-14 15:43:53,878 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 188 GetRequests, 182 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2021-12-14 15:43:53,879 INFO L933 BasicCegarLoop]: 4147 mSDtfsCounter, 4081 mSDsluCounter, 33 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4081 SdHoareTripleChecker+Valid, 4180 SdHoareTripleChecker+Invalid, 12 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-14 15:43:53,879 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [4081 Valid, 4180 Invalid, 12 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-14 15:43:53,902 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24869 states. [2021-12-14 15:43:54,626 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24869 to 19189. [2021-12-14 15:43:54,640 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19189 states, 16676 states have (on average 1.3680139122091628) internal successors, (22813), 16806 states have internal predecessors, (22813), 1375 states have call successors, (1375), 1041 states have call predecessors, (1375), 1136 states have return successors, (2154), 1357 states have call predecessors, (2154), 1373 states have call successors, (2154) [2021-12-14 15:43:54,673 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19189 states to 19189 states and 26342 transitions. [2021-12-14 15:43:54,676 INFO L78 Accepts]: Start accepts. Automaton has 19189 states and 26342 transitions. Word has length 161 [2021-12-14 15:43:54,676 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-14 15:43:54,676 INFO L470 AbstractCegarLoop]: Abstraction has 19189 states and 26342 transitions. [2021-12-14 15:43:54,676 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 39.333333333333336) internal successors, (118), 3 states have internal predecessors, (118), 3 states have call successors, (10), 3 states have call predecessors, (10), 3 states have return successors, (10), 3 states have call predecessors, (10), 3 states have call successors, (10) [2021-12-14 15:43:54,676 INFO L276 IsEmpty]: Start isEmpty. Operand 19189 states and 26342 transitions. [2021-12-14 15:43:54,694 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 162 [2021-12-14 15:43:54,694 INFO L506 BasicCegarLoop]: Found error trace [2021-12-14 15:43:54,695 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-14 15:43:54,714 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2021-12-14 15:43:54,911 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-14 15:43:54,911 INFO L402 AbstractCegarLoop]: === Iteration 14 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-14 15:43:54,912 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 15:43:54,912 INFO L85 PathProgramCache]: Analyzing trace with hash -192882952, now seen corresponding path program 1 times [2021-12-14 15:43:54,912 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-14 15:43:54,912 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [902910419] [2021-12-14 15:43:54,912 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 15:43:54,912 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-14 15:43:54,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 15:43:54,928 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2021-12-14 15:43:54,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 15:43:54,935 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2021-12-14 15:43:54,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 15:43:54,943 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2021-12-14 15:43:54,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 15:43:54,971 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2021-12-14 15:43:54,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 15:43:54,974 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2021-12-14 15:43:54,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 15:43:54,976 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2021-12-14 15:43:54,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 15:43:54,979 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-12-14 15:43:54,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 15:43:54,982 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2021-12-14 15:43:54,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 15:43:54,984 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2021-12-14 15:43:54,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 15:43:54,989 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-12-14 15:43:54,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 15:43:54,992 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 146 [2021-12-14 15:43:54,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 15:43:54,994 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 0 proven. 34 refuted. 0 times theorem prover too weak. 66 trivial. 0 not checked. [2021-12-14 15:43:54,994 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-14 15:43:54,994 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [902910419] [2021-12-14 15:43:54,995 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [902910419] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-14 15:43:54,995 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [325378692] [2021-12-14 15:43:54,995 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 15:43:54,995 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-14 15:43:54,995 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-14 15:43:54,996 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-14 15:43:54,997 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2021-12-14 15:43:55,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 15:43:55,077 INFO L263 TraceCheckSpWp]: Trace formula consists of 538 conjuncts, 2 conjunts are in the unsatisfiable core [2021-12-14 15:43:55,079 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-14 15:43:55,241 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 80 proven. 0 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2021-12-14 15:43:55,241 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-14 15:43:55,241 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [325378692] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-14 15:43:55,242 INFO L186 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2021-12-14 15:43:55,242 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [7] total 8 [2021-12-14 15:43:55,242 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [498952996] [2021-12-14 15:43:55,242 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-14 15:43:55,242 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-12-14 15:43:55,243 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-14 15:43:55,243 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-12-14 15:43:55,243 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2021-12-14 15:43:55,243 INFO L87 Difference]: Start difference. First operand 19189 states and 26342 transitions. Second operand has 3 states, 3 states have (on average 39.666666666666664) internal successors, (119), 3 states have internal predecessors, (119), 3 states have call successors, (12), 3 states have call predecessors, (12), 3 states have return successors, (11), 3 states have call predecessors, (11), 3 states have call successors, (11) [2021-12-14 15:43:55,984 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-14 15:43:55,984 INFO L93 Difference]: Finished difference Result 50633 states and 68394 transitions. [2021-12-14 15:43:55,984 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-12-14 15:43:55,985 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 39.666666666666664) internal successors, (119), 3 states have internal predecessors, (119), 3 states have call successors, (12), 3 states have call predecessors, (12), 3 states have return successors, (11), 3 states have call predecessors, (11), 3 states have call successors, (11) Word has length 161 [2021-12-14 15:43:55,986 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-14 15:43:56,093 INFO L225 Difference]: With dead ends: 50633 [2021-12-14 15:43:56,094 INFO L226 Difference]: Without dead ends: 33593 [2021-12-14 15:43:56,135 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 188 GetRequests, 182 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2021-12-14 15:43:56,135 INFO L933 BasicCegarLoop]: 4312 mSDtfsCounter, 149 mSDsluCounter, 4143 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 149 SdHoareTripleChecker+Valid, 8455 SdHoareTripleChecker+Invalid, 13 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-14 15:43:56,135 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [149 Valid, 8455 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-14 15:43:56,164 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33593 states. [2021-12-14 15:43:57,141 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33593 to 33589. [2021-12-14 15:43:57,173 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 33589 states, 28856 states have (on average 1.327314943166066) internal successors, (38301), 29114 states have internal predecessors, (38301), 2603 states have call successors, (2603), 1937 states have call predecessors, (2603), 2128 states have return successors, (4736), 2569 states have call predecessors, (4736), 2601 states have call successors, (4736) [2021-12-14 15:43:57,247 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33589 states to 33589 states and 45640 transitions. [2021-12-14 15:43:57,252 INFO L78 Accepts]: Start accepts. Automaton has 33589 states and 45640 transitions. Word has length 161 [2021-12-14 15:43:57,253 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-14 15:43:57,253 INFO L470 AbstractCegarLoop]: Abstraction has 33589 states and 45640 transitions. [2021-12-14 15:43:57,253 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 39.666666666666664) internal successors, (119), 3 states have internal predecessors, (119), 3 states have call successors, (12), 3 states have call predecessors, (12), 3 states have return successors, (11), 3 states have call predecessors, (11), 3 states have call successors, (11) [2021-12-14 15:43:57,253 INFO L276 IsEmpty]: Start isEmpty. Operand 33589 states and 45640 transitions. [2021-12-14 15:43:57,281 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 162 [2021-12-14 15:43:57,281 INFO L506 BasicCegarLoop]: Found error trace [2021-12-14 15:43:57,281 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2021-12-14 15:43:57,298 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0 [2021-12-14 15:43:57,495 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13 [2021-12-14 15:43:57,495 INFO L402 AbstractCegarLoop]: === Iteration 15 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-14 15:43:57,496 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 15:43:57,496 INFO L85 PathProgramCache]: Analyzing trace with hash 1491732838, now seen corresponding path program 1 times [2021-12-14 15:43:57,496 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-14 15:43:57,496 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2038601135] [2021-12-14 15:43:57,496 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 15:43:57,496 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-14 15:43:57,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 15:43:57,520 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2021-12-14 15:43:57,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 15:43:57,527 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2021-12-14 15:43:57,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 15:43:57,536 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2021-12-14 15:43:57,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 15:43:57,572 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2021-12-14 15:43:57,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 15:43:57,575 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2021-12-14 15:43:57,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 15:43:57,581 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2021-12-14 15:43:57,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 15:43:57,583 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2021-12-14 15:43:57,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 15:43:57,590 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-12-14 15:43:57,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 15:43:57,593 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2021-12-14 15:43:57,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 15:43:57,596 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-12-14 15:43:57,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 15:43:57,599 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 146 [2021-12-14 15:43:57,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 15:43:57,601 INFO L134 CoverageAnalysis]: Checked inductivity of 104 backedges. 0 proven. 34 refuted. 0 times theorem prover too weak. 70 trivial. 0 not checked. [2021-12-14 15:43:57,602 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-14 15:43:57,602 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2038601135] [2021-12-14 15:43:57,602 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2038601135] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-14 15:43:57,602 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [846940611] [2021-12-14 15:43:57,602 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 15:43:57,602 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-14 15:43:57,602 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-14 15:43:57,603 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-14 15:43:57,604 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2021-12-14 15:43:57,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 15:43:57,681 INFO L263 TraceCheckSpWp]: Trace formula consists of 541 conjuncts, 3 conjunts are in the unsatisfiable core [2021-12-14 15:43:57,683 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-14 15:43:57,902 INFO L134 CoverageAnalysis]: Checked inductivity of 104 backedges. 69 proven. 0 refuted. 0 times theorem prover too weak. 35 trivial. 0 not checked. [2021-12-14 15:43:57,902 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-14 15:43:57,902 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [846940611] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-14 15:43:57,902 INFO L186 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2021-12-14 15:43:57,902 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [7] total 8 [2021-12-14 15:43:57,902 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1915798102] [2021-12-14 15:43:57,903 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-14 15:43:57,903 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-12-14 15:43:57,903 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-14 15:43:57,903 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-12-14 15:43:57,903 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2021-12-14 15:43:57,904 INFO L87 Difference]: Start difference. First operand 33589 states and 45640 transitions. Second operand has 3 states, 3 states have (on average 36.333333333333336) internal successors, (109), 3 states have internal predecessors, (109), 3 states have call successors, (10), 3 states have call predecessors, (10), 3 states have return successors, (9), 3 states have call predecessors, (9), 3 states have call successors, (9) [2021-12-14 15:43:58,779 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-14 15:43:58,779 INFO L93 Difference]: Finished difference Result 58387 states and 78608 transitions. [2021-12-14 15:43:58,779 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-12-14 15:43:58,779 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 36.333333333333336) internal successors, (109), 3 states have internal predecessors, (109), 3 states have call successors, (10), 3 states have call predecessors, (10), 3 states have return successors, (9), 3 states have call predecessors, (9), 3 states have call successors, (9) Word has length 161 [2021-12-14 15:43:58,780 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-14 15:43:58,892 INFO L225 Difference]: With dead ends: 58387 [2021-12-14 15:43:58,893 INFO L226 Difference]: Without dead ends: 34097 [2021-12-14 15:43:58,943 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 188 GetRequests, 182 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2021-12-14 15:43:58,944 INFO L933 BasicCegarLoop]: 4185 mSDtfsCounter, 4107 mSDsluCounter, 170 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4107 SdHoareTripleChecker+Valid, 4355 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-14 15:43:58,944 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [4107 Valid, 4355 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-14 15:43:58,973 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34097 states. [2021-12-14 15:44:00,162 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34097 to 33589. [2021-12-14 15:44:00,192 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 33589 states, 28856 states have (on average 1.3198294981979484) internal successors, (38085), 29114 states have internal predecessors, (38085), 2603 states have call successors, (2603), 1937 states have call predecessors, (2603), 2128 states have return successors, (4736), 2569 states have call predecessors, (4736), 2601 states have call successors, (4736) [2021-12-14 15:44:00,270 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33589 states to 33589 states and 45424 transitions. [2021-12-14 15:44:00,275 INFO L78 Accepts]: Start accepts. Automaton has 33589 states and 45424 transitions. Word has length 161 [2021-12-14 15:44:00,275 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-14 15:44:00,275 INFO L470 AbstractCegarLoop]: Abstraction has 33589 states and 45424 transitions. [2021-12-14 15:44:00,275 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 36.333333333333336) internal successors, (109), 3 states have internal predecessors, (109), 3 states have call successors, (10), 3 states have call predecessors, (10), 3 states have return successors, (9), 3 states have call predecessors, (9), 3 states have call successors, (9) [2021-12-14 15:44:00,275 INFO L276 IsEmpty]: Start isEmpty. Operand 33589 states and 45424 transitions. [2021-12-14 15:44:00,304 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 162 [2021-12-14 15:44:00,304 INFO L506 BasicCegarLoop]: Found error trace [2021-12-14 15:44:00,304 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1] [2021-12-14 15:44:00,321 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Ended with exit code 0 [2021-12-14 15:44:00,519 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2021-12-14 15:44:00,519 INFO L402 AbstractCegarLoop]: === Iteration 16 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-14 15:44:00,520 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 15:44:00,520 INFO L85 PathProgramCache]: Analyzing trace with hash -251057197, now seen corresponding path program 1 times [2021-12-14 15:44:00,520 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-14 15:44:00,520 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [127318879] [2021-12-14 15:44:00,520 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 15:44:00,520 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-14 15:44:00,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 15:44:00,552 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2021-12-14 15:44:00,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 15:44:00,561 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2021-12-14 15:44:00,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 15:44:00,568 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2021-12-14 15:44:00,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 15:44:00,597 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2021-12-14 15:44:00,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 15:44:00,600 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2021-12-14 15:44:00,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 15:44:00,602 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2021-12-14 15:44:00,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 15:44:00,604 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2021-12-14 15:44:00,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 15:44:00,608 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-12-14 15:44:00,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 15:44:00,611 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2021-12-14 15:44:00,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 15:44:00,614 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-12-14 15:44:00,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 15:44:00,617 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 146 [2021-12-14 15:44:00,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 15:44:00,620 INFO L134 CoverageAnalysis]: Checked inductivity of 102 backedges. 0 proven. 34 refuted. 0 times theorem prover too weak. 68 trivial. 0 not checked. [2021-12-14 15:44:00,620 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-14 15:44:00,620 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [127318879] [2021-12-14 15:44:00,620 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [127318879] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-14 15:44:00,620 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [68120511] [2021-12-14 15:44:00,620 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 15:44:00,621 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-14 15:44:00,621 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-14 15:44:00,622 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-14 15:44:00,641 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2021-12-14 15:44:00,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 15:44:00,713 INFO L263 TraceCheckSpWp]: Trace formula consists of 544 conjuncts, 3 conjunts are in the unsatisfiable core [2021-12-14 15:44:00,715 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-14 15:44:00,919 INFO L134 CoverageAnalysis]: Checked inductivity of 102 backedges. 62 proven. 0 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2021-12-14 15:44:00,919 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-14 15:44:00,919 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [68120511] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-14 15:44:00,919 INFO L186 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2021-12-14 15:44:00,920 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [7] total 8 [2021-12-14 15:44:00,920 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1932013785] [2021-12-14 15:44:00,920 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-14 15:44:00,920 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-12-14 15:44:00,921 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-14 15:44:00,921 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-12-14 15:44:00,921 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2021-12-14 15:44:00,921 INFO L87 Difference]: Start difference. First operand 33589 states and 45424 transitions. Second operand has 3 states, 3 states have (on average 35.333333333333336) internal successors, (106), 3 states have internal predecessors, (106), 3 states have call successors, (10), 3 states have call predecessors, (10), 3 states have return successors, (9), 3 states have call predecessors, (9), 3 states have call successors, (9) [2021-12-14 15:44:01,975 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-14 15:44:01,976 INFO L93 Difference]: Finished difference Result 57833 states and 77578 transitions. [2021-12-14 15:44:01,976 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-12-14 15:44:01,976 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 35.333333333333336) internal successors, (106), 3 states have internal predecessors, (106), 3 states have call successors, (10), 3 states have call predecessors, (10), 3 states have return successors, (9), 3 states have call predecessors, (9), 3 states have call successors, (9) Word has length 161 [2021-12-14 15:44:01,976 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-14 15:44:02,067 INFO L225 Difference]: With dead ends: 57833 [2021-12-14 15:44:02,068 INFO L226 Difference]: Without dead ends: 34385 [2021-12-14 15:44:02,111 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 188 GetRequests, 182 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2021-12-14 15:44:02,112 INFO L933 BasicCegarLoop]: 4199 mSDtfsCounter, 4106 mSDsluCounter, 172 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4106 SdHoareTripleChecker+Valid, 4371 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-14 15:44:02,112 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [4106 Valid, 4371 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-14 15:44:02,139 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34385 states. [2021-12-14 15:44:03,160 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34385 to 33517. [2021-12-14 15:44:03,191 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 33517 states, 28784 states have (on average 1.3131253474152307) internal successors, (37797), 29042 states have internal predecessors, (37797), 2603 states have call successors, (2603), 1937 states have call predecessors, (2603), 2128 states have return successors, (4736), 2569 states have call predecessors, (4736), 2601 states have call successors, (4736) [2021-12-14 15:44:03,256 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33517 states to 33517 states and 45136 transitions. [2021-12-14 15:44:03,261 INFO L78 Accepts]: Start accepts. Automaton has 33517 states and 45136 transitions. Word has length 161 [2021-12-14 15:44:03,261 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-14 15:44:03,261 INFO L470 AbstractCegarLoop]: Abstraction has 33517 states and 45136 transitions. [2021-12-14 15:44:03,261 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 35.333333333333336) internal successors, (106), 3 states have internal predecessors, (106), 3 states have call successors, (10), 3 states have call predecessors, (10), 3 states have return successors, (9), 3 states have call predecessors, (9), 3 states have call successors, (9) [2021-12-14 15:44:03,262 INFO L276 IsEmpty]: Start isEmpty. Operand 33517 states and 45136 transitions. [2021-12-14 15:44:03,380 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 162 [2021-12-14 15:44:03,381 INFO L506 BasicCegarLoop]: Found error trace [2021-12-14 15:44:03,381 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2021-12-14 15:44:03,397 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2021-12-14 15:44:03,583 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2021-12-14 15:44:03,584 INFO L402 AbstractCegarLoop]: === Iteration 17 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-14 15:44:03,584 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 15:44:03,584 INFO L85 PathProgramCache]: Analyzing trace with hash -2084105626, now seen corresponding path program 1 times [2021-12-14 15:44:03,584 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-14 15:44:03,584 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1172908148] [2021-12-14 15:44:03,584 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 15:44:03,584 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-14 15:44:03,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 15:44:03,605 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2021-12-14 15:44:03,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 15:44:03,614 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2021-12-14 15:44:03,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 15:44:03,621 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2021-12-14 15:44:03,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 15:44:03,624 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2021-12-14 15:44:03,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 15:44:03,642 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2021-12-14 15:44:03,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 15:44:03,643 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2021-12-14 15:44:03,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 15:44:03,645 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2021-12-14 15:44:03,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 15:44:03,651 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-12-14 15:44:03,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 15:44:03,654 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2021-12-14 15:44:03,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 15:44:03,657 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-12-14 15:44:03,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 15:44:03,659 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 146 [2021-12-14 15:44:03,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 15:44:03,661 INFO L134 CoverageAnalysis]: Checked inductivity of 104 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 104 trivial. 0 not checked. [2021-12-14 15:44:03,661 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-14 15:44:03,661 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1172908148] [2021-12-14 15:44:03,661 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1172908148] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-14 15:44:03,662 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-14 15:44:03,662 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-12-14 15:44:03,662 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1757435381] [2021-12-14 15:44:03,662 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-14 15:44:03,662 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-12-14 15:44:03,662 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-14 15:44:03,663 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-12-14 15:44:03,663 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-12-14 15:44:03,663 INFO L87 Difference]: Start difference. First operand 33517 states and 45136 transitions. Second operand has 5 states, 5 states have (on average 15.2) internal successors, (76), 3 states have internal predecessors, (76), 3 states have call successors, (9), 4 states have call predecessors, (9), 1 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) [2021-12-14 15:44:04,820 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-14 15:44:04,820 INFO L93 Difference]: Finished difference Result 63727 states and 84123 transitions. [2021-12-14 15:44:04,821 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-12-14 15:44:04,821 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 15.2) internal successors, (76), 3 states have internal predecessors, (76), 3 states have call successors, (9), 4 states have call predecessors, (9), 1 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) Word has length 161 [2021-12-14 15:44:04,821 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-14 15:44:04,890 INFO L225 Difference]: With dead ends: 63727 [2021-12-14 15:44:04,891 INFO L226 Difference]: Without dead ends: 32355 [2021-12-14 15:44:04,929 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 25 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2021-12-14 15:44:04,930 INFO L933 BasicCegarLoop]: 4146 mSDtfsCounter, 294 mSDsluCounter, 12026 mSDsCounter, 0 mSdLazyCounter, 160 mSolverCounterSat, 49 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 310 SdHoareTripleChecker+Valid, 16172 SdHoareTripleChecker+Invalid, 209 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 49 IncrementalHoareTripleChecker+Valid, 160 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2021-12-14 15:44:04,930 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [310 Valid, 16172 Invalid, 209 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [49 Valid, 160 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2021-12-14 15:44:04,951 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32355 states. [2021-12-14 15:44:06,220 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32355 to 30363. [2021-12-14 15:44:06,241 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 30363 states, 26282 states have (on average 1.3175937904269082) internal successors, (34629), 26796 states have internal predecessors, (34629), 1983 states have call successors, (1983), 1489 states have call predecessors, (1983), 2096 states have return successors, (3933), 2093 states have call predecessors, (3933), 1981 states have call successors, (3933) [2021-12-14 15:44:06,290 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30363 states to 30363 states and 40545 transitions. [2021-12-14 15:44:06,295 INFO L78 Accepts]: Start accepts. Automaton has 30363 states and 40545 transitions. Word has length 161 [2021-12-14 15:44:06,296 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-14 15:44:06,296 INFO L470 AbstractCegarLoop]: Abstraction has 30363 states and 40545 transitions. [2021-12-14 15:44:06,296 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 15.2) internal successors, (76), 3 states have internal predecessors, (76), 3 states have call successors, (9), 4 states have call predecessors, (9), 1 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) [2021-12-14 15:44:06,296 INFO L276 IsEmpty]: Start isEmpty. Operand 30363 states and 40545 transitions. [2021-12-14 15:44:06,312 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 162 [2021-12-14 15:44:06,312 INFO L506 BasicCegarLoop]: Found error trace [2021-12-14 15:44:06,313 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-14 15:44:06,313 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2021-12-14 15:44:06,313 INFO L402 AbstractCegarLoop]: === Iteration 18 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-14 15:44:06,313 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 15:44:06,313 INFO L85 PathProgramCache]: Analyzing trace with hash 641108433, now seen corresponding path program 1 times [2021-12-14 15:44:06,313 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-14 15:44:06,313 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2130338896] [2021-12-14 15:44:06,313 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 15:44:06,314 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-14 15:44:06,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 15:44:06,329 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2021-12-14 15:44:06,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 15:44:06,336 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2021-12-14 15:44:06,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 15:44:06,342 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2021-12-14 15:44:06,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 15:44:06,344 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2021-12-14 15:44:06,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 15:44:06,347 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2021-12-14 15:44:06,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 15:44:06,349 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2021-12-14 15:44:06,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 15:44:06,351 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2021-12-14 15:44:06,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 15:44:06,361 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-12-14 15:44:06,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 15:44:06,365 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2021-12-14 15:44:06,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 15:44:06,368 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-12-14 15:44:06,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 15:44:06,370 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 146 [2021-12-14 15:44:06,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 15:44:06,372 INFO L134 CoverageAnalysis]: Checked inductivity of 102 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 102 trivial. 0 not checked. [2021-12-14 15:44:06,373 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-14 15:44:06,373 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2130338896] [2021-12-14 15:44:06,373 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2130338896] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-14 15:44:06,373 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-14 15:44:06,373 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-12-14 15:44:06,373 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [981428898] [2021-12-14 15:44:06,374 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-14 15:44:06,374 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-12-14 15:44:06,374 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-14 15:44:06,374 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-12-14 15:44:06,375 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-12-14 15:44:06,375 INFO L87 Difference]: Start difference. First operand 30363 states and 40545 transitions. Second operand has 5 states, 5 states have (on average 15.8) internal successors, (79), 3 states have internal predecessors, (79), 3 states have call successors, (9), 4 states have call predecessors, (9), 1 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) [2021-12-14 15:44:07,290 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-14 15:44:07,290 INFO L93 Difference]: Finished difference Result 53149 states and 69944 transitions. [2021-12-14 15:44:07,291 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-12-14 15:44:07,291 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 15.8) internal successors, (79), 3 states have internal predecessors, (79), 3 states have call successors, (9), 4 states have call predecessors, (9), 1 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) Word has length 161 [2021-12-14 15:44:07,291 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-14 15:44:07,345 INFO L225 Difference]: With dead ends: 53149 [2021-12-14 15:44:07,345 INFO L226 Difference]: Without dead ends: 24923 [2021-12-14 15:44:07,376 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 25 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2021-12-14 15:44:07,377 INFO L933 BasicCegarLoop]: 4145 mSDtfsCounter, 294 mSDsluCounter, 12025 mSDsCounter, 0 mSdLazyCounter, 159 mSolverCounterSat, 49 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 310 SdHoareTripleChecker+Valid, 16170 SdHoareTripleChecker+Invalid, 208 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 49 IncrementalHoareTripleChecker+Valid, 159 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-14 15:44:07,377 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [310 Valid, 16170 Invalid, 208 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [49 Valid, 159 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-14 15:44:07,393 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24923 states. [2021-12-14 15:44:08,025 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24923 to 23065. [2021-12-14 15:44:08,045 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 23065 states, 20082 states have (on average 1.3415496464495569) internal successors, (26941), 20442 states have internal predecessors, (26941), 1457 states have call successors, (1457), 1101 states have call predecessors, (1457), 1524 states have return successors, (2723), 1529 states have call predecessors, (2723), 1455 states have call successors, (2723) [2021-12-14 15:44:08,088 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23065 states to 23065 states and 31121 transitions. [2021-12-14 15:44:08,092 INFO L78 Accepts]: Start accepts. Automaton has 23065 states and 31121 transitions. Word has length 161 [2021-12-14 15:44:08,092 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-14 15:44:08,092 INFO L470 AbstractCegarLoop]: Abstraction has 23065 states and 31121 transitions. [2021-12-14 15:44:08,093 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 15.8) internal successors, (79), 3 states have internal predecessors, (79), 3 states have call successors, (9), 4 states have call predecessors, (9), 1 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) [2021-12-14 15:44:08,093 INFO L276 IsEmpty]: Start isEmpty. Operand 23065 states and 31121 transitions. [2021-12-14 15:44:08,106 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 164 [2021-12-14 15:44:08,106 INFO L506 BasicCegarLoop]: Found error trace [2021-12-14 15:44:08,106 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1] [2021-12-14 15:44:08,162 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2021-12-14 15:44:08,162 INFO L402 AbstractCegarLoop]: === Iteration 19 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-14 15:44:08,163 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 15:44:08,163 INFO L85 PathProgramCache]: Analyzing trace with hash -22034244, now seen corresponding path program 1 times [2021-12-14 15:44:08,163 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-14 15:44:08,163 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1956928445] [2021-12-14 15:44:08,163 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 15:44:08,163 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-14 15:44:08,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 15:44:08,179 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2021-12-14 15:44:08,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 15:44:08,187 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2021-12-14 15:44:08,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 15:44:08,194 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2021-12-14 15:44:08,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 15:44:08,226 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2021-12-14 15:44:08,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 15:44:08,229 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2021-12-14 15:44:08,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 15:44:08,231 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2021-12-14 15:44:08,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 15:44:08,234 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2021-12-14 15:44:08,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 15:44:08,238 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-12-14 15:44:08,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 15:44:08,242 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2021-12-14 15:44:08,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 15:44:08,245 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-12-14 15:44:08,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 15:44:08,248 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 148 [2021-12-14 15:44:08,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 15:44:08,251 INFO L134 CoverageAnalysis]: Checked inductivity of 105 backedges. 0 proven. 34 refuted. 0 times theorem prover too weak. 71 trivial. 0 not checked. [2021-12-14 15:44:08,252 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-14 15:44:08,252 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1956928445] [2021-12-14 15:44:08,252 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1956928445] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-14 15:44:08,252 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1020171183] [2021-12-14 15:44:08,252 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 15:44:08,252 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-14 15:44:08,253 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-14 15:44:08,261 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-14 15:44:08,263 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2021-12-14 15:44:08,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 15:44:08,344 INFO L263 TraceCheckSpWp]: Trace formula consists of 555 conjuncts, 3 conjunts are in the unsatisfiable core [2021-12-14 15:44:08,346 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-14 15:44:08,486 INFO L134 CoverageAnalysis]: Checked inductivity of 105 backedges. 91 proven. 0 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2021-12-14 15:44:08,486 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-14 15:44:08,486 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1020171183] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-14 15:44:08,486 INFO L186 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2021-12-14 15:44:08,486 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [7] total 8 [2021-12-14 15:44:08,487 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1131431006] [2021-12-14 15:44:08,487 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-14 15:44:08,488 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-12-14 15:44:08,488 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-14 15:44:08,488 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-12-14 15:44:08,488 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2021-12-14 15:44:08,489 INFO L87 Difference]: Start difference. First operand 23065 states and 31121 transitions. Second operand has 3 states, 3 states have (on average 42.666666666666664) internal successors, (128), 3 states have internal predecessors, (128), 3 states have call successors, (12), 3 states have call predecessors, (12), 3 states have return successors, (11), 3 states have call predecessors, (11), 3 states have call successors, (11) [2021-12-14 15:44:09,062 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-14 15:44:09,063 INFO L93 Difference]: Finished difference Result 36999 states and 50557 transitions. [2021-12-14 15:44:09,063 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-12-14 15:44:09,063 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 42.666666666666664) internal successors, (128), 3 states have internal predecessors, (128), 3 states have call successors, (12), 3 states have call predecessors, (12), 3 states have return successors, (11), 3 states have call predecessors, (11), 3 states have call successors, (11) Word has length 163 [2021-12-14 15:44:09,063 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-14 15:44:09,114 INFO L225 Difference]: With dead ends: 36999 [2021-12-14 15:44:09,114 INFO L226 Difference]: Without dead ends: 23165 [2021-12-14 15:44:09,142 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 190 GetRequests, 184 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2021-12-14 15:44:09,142 INFO L933 BasicCegarLoop]: 4250 mSDtfsCounter, 141 mSDsluCounter, 4126 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 141 SdHoareTripleChecker+Valid, 8376 SdHoareTripleChecker+Invalid, 10 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-14 15:44:09,143 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [141 Valid, 8376 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-14 15:44:09,159 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23165 states. [2021-12-14 15:44:09,886 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23165 to 23065. [2021-12-14 15:44:09,906 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 23065 states, 20082 states have (on average 1.3218304949706206) internal successors, (26545), 20442 states have internal predecessors, (26545), 1457 states have call successors, (1457), 1101 states have call predecessors, (1457), 1524 states have return successors, (2723), 1529 states have call predecessors, (2723), 1455 states have call successors, (2723) [2021-12-14 15:44:09,945 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23065 states to 23065 states and 30725 transitions. [2021-12-14 15:44:09,948 INFO L78 Accepts]: Start accepts. Automaton has 23065 states and 30725 transitions. Word has length 163 [2021-12-14 15:44:09,948 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-14 15:44:09,948 INFO L470 AbstractCegarLoop]: Abstraction has 23065 states and 30725 transitions. [2021-12-14 15:44:09,948 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 42.666666666666664) internal successors, (128), 3 states have internal predecessors, (128), 3 states have call successors, (12), 3 states have call predecessors, (12), 3 states have return successors, (11), 3 states have call predecessors, (11), 3 states have call successors, (11) [2021-12-14 15:44:09,948 INFO L276 IsEmpty]: Start isEmpty. Operand 23065 states and 30725 transitions. [2021-12-14 15:44:09,961 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 164 [2021-12-14 15:44:09,961 INFO L506 BasicCegarLoop]: Found error trace [2021-12-14 15:44:09,961 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-14 15:44:09,977 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Forceful destruction successful, exit code 0 [2021-12-14 15:44:10,161 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-14 15:44:10,162 INFO L402 AbstractCegarLoop]: === Iteration 20 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-14 15:44:10,162 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 15:44:10,162 INFO L85 PathProgramCache]: Analyzing trace with hash 1309860060, now seen corresponding path program 1 times [2021-12-14 15:44:10,162 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-14 15:44:10,162 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1296775959] [2021-12-14 15:44:10,162 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 15:44:10,162 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-14 15:44:10,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 15:44:10,175 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2021-12-14 15:44:10,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 15:44:10,182 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2021-12-14 15:44:10,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 15:44:10,188 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2021-12-14 15:44:10,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 15:44:10,214 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2021-12-14 15:44:10,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 15:44:10,217 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2021-12-14 15:44:10,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 15:44:10,218 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2021-12-14 15:44:10,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 15:44:10,220 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2021-12-14 15:44:10,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 15:44:10,223 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-12-14 15:44:10,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 15:44:10,225 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2021-12-14 15:44:10,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 15:44:10,228 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-12-14 15:44:10,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 15:44:10,230 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 148 [2021-12-14 15:44:10,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 15:44:10,232 INFO L134 CoverageAnalysis]: Checked inductivity of 103 backedges. 0 proven. 32 refuted. 0 times theorem prover too weak. 71 trivial. 0 not checked. [2021-12-14 15:44:10,232 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-14 15:44:10,232 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1296775959] [2021-12-14 15:44:10,233 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1296775959] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-14 15:44:10,233 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [379813033] [2021-12-14 15:44:10,233 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 15:44:10,233 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-14 15:44:10,233 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-14 15:44:10,234 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-14 15:44:10,235 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2021-12-14 15:44:10,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 15:44:10,311 INFO L263 TraceCheckSpWp]: Trace formula consists of 561 conjuncts, 2 conjunts are in the unsatisfiable core [2021-12-14 15:44:10,313 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-14 15:44:10,471 INFO L134 CoverageAnalysis]: Checked inductivity of 103 backedges. 73 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2021-12-14 15:44:10,471 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-14 15:44:10,471 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [379813033] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-14 15:44:10,471 INFO L186 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2021-12-14 15:44:10,471 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [7] total 8 [2021-12-14 15:44:10,472 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1875425636] [2021-12-14 15:44:10,472 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-14 15:44:10,472 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-12-14 15:44:10,472 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-14 15:44:10,472 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-12-14 15:44:10,472 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2021-12-14 15:44:10,473 INFO L87 Difference]: Start difference. First operand 23065 states and 30725 transitions. Second operand has 3 states, 3 states have (on average 38.333333333333336) internal successors, (115), 3 states have internal predecessors, (115), 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) [2021-12-14 15:44:11,205 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-14 15:44:11,205 INFO L93 Difference]: Finished difference Result 40981 states and 54667 transitions. [2021-12-14 15:44:11,206 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-12-14 15:44:11,206 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 38.333333333333336) internal successors, (115), 3 states have internal predecessors, (115), 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 163 [2021-12-14 15:44:11,206 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-14 15:44:11,249 INFO L225 Difference]: With dead ends: 40981 [2021-12-14 15:44:11,249 INFO L226 Difference]: Without dead ends: 21259 [2021-12-14 15:44:11,283 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 190 GetRequests, 184 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2021-12-14 15:44:11,284 INFO L933 BasicCegarLoop]: 4146 mSDtfsCounter, 4121 mSDsluCounter, 32 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4121 SdHoareTripleChecker+Valid, 4178 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-14 15:44:11,284 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [4121 Valid, 4178 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-14 15:44:11,302 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21259 states. [2021-12-14 15:44:12,069 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21259 to 20493. [2021-12-14 15:44:12,089 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20493 states, 17926 states have (on average 1.2979471159210085) internal successors, (23267), 18223 states have internal predecessors, (23267), 1261 states have call successors, (1261), 953 states have call predecessors, (1261), 1304 states have return successors, (2213), 1320 states have call predecessors, (2213), 1259 states have call successors, (2213) [2021-12-14 15:44:12,133 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20493 states to 20493 states and 26741 transitions. [2021-12-14 15:44:12,136 INFO L78 Accepts]: Start accepts. Automaton has 20493 states and 26741 transitions. Word has length 163 [2021-12-14 15:44:12,136 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-14 15:44:12,136 INFO L470 AbstractCegarLoop]: Abstraction has 20493 states and 26741 transitions. [2021-12-14 15:44:12,136 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 38.333333333333336) internal successors, (115), 3 states have internal predecessors, (115), 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) [2021-12-14 15:44:12,136 INFO L276 IsEmpty]: Start isEmpty. Operand 20493 states and 26741 transitions. [2021-12-14 15:44:12,146 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 164 [2021-12-14 15:44:12,146 INFO L506 BasicCegarLoop]: Found error trace [2021-12-14 15:44:12,146 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-14 15:44:12,164 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Forceful destruction successful, exit code 0 [2021-12-14 15:44:12,346 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-14 15:44:12,347 INFO L402 AbstractCegarLoop]: === Iteration 21 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-14 15:44:12,347 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 15:44:12,347 INFO L85 PathProgramCache]: Analyzing trace with hash 1003109181, now seen corresponding path program 1 times [2021-12-14 15:44:12,347 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-14 15:44:12,347 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [427945901] [2021-12-14 15:44:12,348 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 15:44:12,348 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-14 15:44:12,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 15:44:12,366 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2021-12-14 15:44:12,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 15:44:12,373 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2021-12-14 15:44:12,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 15:44:12,379 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2021-12-14 15:44:12,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 15:44:12,405 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2021-12-14 15:44:12,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 15:44:12,408 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2021-12-14 15:44:12,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 15:44:12,409 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2021-12-14 15:44:12,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 15:44:12,411 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2021-12-14 15:44:12,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 15:44:12,413 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-12-14 15:44:12,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 15:44:12,416 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2021-12-14 15:44:12,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 15:44:12,419 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-12-14 15:44:12,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 15:44:12,421 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 148 [2021-12-14 15:44:12,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 15:44:12,423 INFO L134 CoverageAnalysis]: Checked inductivity of 103 backedges. 0 proven. 34 refuted. 0 times theorem prover too weak. 69 trivial. 0 not checked. [2021-12-14 15:44:12,424 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-14 15:44:12,424 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [427945901] [2021-12-14 15:44:12,424 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [427945901] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-14 15:44:12,424 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1957586446] [2021-12-14 15:44:12,424 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 15:44:12,424 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-14 15:44:12,425 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-14 15:44:12,425 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-14 15:44:12,426 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2021-12-14 15:44:12,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 15:44:12,515 INFO L263 TraceCheckSpWp]: Trace formula consists of 555 conjuncts, 3 conjunts are in the unsatisfiable core [2021-12-14 15:44:12,518 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-14 15:44:12,697 INFO L134 CoverageAnalysis]: Checked inductivity of 103 backedges. 95 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2021-12-14 15:44:12,697 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-14 15:44:12,698 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1957586446] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-14 15:44:12,698 INFO L186 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2021-12-14 15:44:12,698 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [7] total 8 [2021-12-14 15:44:12,698 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [415264407] [2021-12-14 15:44:12,698 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-14 15:44:12,698 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-12-14 15:44:12,698 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-14 15:44:12,699 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-12-14 15:44:12,699 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2021-12-14 15:44:12,699 INFO L87 Difference]: Start difference. First operand 20493 states and 26741 transitions. Second operand has 3 states, 3 states have (on average 44.666666666666664) internal successors, (134), 3 states have internal predecessors, (134), 3 states have call successors, (12), 3 states have call predecessors, (12), 3 states have return successors, (11), 3 states have call predecessors, (11), 3 states have call successors, (11) [2021-12-14 15:44:13,349 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-14 15:44:13,350 INFO L93 Difference]: Finished difference Result 33605 states and 44123 transitions. [2021-12-14 15:44:13,350 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-12-14 15:44:13,350 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 44.666666666666664) internal successors, (134), 3 states have internal predecessors, (134), 3 states have call successors, (12), 3 states have call predecessors, (12), 3 states have return successors, (11), 3 states have call predecessors, (11), 3 states have call successors, (11) Word has length 163 [2021-12-14 15:44:13,350 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-14 15:44:13,396 INFO L225 Difference]: With dead ends: 33605 [2021-12-14 15:44:13,396 INFO L226 Difference]: Without dead ends: 20585 [2021-12-14 15:44:13,423 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 190 GetRequests, 184 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2021-12-14 15:44:13,424 INFO L933 BasicCegarLoop]: 4293 mSDtfsCounter, 134 mSDsluCounter, 4125 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 134 SdHoareTripleChecker+Valid, 8418 SdHoareTripleChecker+Invalid, 10 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-14 15:44:13,424 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [134 Valid, 8418 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-14 15:44:13,438 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20585 states. [2021-12-14 15:44:14,044 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20585 to 20493. [2021-12-14 15:44:14,065 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20493 states, 17926 states have (on average 1.2739596117371417) internal successors, (22837), 18223 states have internal predecessors, (22837), 1261 states have call successors, (1261), 953 states have call predecessors, (1261), 1304 states have return successors, (2213), 1320 states have call predecessors, (2213), 1259 states have call successors, (2213) [2021-12-14 15:44:14,102 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20493 states to 20493 states and 26311 transitions. [2021-12-14 15:44:14,105 INFO L78 Accepts]: Start accepts. Automaton has 20493 states and 26311 transitions. Word has length 163 [2021-12-14 15:44:14,105 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-14 15:44:14,105 INFO L470 AbstractCegarLoop]: Abstraction has 20493 states and 26311 transitions. [2021-12-14 15:44:14,105 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 44.666666666666664) internal successors, (134), 3 states have internal predecessors, (134), 3 states have call successors, (12), 3 states have call predecessors, (12), 3 states have return successors, (11), 3 states have call predecessors, (11), 3 states have call successors, (11) [2021-12-14 15:44:14,105 INFO L276 IsEmpty]: Start isEmpty. Operand 20493 states and 26311 transitions. [2021-12-14 15:44:14,114 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 165 [2021-12-14 15:44:14,115 INFO L506 BasicCegarLoop]: Found error trace [2021-12-14 15:44:14,115 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-14 15:44:14,131 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Forceful destruction successful, exit code 0 [2021-12-14 15:44:14,315 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable20 [2021-12-14 15:44:14,316 INFO L402 AbstractCegarLoop]: === Iteration 22 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-14 15:44:14,316 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 15:44:14,316 INFO L85 PathProgramCache]: Analyzing trace with hash -1504083699, now seen corresponding path program 1 times [2021-12-14 15:44:14,316 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-14 15:44:14,316 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [63198754] [2021-12-14 15:44:14,316 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 15:44:14,317 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-14 15:44:14,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 15:44:14,329 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2021-12-14 15:44:14,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 15:44:14,336 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2021-12-14 15:44:14,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 15:44:14,341 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2021-12-14 15:44:14,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 15:44:14,368 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2021-12-14 15:44:14,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 15:44:14,371 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2021-12-14 15:44:14,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 15:44:14,372 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2021-12-14 15:44:14,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 15:44:14,374 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2021-12-14 15:44:14,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 15:44:14,376 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-12-14 15:44:14,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 15:44:14,378 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2021-12-14 15:44:14,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 15:44:14,381 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-12-14 15:44:14,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 15:44:14,383 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 149 [2021-12-14 15:44:14,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 15:44:14,385 INFO L134 CoverageAnalysis]: Checked inductivity of 104 backedges. 0 proven. 33 refuted. 0 times theorem prover too weak. 71 trivial. 0 not checked. [2021-12-14 15:44:14,385 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-14 15:44:14,385 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [63198754] [2021-12-14 15:44:14,385 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [63198754] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-14 15:44:14,385 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [821814103] [2021-12-14 15:44:14,385 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 15:44:14,386 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-14 15:44:14,386 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-14 15:44:14,387 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-14 15:44:14,388 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Waiting until timeout for monitored process [2021-12-14 15:44:14,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 15:44:14,471 INFO L263 TraceCheckSpWp]: Trace formula consists of 557 conjuncts, 3 conjunts are in the unsatisfiable core [2021-12-14 15:44:14,473 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-14 15:44:14,648 INFO L134 CoverageAnalysis]: Checked inductivity of 104 backedges. 74 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2021-12-14 15:44:14,648 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-14 15:44:14,648 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [821814103] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-14 15:44:14,648 INFO L186 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2021-12-14 15:44:14,648 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [7] total 8 [2021-12-14 15:44:14,649 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [674162853] [2021-12-14 15:44:14,649 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-14 15:44:14,649 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-12-14 15:44:14,649 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-14 15:44:14,649 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-12-14 15:44:14,649 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2021-12-14 15:44:14,649 INFO L87 Difference]: Start difference. First operand 20493 states and 26311 transitions. Second operand has 3 states, 3 states have (on average 38.666666666666664) internal successors, (116), 3 states have internal predecessors, (116), 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) [2021-12-14 15:44:15,248 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-14 15:44:15,248 INFO L93 Difference]: Finished difference Result 29178 states and 37623 transitions. [2021-12-14 15:44:15,250 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-12-14 15:44:15,250 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 38.666666666666664) internal successors, (116), 3 states have internal predecessors, (116), 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 164 [2021-12-14 15:44:15,251 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-14 15:44:15,294 INFO L225 Difference]: With dead ends: 29178 [2021-12-14 15:44:15,294 INFO L226 Difference]: Without dead ends: 20523 [2021-12-14 15:44:15,318 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 191 GetRequests, 185 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2021-12-14 15:44:15,318 INFO L933 BasicCegarLoop]: 4273 mSDtfsCounter, 155 mSDsluCounter, 4117 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 155 SdHoareTripleChecker+Valid, 8390 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-14 15:44:15,318 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [155 Valid, 8390 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-14 15:44:15,334 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20523 states. [2021-12-14 15:44:15,921 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20523 to 20493. [2021-12-14 15:44:15,937 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20493 states, 17926 states have (on average 1.2651455985719067) internal successors, (22679), 18223 states have internal predecessors, (22679), 1261 states have call successors, (1261), 953 states have call predecessors, (1261), 1304 states have return successors, (2213), 1320 states have call predecessors, (2213), 1259 states have call successors, (2213) [2021-12-14 15:44:15,970 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20493 states to 20493 states and 26153 transitions. [2021-12-14 15:44:15,972 INFO L78 Accepts]: Start accepts. Automaton has 20493 states and 26153 transitions. Word has length 164 [2021-12-14 15:44:15,973 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-14 15:44:15,973 INFO L470 AbstractCegarLoop]: Abstraction has 20493 states and 26153 transitions. [2021-12-14 15:44:15,973 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 38.666666666666664) internal successors, (116), 3 states have internal predecessors, (116), 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) [2021-12-14 15:44:15,973 INFO L276 IsEmpty]: Start isEmpty. Operand 20493 states and 26153 transitions. [2021-12-14 15:44:15,981 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 166 [2021-12-14 15:44:15,981 INFO L506 BasicCegarLoop]: Found error trace [2021-12-14 15:44:15,981 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-14 15:44:15,998 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Forceful destruction successful, exit code 0 [2021-12-14 15:44:16,183 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21,15 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-14 15:44:16,183 INFO L402 AbstractCegarLoop]: === Iteration 23 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-14 15:44:16,183 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 15:44:16,184 INFO L85 PathProgramCache]: Analyzing trace with hash -465623340, now seen corresponding path program 1 times [2021-12-14 15:44:16,184 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-14 15:44:16,184 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1964117593] [2021-12-14 15:44:16,184 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 15:44:16,184 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-14 15:44:16,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 15:44:16,198 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2021-12-14 15:44:16,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 15:44:16,204 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2021-12-14 15:44:16,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 15:44:16,209 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2021-12-14 15:44:16,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 15:44:16,234 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2021-12-14 15:44:16,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 15:44:16,236 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2021-12-14 15:44:16,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 15:44:16,237 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2021-12-14 15:44:16,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 15:44:16,239 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2021-12-14 15:44:16,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 15:44:16,243 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-12-14 15:44:16,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 15:44:16,245 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2021-12-14 15:44:16,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 15:44:16,248 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-12-14 15:44:16,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 15:44:16,250 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 150 [2021-12-14 15:44:16,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 15:44:16,254 INFO L134 CoverageAnalysis]: Checked inductivity of 104 backedges. 0 proven. 33 refuted. 0 times theorem prover too weak. 71 trivial. 0 not checked. [2021-12-14 15:44:16,255 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-14 15:44:16,255 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1964117593] [2021-12-14 15:44:16,255 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1964117593] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-14 15:44:16,255 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1109875564] [2021-12-14 15:44:16,255 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 15:44:16,255 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-14 15:44:16,255 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-14 15:44:16,256 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-14 15:44:16,282 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Waiting until timeout for monitored process [2021-12-14 15:44:16,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 15:44:16,334 INFO L263 TraceCheckSpWp]: Trace formula consists of 559 conjuncts, 6 conjunts are in the unsatisfiable core [2021-12-14 15:44:16,336 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-14 15:44:16,566 INFO L134 CoverageAnalysis]: Checked inductivity of 104 backedges. 39 proven. 0 refuted. 0 times theorem prover too weak. 65 trivial. 0 not checked. [2021-12-14 15:44:16,566 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-14 15:44:16,566 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1109875564] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-14 15:44:16,566 INFO L186 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2021-12-14 15:44:16,566 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [7] total 10 [2021-12-14 15:44:16,566 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1719892833] [2021-12-14 15:44:16,567 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-14 15:44:16,567 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-12-14 15:44:16,567 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-14 15:44:16,567 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-12-14 15:44:16,567 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2021-12-14 15:44:16,567 INFO L87 Difference]: Start difference. First operand 20493 states and 26153 transitions. Second operand has 5 states, 5 states have (on average 20.0) internal successors, (100), 4 states have internal predecessors, (100), 2 states have call successors, (9), 3 states have call predecessors, (9), 4 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2021-12-14 15:44:17,277 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-14 15:44:17,278 INFO L93 Difference]: Finished difference Result 38811 states and 48454 transitions. [2021-12-14 15:44:17,278 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-12-14 15:44:17,278 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 20.0) internal successors, (100), 4 states have internal predecessors, (100), 2 states have call successors, (9), 3 states have call predecessors, (9), 4 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) Word has length 165 [2021-12-14 15:44:17,278 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-14 15:44:17,321 INFO L225 Difference]: With dead ends: 38811 [2021-12-14 15:44:17,321 INFO L226 Difference]: Without dead ends: 20457 [2021-12-14 15:44:17,350 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 193 GetRequests, 184 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=88, Unknown=0, NotChecked=0, Total=110 [2021-12-14 15:44:17,350 INFO L933 BasicCegarLoop]: 4121 mSDtfsCounter, 4145 mSDsluCounter, 8103 mSDsCounter, 0 mSdLazyCounter, 116 mSolverCounterSat, 24 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4154 SdHoareTripleChecker+Valid, 12224 SdHoareTripleChecker+Invalid, 140 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 24 IncrementalHoareTripleChecker+Valid, 116 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-14 15:44:17,351 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [4154 Valid, 12224 Invalid, 140 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [24 Valid, 116 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-14 15:44:17,364 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20457 states. [2021-12-14 15:44:18,082 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20457 to 20457. [2021-12-14 15:44:18,098 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20457 states, 17890 states have (on average 1.2502515371716043) internal successors, (22367), 18187 states have internal predecessors, (22367), 1261 states have call successors, (1261), 953 states have call predecessors, (1261), 1304 states have return successors, (2213), 1320 states have call predecessors, (2213), 1259 states have call successors, (2213) [2021-12-14 15:44:18,130 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20457 states to 20457 states and 25841 transitions. [2021-12-14 15:44:18,133 INFO L78 Accepts]: Start accepts. Automaton has 20457 states and 25841 transitions. Word has length 165 [2021-12-14 15:44:18,133 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-14 15:44:18,133 INFO L470 AbstractCegarLoop]: Abstraction has 20457 states and 25841 transitions. [2021-12-14 15:44:18,133 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 20.0) internal successors, (100), 4 states have internal predecessors, (100), 2 states have call successors, (9), 3 states have call predecessors, (9), 4 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2021-12-14 15:44:18,133 INFO L276 IsEmpty]: Start isEmpty. Operand 20457 states and 25841 transitions. [2021-12-14 15:44:18,142 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 166 [2021-12-14 15:44:18,142 INFO L506 BasicCegarLoop]: Found error trace [2021-12-14 15:44:18,142 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-14 15:44:18,159 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Forceful destruction successful, exit code 0 [2021-12-14 15:44:18,342 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22,16 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-14 15:44:18,343 INFO L402 AbstractCegarLoop]: === Iteration 24 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-14 15:44:18,343 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 15:44:18,343 INFO L85 PathProgramCache]: Analyzing trace with hash 22423766, now seen corresponding path program 1 times [2021-12-14 15:44:18,343 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-14 15:44:18,344 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1347154194] [2021-12-14 15:44:18,344 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 15:44:18,344 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-14 15:44:18,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 15:44:18,361 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2021-12-14 15:44:18,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 15:44:18,369 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2021-12-14 15:44:18,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 15:44:18,374 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2021-12-14 15:44:18,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 15:44:18,403 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2021-12-14 15:44:18,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 15:44:18,406 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2021-12-14 15:44:18,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 15:44:18,407 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2021-12-14 15:44:18,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 15:44:18,408 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2021-12-14 15:44:18,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 15:44:18,414 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-12-14 15:44:18,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 15:44:18,416 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2021-12-14 15:44:18,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 15:44:18,419 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-12-14 15:44:18,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 15:44:18,421 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 150 [2021-12-14 15:44:18,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 15:44:18,423 INFO L134 CoverageAnalysis]: Checked inductivity of 104 backedges. 0 proven. 33 refuted. 0 times theorem prover too weak. 71 trivial. 0 not checked. [2021-12-14 15:44:18,423 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-14 15:44:18,423 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1347154194] [2021-12-14 15:44:18,423 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1347154194] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-14 15:44:18,423 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1490554164] [2021-12-14 15:44:18,423 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 15:44:18,424 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-14 15:44:18,424 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-14 15:44:18,425 INFO L229 MonitoredProcess]: Starting monitored process 17 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-14 15:44:18,427 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Waiting until timeout for monitored process [2021-12-14 15:44:18,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 15:44:18,506 INFO L263 TraceCheckSpWp]: Trace formula consists of 556 conjuncts, 7 conjunts are in the unsatisfiable core [2021-12-14 15:44:18,508 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-14 15:44:18,689 INFO L134 CoverageAnalysis]: Checked inductivity of 104 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 92 trivial. 0 not checked. [2021-12-14 15:44:18,689 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-14 15:44:18,689 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1490554164] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-14 15:44:18,689 INFO L186 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2021-12-14 15:44:18,689 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [7] total 7 [2021-12-14 15:44:18,689 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1135715087] [2021-12-14 15:44:18,689 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-14 15:44:18,690 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-12-14 15:44:18,690 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-14 15:44:18,690 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-12-14 15:44:18,690 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2021-12-14 15:44:18,690 INFO L87 Difference]: Start difference. First operand 20457 states and 25841 transitions. Second operand has 5 states, 5 states have (on average 17.6) internal successors, (88), 5 states have internal predecessors, (88), 2 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2021-12-14 15:44:19,419 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-14 15:44:19,419 INFO L93 Difference]: Finished difference Result 32886 states and 41058 transitions. [2021-12-14 15:44:19,420 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-12-14 15:44:19,420 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 17.6) internal successors, (88), 5 states have internal predecessors, (88), 2 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) Word has length 165 [2021-12-14 15:44:19,420 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-14 15:44:19,445 INFO L225 Difference]: With dead ends: 32886 [2021-12-14 15:44:19,446 INFO L226 Difference]: Without dead ends: 14561 [2021-12-14 15:44:19,465 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 194 GetRequests, 185 SyntacticMatches, 2 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2021-12-14 15:44:19,466 INFO L933 BasicCegarLoop]: 4137 mSDtfsCounter, 87 mSDsluCounter, 12435 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 87 SdHoareTripleChecker+Valid, 16572 SdHoareTripleChecker+Invalid, 14 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-14 15:44:19,466 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [87 Valid, 16572 Invalid, 14 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-14 15:44:19,475 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14561 states. [2021-12-14 15:44:19,859 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14561 to 13864. [2021-12-14 15:44:19,869 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13864 states, 12145 states have (on average 1.2735282009057225) internal successors, (15467), 12331 states have internal predecessors, (15467), 850 states have call successors, (850), 649 states have call predecessors, (850), 867 states have return successors, (1346), 885 states have call predecessors, (1346), 848 states have call successors, (1346) [2021-12-14 15:44:19,889 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13864 states to 13864 states and 17663 transitions. [2021-12-14 15:44:19,891 INFO L78 Accepts]: Start accepts. Automaton has 13864 states and 17663 transitions. Word has length 165 [2021-12-14 15:44:19,892 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-14 15:44:19,892 INFO L470 AbstractCegarLoop]: Abstraction has 13864 states and 17663 transitions. [2021-12-14 15:44:19,892 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 17.6) internal successors, (88), 5 states have internal predecessors, (88), 2 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2021-12-14 15:44:19,892 INFO L276 IsEmpty]: Start isEmpty. Operand 13864 states and 17663 transitions. [2021-12-14 15:44:19,897 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 166 [2021-12-14 15:44:19,897 INFO L506 BasicCegarLoop]: Found error trace [2021-12-14 15:44:19,897 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-14 15:44:19,913 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Forceful destruction successful, exit code 0 [2021-12-14 15:44:20,097 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable23 [2021-12-14 15:44:20,098 INFO L402 AbstractCegarLoop]: === Iteration 25 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-14 15:44:20,098 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 15:44:20,098 INFO L85 PathProgramCache]: Analyzing trace with hash 1805871025, now seen corresponding path program 1 times [2021-12-14 15:44:20,098 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-14 15:44:20,098 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [410988197] [2021-12-14 15:44:20,098 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 15:44:20,098 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-14 15:44:20,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 15:44:20,111 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2021-12-14 15:44:20,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 15:44:20,118 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2021-12-14 15:44:20,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 15:44:20,124 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2021-12-14 15:44:20,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 15:44:20,150 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2021-12-14 15:44:20,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 15:44:20,152 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2021-12-14 15:44:20,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 15:44:20,154 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2021-12-14 15:44:20,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 15:44:20,155 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2021-12-14 15:44:20,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 15:44:20,159 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-12-14 15:44:20,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 15:44:20,161 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 120 [2021-12-14 15:44:20,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 15:44:20,166 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-12-14 15:44:20,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 15:44:20,175 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 150 [2021-12-14 15:44:20,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 15:44:20,178 INFO L134 CoverageAnalysis]: Checked inductivity of 104 backedges. 0 proven. 22 refuted. 0 times theorem prover too weak. 82 trivial. 0 not checked. [2021-12-14 15:44:20,178 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-14 15:44:20,178 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [410988197] [2021-12-14 15:44:20,178 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [410988197] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-14 15:44:20,178 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [529420953] [2021-12-14 15:44:20,178 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 15:44:20,178 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-14 15:44:20,179 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-14 15:44:20,183 INFO L229 MonitoredProcess]: Starting monitored process 18 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-14 15:44:20,185 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Waiting until timeout for monitored process [2021-12-14 15:44:20,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 15:44:20,262 INFO L263 TraceCheckSpWp]: Trace formula consists of 554 conjuncts, 7 conjunts are in the unsatisfiable core [2021-12-14 15:44:20,264 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-14 15:44:20,433 INFO L134 CoverageAnalysis]: Checked inductivity of 104 backedges. 23 proven. 0 refuted. 0 times theorem prover too weak. 81 trivial. 0 not checked. [2021-12-14 15:44:20,433 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-14 15:44:20,434 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [529420953] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-14 15:44:20,434 INFO L186 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2021-12-14 15:44:20,434 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [7] total 7 [2021-12-14 15:44:20,434 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [460869550] [2021-12-14 15:44:20,434 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-14 15:44:20,434 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-12-14 15:44:20,434 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-14 15:44:20,434 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-12-14 15:44:20,435 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2021-12-14 15:44:20,435 INFO L87 Difference]: Start difference. First operand 13864 states and 17663 transitions. Second operand has 5 states, 5 states have (on average 18.8) internal successors, (94), 5 states have internal predecessors, (94), 2 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2021-12-14 15:44:20,790 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-14 15:44:20,790 INFO L93 Difference]: Finished difference Result 23605 states and 29361 transitions. [2021-12-14 15:44:20,790 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-12-14 15:44:20,790 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 18.8) internal successors, (94), 5 states have internal predecessors, (94), 2 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) Word has length 165 [2021-12-14 15:44:20,791 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-14 15:44:20,817 INFO L225 Difference]: With dead ends: 23605 [2021-12-14 15:44:20,817 INFO L226 Difference]: Without dead ends: 11873 [2021-12-14 15:44:20,835 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 194 GetRequests, 185 SyntacticMatches, 2 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2021-12-14 15:44:20,836 INFO L933 BasicCegarLoop]: 4136 mSDtfsCounter, 49 mSDsluCounter, 12422 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 49 SdHoareTripleChecker+Valid, 16558 SdHoareTripleChecker+Invalid, 14 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-14 15:44:20,836 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [49 Valid, 16558 Invalid, 14 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-14 15:44:20,845 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11873 states. [2021-12-14 15:44:21,171 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11873 to 11651. [2021-12-14 15:44:21,181 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11651 states, 10225 states have (on average 1.2828361858190709) internal successors, (13117), 10367 states have internal predecessors, (13117), 713 states have call successors, (713), 539 states have call predecessors, (713), 711 states have return successors, (1043), 746 states have call predecessors, (1043), 711 states have call successors, (1043) [2021-12-14 15:44:21,198 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11651 states to 11651 states and 14873 transitions. [2021-12-14 15:44:21,200 INFO L78 Accepts]: Start accepts. Automaton has 11651 states and 14873 transitions. Word has length 165 [2021-12-14 15:44:21,200 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-14 15:44:21,200 INFO L470 AbstractCegarLoop]: Abstraction has 11651 states and 14873 transitions. [2021-12-14 15:44:21,201 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 18.8) internal successors, (94), 5 states have internal predecessors, (94), 2 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2021-12-14 15:44:21,201 INFO L276 IsEmpty]: Start isEmpty. Operand 11651 states and 14873 transitions. [2021-12-14 15:44:21,205 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 166 [2021-12-14 15:44:21,205 INFO L506 BasicCegarLoop]: Found error trace [2021-12-14 15:44:21,205 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-14 15:44:21,229 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Ended with exit code 0 [2021-12-14 15:44:21,405 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24,18 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-14 15:44:21,406 INFO L402 AbstractCegarLoop]: === Iteration 26 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-14 15:44:21,406 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 15:44:21,406 INFO L85 PathProgramCache]: Analyzing trace with hash 1637482603, now seen corresponding path program 1 times [2021-12-14 15:44:21,406 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-14 15:44:21,406 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [709524368] [2021-12-14 15:44:21,406 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 15:44:21,406 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-14 15:44:21,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 15:44:21,419 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2021-12-14 15:44:21,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 15:44:21,428 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2021-12-14 15:44:21,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 15:44:21,435 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2021-12-14 15:44:21,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 15:44:21,468 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2021-12-14 15:44:21,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 15:44:21,471 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2021-12-14 15:44:21,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 15:44:21,472 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2021-12-14 15:44:21,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 15:44:21,480 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2021-12-14 15:44:21,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 15:44:21,485 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-12-14 15:44:21,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 15:44:21,488 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 120 [2021-12-14 15:44:21,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 15:44:21,492 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-12-14 15:44:21,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 15:44:21,495 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 150 [2021-12-14 15:44:21,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 15:44:21,497 INFO L134 CoverageAnalysis]: Checked inductivity of 104 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 94 trivial. 0 not checked. [2021-12-14 15:44:21,497 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-14 15:44:21,497 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [709524368] [2021-12-14 15:44:21,497 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [709524368] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-14 15:44:21,497 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1178077854] [2021-12-14 15:44:21,497 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 15:44:21,498 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-14 15:44:21,498 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-14 15:44:21,512 INFO L229 MonitoredProcess]: Starting monitored process 19 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-14 15:44:21,514 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Waiting until timeout for monitored process [2021-12-14 15:44:21,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 15:44:21,605 INFO L263 TraceCheckSpWp]: Trace formula consists of 551 conjuncts, 7 conjunts are in the unsatisfiable core [2021-12-14 15:44:21,607 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-14 15:44:21,819 INFO L134 CoverageAnalysis]: Checked inductivity of 104 backedges. 35 proven. 0 refuted. 0 times theorem prover too weak. 69 trivial. 0 not checked. [2021-12-14 15:44:21,819 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-14 15:44:21,819 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1178077854] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-14 15:44:21,819 INFO L186 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2021-12-14 15:44:21,819 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [7] total 7 [2021-12-14 15:44:21,820 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [736958261] [2021-12-14 15:44:21,820 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-14 15:44:21,820 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-12-14 15:44:21,820 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-14 15:44:21,820 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-12-14 15:44:21,820 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2021-12-14 15:44:21,820 INFO L87 Difference]: Start difference. First operand 11651 states and 14873 transitions. Second operand has 5 states, 5 states have (on average 19.8) internal successors, (99), 5 states have internal predecessors, (99), 2 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2021-12-14 15:44:22,040 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-14 15:44:22,040 INFO L93 Difference]: Finished difference Result 16233 states and 20187 transitions. [2021-12-14 15:44:22,040 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-12-14 15:44:22,041 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 19.8) internal successors, (99), 5 states have internal predecessors, (99), 2 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) Word has length 165 [2021-12-14 15:44:22,041 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-14 15:44:22,051 INFO L225 Difference]: With dead ends: 16233 [2021-12-14 15:44:22,051 INFO L226 Difference]: Without dead ends: 4951 [2021-12-14 15:44:22,065 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 194 GetRequests, 185 SyntacticMatches, 2 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2021-12-14 15:44:22,067 INFO L933 BasicCegarLoop]: 4136 mSDtfsCounter, 10 mSDsluCounter, 12407 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 16543 SdHoareTripleChecker+Invalid, 14 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-14 15:44:22,074 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [10 Valid, 16543 Invalid, 14 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-14 15:44:22,079 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4951 states. [2021-12-14 15:44:22,182 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4951 to 4951. [2021-12-14 15:44:22,186 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4951 states, 4523 states have (on average 1.4623037806765422) internal successors, (6614), 4545 states have internal predecessors, (6614), 240 states have call successors, (240), 171 states have call predecessors, (240), 186 states have return successors, (263), 236 states have call predecessors, (263), 238 states have call successors, (263) [2021-12-14 15:44:22,191 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4951 states to 4951 states and 7117 transitions. [2021-12-14 15:44:22,192 INFO L78 Accepts]: Start accepts. Automaton has 4951 states and 7117 transitions. Word has length 165 [2021-12-14 15:44:22,192 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-14 15:44:22,192 INFO L470 AbstractCegarLoop]: Abstraction has 4951 states and 7117 transitions. [2021-12-14 15:44:22,192 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 19.8) internal successors, (99), 5 states have internal predecessors, (99), 2 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2021-12-14 15:44:22,192 INFO L276 IsEmpty]: Start isEmpty. Operand 4951 states and 7117 transitions. [2021-12-14 15:44:22,194 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 204 [2021-12-14 15:44:22,194 INFO L506 BasicCegarLoop]: Found error trace [2021-12-14 15:44:22,195 INFO L514 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-14 15:44:22,213 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Forceful destruction successful, exit code 0 [2021-12-14 15:44:22,399 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25,19 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-14 15:44:22,399 INFO L402 AbstractCegarLoop]: === Iteration 27 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-14 15:44:22,400 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 15:44:22,400 INFO L85 PathProgramCache]: Analyzing trace with hash -1365063130, now seen corresponding path program 1 times [2021-12-14 15:44:22,400 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-14 15:44:22,400 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [517130197] [2021-12-14 15:44:22,400 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 15:44:22,400 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-14 15:44:22,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 15:44:22,463 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2021-12-14 15:44:22,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 15:44:22,472 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2021-12-14 15:44:22,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 15:44:22,480 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2021-12-14 15:44:22,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 15:44:22,482 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2021-12-14 15:44:22,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 15:44:22,483 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2021-12-14 15:44:22,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 15:44:22,484 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2021-12-14 15:44:22,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 15:44:22,485 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2021-12-14 15:44:22,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 15:44:22,489 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-12-14 15:44:22,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 15:44:22,491 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2021-12-14 15:44:22,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 15:44:22,494 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-12-14 15:44:22,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 15:44:22,496 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 157 [2021-12-14 15:44:22,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 15:44:22,498 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-12-14 15:44:22,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 15:44:22,500 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 188 [2021-12-14 15:44:22,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 15:44:22,503 INFO L134 CoverageAnalysis]: Checked inductivity of 173 backedges. 25 proven. 0 refuted. 0 times theorem prover too weak. 148 trivial. 0 not checked. [2021-12-14 15:44:22,503 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-14 15:44:22,503 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [517130197] [2021-12-14 15:44:22,503 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [517130197] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-14 15:44:22,503 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-14 15:44:22,503 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-12-14 15:44:22,503 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1511215639] [2021-12-14 15:44:22,503 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-14 15:44:22,504 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2021-12-14 15:44:22,504 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-14 15:44:22,504 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-12-14 15:44:22,504 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2021-12-14 15:44:22,504 INFO L87 Difference]: Start difference. First operand 4951 states and 7117 transitions. Second operand has 7 states, 7 states have (on average 16.0) internal successors, (112), 5 states have internal predecessors, (112), 6 states have call successors, (11), 4 states have call predecessors, (11), 1 states have return successors, (10), 4 states have call predecessors, (10), 5 states have call successors, (10) [2021-12-14 15:44:23,172 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-14 15:44:23,172 INFO L93 Difference]: Finished difference Result 5129 states and 7302 transitions. [2021-12-14 15:44:23,172 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2021-12-14 15:44:23,172 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 16.0) internal successors, (112), 5 states have internal predecessors, (112), 6 states have call successors, (11), 4 states have call predecessors, (11), 1 states have return successors, (10), 4 states have call predecessors, (10), 5 states have call successors, (10) Word has length 203 [2021-12-14 15:44:23,173 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-14 15:44:23,179 INFO L225 Difference]: With dead ends: 5129 [2021-12-14 15:44:23,179 INFO L226 Difference]: Without dead ends: 5126 [2021-12-14 15:44:23,180 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 36 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=56, Invalid=184, Unknown=0, NotChecked=0, Total=240 [2021-12-14 15:44:23,181 INFO L933 BasicCegarLoop]: 4284 mSDtfsCounter, 4634 mSDsluCounter, 16407 mSDsCounter, 0 mSdLazyCounter, 775 mSolverCounterSat, 95 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4667 SdHoareTripleChecker+Valid, 20691 SdHoareTripleChecker+Invalid, 870 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 95 IncrementalHoareTripleChecker+Valid, 775 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2021-12-14 15:44:23,181 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [4667 Valid, 20691 Invalid, 870 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [95 Valid, 775 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2021-12-14 15:44:23,183 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5126 states. [2021-12-14 15:44:23,289 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5126 to 4950. [2021-12-14 15:44:23,293 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4950 states, 4523 states have (on average 1.4616405040902056) internal successors, (6611), 4544 states have internal predecessors, (6611), 239 states have call successors, (239), 171 states have call predecessors, (239), 186 states have return successors, (263), 236 states have call predecessors, (263), 238 states have call successors, (263) [2021-12-14 15:44:23,299 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4950 states to 4950 states and 7113 transitions. [2021-12-14 15:44:23,300 INFO L78 Accepts]: Start accepts. Automaton has 4950 states and 7113 transitions. Word has length 203 [2021-12-14 15:44:23,300 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-14 15:44:23,300 INFO L470 AbstractCegarLoop]: Abstraction has 4950 states and 7113 transitions. [2021-12-14 15:44:23,300 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 16.0) internal successors, (112), 5 states have internal predecessors, (112), 6 states have call successors, (11), 4 states have call predecessors, (11), 1 states have return successors, (10), 4 states have call predecessors, (10), 5 states have call successors, (10) [2021-12-14 15:44:23,300 INFO L276 IsEmpty]: Start isEmpty. Operand 4950 states and 7113 transitions. [2021-12-14 15:44:23,303 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 208 [2021-12-14 15:44:23,303 INFO L506 BasicCegarLoop]: Found error trace [2021-12-14 15:44:23,303 INFO L514 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-14 15:44:23,303 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2021-12-14 15:44:23,303 INFO L402 AbstractCegarLoop]: === Iteration 28 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-14 15:44:23,303 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 15:44:23,304 INFO L85 PathProgramCache]: Analyzing trace with hash -575528242, now seen corresponding path program 1 times [2021-12-14 15:44:23,304 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-14 15:44:23,304 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1084070157] [2021-12-14 15:44:23,304 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 15:44:23,304 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-14 15:44:23,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 15:44:23,325 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2021-12-14 15:44:23,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 15:44:23,333 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2021-12-14 15:44:23,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 15:44:23,339 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2021-12-14 15:44:23,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 15:44:23,342 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2021-12-14 15:44:23,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 15:44:23,343 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2021-12-14 15:44:23,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 15:44:23,345 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2021-12-14 15:44:23,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 15:44:23,346 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2021-12-14 15:44:23,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 15:44:23,348 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-12-14 15:44:23,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 15:44:23,351 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2021-12-14 15:44:23,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 15:44:23,353 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-12-14 15:44:23,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 15:44:23,355 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 157 [2021-12-14 15:44:23,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 15:44:23,358 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-12-14 15:44:23,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 15:44:23,360 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 188 [2021-12-14 15:44:23,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 15:44:23,361 INFO L134 CoverageAnalysis]: Checked inductivity of 173 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 173 trivial. 0 not checked. [2021-12-14 15:44:23,361 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-14 15:44:23,361 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1084070157] [2021-12-14 15:44:23,362 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1084070157] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-14 15:44:23,362 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-14 15:44:23,362 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-12-14 15:44:23,362 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1981093440] [2021-12-14 15:44:23,362 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-14 15:44:23,362 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-12-14 15:44:23,362 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-14 15:44:23,362 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-12-14 15:44:23,362 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-12-14 15:44:23,363 INFO L87 Difference]: Start difference. First operand 4950 states and 7113 transitions. Second operand has 5 states, 5 states have (on average 20.2) internal successors, (101), 3 states have internal predecessors, (101), 3 states have call successors, (10), 4 states have call predecessors, (10), 1 states have return successors, (9), 1 states have call predecessors, (9), 2 states have call successors, (9) [2021-12-14 15:44:23,711 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-14 15:44:23,711 INFO L93 Difference]: Finished difference Result 6530 states and 8949 transitions. [2021-12-14 15:44:23,711 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-12-14 15:44:23,712 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 20.2) internal successors, (101), 3 states have internal predecessors, (101), 3 states have call successors, (10), 4 states have call predecessors, (10), 1 states have return successors, (9), 1 states have call predecessors, (9), 2 states have call successors, (9) Word has length 207 [2021-12-14 15:44:23,712 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-14 15:44:23,722 INFO L225 Difference]: With dead ends: 6530 [2021-12-14 15:44:23,722 INFO L226 Difference]: Without dead ends: 5474 [2021-12-14 15:44:23,725 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2021-12-14 15:44:23,725 INFO L933 BasicCegarLoop]: 4190 mSDtfsCounter, 195 mSDsluCounter, 12226 mSDsCounter, 0 mSdLazyCounter, 248 mSolverCounterSat, 33 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 208 SdHoareTripleChecker+Valid, 16416 SdHoareTripleChecker+Invalid, 281 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 33 IncrementalHoareTripleChecker+Valid, 248 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2021-12-14 15:44:23,726 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [208 Valid, 16416 Invalid, 281 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [33 Valid, 248 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2021-12-14 15:44:23,729 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5474 states. [2021-12-14 15:44:23,846 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5474 to 4953. [2021-12-14 15:44:23,851 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4953 states, 4526 states have (on average 1.4613345117101193) internal successors, (6614), 4547 states have internal predecessors, (6614), 239 states have call successors, (239), 171 states have call predecessors, (239), 186 states have return successors, (263), 236 states have call predecessors, (263), 238 states have call successors, (263) [2021-12-14 15:44:23,857 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4953 states to 4953 states and 7116 transitions. [2021-12-14 15:44:23,858 INFO L78 Accepts]: Start accepts. Automaton has 4953 states and 7116 transitions. Word has length 207 [2021-12-14 15:44:23,858 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-14 15:44:23,858 INFO L470 AbstractCegarLoop]: Abstraction has 4953 states and 7116 transitions. [2021-12-14 15:44:23,858 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 20.2) internal successors, (101), 3 states have internal predecessors, (101), 3 states have call successors, (10), 4 states have call predecessors, (10), 1 states have return successors, (9), 1 states have call predecessors, (9), 2 states have call successors, (9) [2021-12-14 15:44:23,858 INFO L276 IsEmpty]: Start isEmpty. Operand 4953 states and 7116 transitions. [2021-12-14 15:44:23,861 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 209 [2021-12-14 15:44:23,861 INFO L506 BasicCegarLoop]: Found error trace [2021-12-14 15:44:23,861 INFO L514 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-14 15:44:23,861 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2021-12-14 15:44:23,862 INFO L402 AbstractCegarLoop]: === Iteration 29 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-14 15:44:23,862 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 15:44:23,862 INFO L85 PathProgramCache]: Analyzing trace with hash 567683991, now seen corresponding path program 1 times [2021-12-14 15:44:23,862 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-14 15:44:23,862 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1124564621] [2021-12-14 15:44:23,862 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 15:44:23,862 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-14 15:44:23,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-14 15:44:23,877 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-12-14 15:44:23,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-14 15:44:23,956 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-12-14 15:44:23,956 INFO L628 BasicCegarLoop]: Counterexample is feasible [2021-12-14 15:44:23,956 INFO L764 garLoopResultBuilder]: Registering result UNSAFE for location errorErr0ASSERT_VIOLATIONERROR_FUNCTION (1 of 2 remaining) [2021-12-14 15:44:23,959 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 2 remaining) [2021-12-14 15:44:23,959 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2021-12-14 15:44:23,961 INFO L732 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-14 15:44:23,964 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2021-12-14 15:44:24,098 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 14.12 03:44:24 BoogieIcfgContainer [2021-12-14 15:44:24,098 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2021-12-14 15:44:24,099 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2021-12-14 15:44:24,099 INFO L271 PluginConnector]: Initializing Witness Printer... [2021-12-14 15:44:24,099 INFO L275 PluginConnector]: Witness Printer initialized [2021-12-14 15:44:24,099 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.12 03:43:38" (3/4) ... [2021-12-14 15:44:24,100 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2021-12-14 15:44:24,226 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2021-12-14 15:44:24,227 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2021-12-14 15:44:24,227 INFO L158 Benchmark]: Toolchain (without parser) took 53324.73ms. Allocated memory was 117.4MB in the beginning and 5.9GB in the end (delta: 5.8GB). Free memory was 82.7MB in the beginning and 2.5GB in the end (delta: -2.4GB). Peak memory consumption was 3.3GB. Max. memory is 16.1GB. [2021-12-14 15:44:24,228 INFO L158 Benchmark]: CDTParser took 0.17ms. Allocated memory is still 96.5MB. Free memory was 53.1MB in the beginning and 53.1MB in the end (delta: 39.2kB). There was no memory consumed. Max. memory is 16.1GB. [2021-12-14 15:44:24,228 INFO L158 Benchmark]: CACSL2BoogieTranslator took 2096.83ms. Allocated memory was 117.4MB in the beginning and 249.6MB in the end (delta: 132.1MB). Free memory was 82.3MB in the beginning and 141.3MB in the end (delta: -59.1MB). Peak memory consumption was 91.4MB. Max. memory is 16.1GB. [2021-12-14 15:44:24,228 INFO L158 Benchmark]: Boogie Procedure Inliner took 332.40ms. Allocated memory is still 249.6MB. Free memory was 141.3MB in the beginning and 106.5MB in the end (delta: 34.8MB). Peak memory consumption was 57.9MB. Max. memory is 16.1GB. [2021-12-14 15:44:24,229 INFO L158 Benchmark]: Boogie Preprocessor took 445.13ms. Allocated memory is still 249.6MB. Free memory was 106.5MB in the beginning and 94.1MB in the end (delta: 12.4MB). Peak memory consumption was 73.7MB. Max. memory is 16.1GB. [2021-12-14 15:44:24,229 INFO L158 Benchmark]: RCFGBuilder took 5066.62ms. Allocated memory was 249.6MB in the beginning and 1.0GB in the end (delta: 757.1MB). Free memory was 94.1MB in the beginning and 823.2MB in the end (delta: -729.1MB). Peak memory consumption was 332.6MB. Max. memory is 16.1GB. [2021-12-14 15:44:24,230 INFO L158 Benchmark]: TraceAbstraction took 45250.36ms. Allocated memory was 1.0GB in the beginning and 5.9GB in the end (delta: 4.9GB). Free memory was 823.2MB in the beginning and 2.6GB in the end (delta: -1.7GB). Peak memory consumption was 3.2GB. Max. memory is 16.1GB. [2021-12-14 15:44:24,231 INFO L158 Benchmark]: Witness Printer took 128.04ms. Allocated memory is still 5.9GB. Free memory was 2.6GB in the beginning and 2.5GB in the end (delta: 31.5MB). Peak memory consumption was 31.5MB. Max. memory is 16.1GB. [2021-12-14 15:44:24,236 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.17ms. Allocated memory is still 96.5MB. Free memory was 53.1MB in the beginning and 53.1MB in the end (delta: 39.2kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 2096.83ms. Allocated memory was 117.4MB in the beginning and 249.6MB in the end (delta: 132.1MB). Free memory was 82.3MB in the beginning and 141.3MB in the end (delta: -59.1MB). Peak memory consumption was 91.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 332.40ms. Allocated memory is still 249.6MB. Free memory was 141.3MB in the beginning and 106.5MB in the end (delta: 34.8MB). Peak memory consumption was 57.9MB. Max. memory is 16.1GB. * Boogie Preprocessor took 445.13ms. Allocated memory is still 249.6MB. Free memory was 106.5MB in the beginning and 94.1MB in the end (delta: 12.4MB). Peak memory consumption was 73.7MB. Max. memory is 16.1GB. * RCFGBuilder took 5066.62ms. Allocated memory was 249.6MB in the beginning and 1.0GB in the end (delta: 757.1MB). Free memory was 94.1MB in the beginning and 823.2MB in the end (delta: -729.1MB). Peak memory consumption was 332.6MB. Max. memory is 16.1GB. * TraceAbstraction took 45250.36ms. Allocated memory was 1.0GB in the beginning and 5.9GB in the end (delta: 4.9GB). Free memory was 823.2MB in the beginning and 2.6GB in the end (delta: -1.7GB). Peak memory consumption was 3.2GB. Max. memory is 16.1GB. * Witness Printer took 128.04ms. Allocated memory is still 5.9GB. Free memory was 2.6GB in the beginning and 2.5GB in the end (delta: 31.5MB). Peak memory consumption was 31.5MB. 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 t2_pc = 0; [L11180] int m_st ; [L11181] int t1_st ; [L11182] int t2_st ; [L11183] int m_i ; [L11184] int t1_i ; [L11185] int t2_i ; [L11186] int M_E = 2; [L11187] int T1_E = 2; [L11188] int T2_E = 2; [L11189] int E_M = 2; [L11190] int E_1 = 2; [L11191] int E_2 = 2; [L11196] int token ; [L11198] 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_2=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, T2_E=2, t2_i=0, t2_pc=0, t2_st=0, token=0] [L11776] COND FALSE !(__VERIFIER_nondet_int()) [L11779] CALL main2() [L11763] int __retres1 ; [L11767] CALL init_model() [L11677] m_i = 1 [L11678] t1_i = 1 [L11679] t2_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_2=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, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, token=0] [L11767] RET init_model() [L11768] CALL start_simulation() [L11704] int kernel_st ; [L11705] int tmp ; [L11706] int tmp___0 ; [L11710] 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_2=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, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, token=0] [L11711] 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_2=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, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, token=0] [L11712] CALL init_threads() [L11396] COND TRUE m_i == 1 [L11397] 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_2=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, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, token=0] [L11401] COND TRUE t1_i == 1 [L11402] 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_2=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, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, token=0] [L11406] COND TRUE t2_i == 1 [L11407] t2_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_2=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, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, token=0] [L11712] RET init_threads() [L11713] CALL fire_delta_events() VAL [\old(E_1)=2, \old(E_2)=2, \old(E_M)=2, \old(M_E)=2, \old(T1_E)=2, \old(T2_E)=2, a=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_2=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, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, token=0] [L11509] COND FALSE !(M_E == 0) VAL [\old(E_1)=2, \old(E_2)=2, \old(E_M)=2, \old(M_E)=2, \old(T1_E)=2, \old(T2_E)=2, a=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_2=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, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, token=0] [L11514] COND FALSE !(T1_E == 0) VAL [\old(E_1)=2, \old(E_2)=2, \old(E_M)=2, \old(M_E)=2, \old(T1_E)=2, \old(T2_E)=2, a=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_2=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, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, token=0] [L11519] COND FALSE !(T2_E == 0) VAL [\old(E_1)=2, \old(E_2)=2, \old(E_M)=2, \old(M_E)=2, \old(T1_E)=2, \old(T2_E)=2, a=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_2=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, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, token=0] [L11524] COND FALSE !(E_M == 0) VAL [\old(E_1)=2, \old(E_2)=2, \old(E_M)=2, \old(M_E)=2, \old(T1_E)=2, \old(T2_E)=2, a=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_2=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, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, token=0] [L11529] COND FALSE !(E_1 == 0) VAL [\old(E_1)=2, \old(E_2)=2, \old(E_M)=2, \old(M_E)=2, \old(T1_E)=2, \old(T2_E)=2, a=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_2=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, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, token=0] [L11534] COND FALSE !(E_2 == 0) VAL [\old(E_1)=2, \old(E_2)=2, \old(E_M)=2, \old(M_E)=2, \old(T1_E)=2, \old(T2_E)=2, a=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_2=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, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, token=0] [L11713] 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_2=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, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, token=0] [L11714] CALL activate_threads() VAL [\old(m_st)=0, \old(t1_st)=0, \old(t2_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_2=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, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, token=0] [L11582] int tmp ; [L11583] int tmp___0 ; [L11584] int tmp___1 ; [L11588] CALL, EXPR is_master_triggered() [L11328] int __retres1 ; VAL [\old(m_st)=0, \old(t1_st)=0, \old(t2_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_2=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, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, token=0] [L11331] COND FALSE !(m_pc == 1) VAL [\old(m_st)=0, \old(t1_st)=0, \old(t2_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_2=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, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, token=0] [L11341] __retres1 = 0 VAL [\old(m_st)=0, \old(t1_st)=0, \old(t2_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_2=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, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, token=0] [L11343] return (__retres1); VAL [\old(m_st)=0, \old(t1_st)=0, \old(t2_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_2=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, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, token=0] [L11588] RET, EXPR is_master_triggered() [L11588] tmp = is_master_triggered() [L11590] COND FALSE !(\read(tmp)) VAL [\old(m_st)=0, \old(t1_st)=0, \old(t2_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_2=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, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, tmp=0, token=0] [L11596] CALL, EXPR is_transmit1_triggered() [L11347] int __retres1 ; VAL [\old(m_st)=0, \old(t1_st)=0, \old(t2_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_2=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, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, token=0] [L11350] COND FALSE !(t1_pc == 1) VAL [\old(m_st)=0, \old(t1_st)=0, \old(t2_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_2=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, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, token=0] [L11360] __retres1 = 0 VAL [\old(m_st)=0, \old(t1_st)=0, \old(t2_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_2=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, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, token=0] [L11362] return (__retres1); VAL [\old(m_st)=0, \old(t1_st)=0, \old(t2_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_2=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, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, token=0] [L11596] RET, EXPR is_transmit1_triggered() [L11596] tmp___0 = is_transmit1_triggered() [L11598] COND FALSE !(\read(tmp___0)) VAL [\old(m_st)=0, \old(t1_st)=0, \old(t2_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_2=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, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, tmp=0, tmp___0=0, token=0] [L11604] CALL, EXPR is_transmit2_triggered() [L11366] int __retres1 ; VAL [\old(m_st)=0, \old(t1_st)=0, \old(t2_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_2=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, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, token=0] [L11369] COND FALSE !(t2_pc == 1) VAL [\old(m_st)=0, \old(t1_st)=0, \old(t2_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_2=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, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, token=0] [L11379] __retres1 = 0 VAL [\old(m_st)=0, \old(t1_st)=0, \old(t2_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_2=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, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, token=0] [L11381] return (__retres1); VAL [\old(m_st)=0, \old(t1_st)=0, \old(t2_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_2=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, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, token=0] [L11604] RET, EXPR is_transmit2_triggered() [L11604] tmp___1 = is_transmit2_triggered() [L11606] COND FALSE !(\read(tmp___1)) VAL [\old(m_st)=0, \old(t1_st)=0, \old(t2_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_2=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, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, tmp=0, tmp___0=0, tmp___1=0, token=0] [L11714] 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_2=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, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, token=0] [L11715] CALL reset_delta_events() VAL [\old(E_1)=2, \old(E_2)=2, \old(E_M)=2, \old(M_E)=2, \old(T1_E)=2, \old(T2_E)=2, a=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_2=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, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, token=0] [L11547] COND FALSE !(M_E == 1) VAL [\old(E_1)=2, \old(E_2)=2, \old(E_M)=2, \old(M_E)=2, \old(T1_E)=2, \old(T2_E)=2, a=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_2=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, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, token=0] [L11552] COND FALSE !(T1_E == 1) VAL [\old(E_1)=2, \old(E_2)=2, \old(E_M)=2, \old(M_E)=2, \old(T1_E)=2, \old(T2_E)=2, a=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_2=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, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, token=0] [L11557] COND FALSE !(T2_E == 1) VAL [\old(E_1)=2, \old(E_2)=2, \old(E_M)=2, \old(M_E)=2, \old(T1_E)=2, \old(T2_E)=2, a=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_2=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, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, token=0] [L11562] COND FALSE !(E_M == 1) VAL [\old(E_1)=2, \old(E_2)=2, \old(E_M)=2, \old(M_E)=2, \old(T1_E)=2, \old(T2_E)=2, a=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_2=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, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, token=0] [L11567] COND FALSE !(E_1 == 1) VAL [\old(E_1)=2, \old(E_2)=2, \old(E_M)=2, \old(M_E)=2, \old(T1_E)=2, \old(T2_E)=2, a=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_2=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, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, token=0] [L11572] COND FALSE !(E_2 == 1) VAL [\old(E_1)=2, \old(E_2)=2, \old(E_M)=2, \old(M_E)=2, \old(T1_E)=2, \old(T2_E)=2, a=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_2=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, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, token=0] [L11715] 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_2=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, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, token=0] [L11718] 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_2=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, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, token=0] [L11721] kernel_st = 1 [L11722] CALL eval() [L11442] 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_2=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, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, token=0] [L11446] 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_2=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, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, token=0] [L11449] 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_2=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, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, token=0] [L11416] 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_2=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, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, token=0] [L11419] COND TRUE m_st == 0 [L11420] __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_2=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, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, token=0] [L11437] 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_2=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, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, token=0] [L11449] 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_2=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, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, token=0] [L11449] tmp = exists_runnable_thread() [L11451] 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_2=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, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, tmp=1, token=0] [L11456] COND TRUE m_st == 0 [L11457] int tmp_ndt_1; [L11458] tmp_ndt_1 = __VERIFIER_nondet_int() [L11459] 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_2=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, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, tmp=1, tmp_ndt_1=0, token=0] [L11470] COND TRUE t1_st == 0 [L11471] int tmp_ndt_2; [L11472] tmp_ndt_2 = __VERIFIER_nondet_int() [L11473] COND TRUE \read(tmp_ndt_2) [L11475] t1_st = 1 [L11476] CALL transmit1() [L11259] 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_2=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, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, token=0] [L11270] 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_2=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, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, token=0] [L11272] t1_pc = 1 [L11273] 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_2=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, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, token=0] [L11476] RET transmit1() [L11484] COND TRUE t2_st == 0 [L11485] int tmp_ndt_3; [L11486] tmp_ndt_3 = __VERIFIER_nondet_int() [L11487] COND TRUE \read(tmp_ndt_3) [L11489] t2_st = 1 [L11490] CALL transmit2() [L11295] COND TRUE t2_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_2=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, T2_E=2, t2_i=1, t2_pc=0, t2_st=1, token=0] [L11306] 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_2=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, T2_E=2, t2_i=1, t2_pc=0, t2_st=1, token=0] [L11308] t2_pc = 1 [L11309] t2_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_2=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, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, token=0] [L11490] RET transmit2() [L11446] 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_2=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, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, tmp=1, tmp_ndt_1=0, tmp_ndt_2=-1, tmp_ndt_3=1, token=0] [L11449] 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_2=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, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, token=0] [L11416] 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_2=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, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, token=0] [L11419] COND TRUE m_st == 0 [L11420] __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_2=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, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, token=0] [L11437] 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_2=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, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, token=0] [L11449] 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_2=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, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, tmp=1, tmp_ndt_1=0, tmp_ndt_2=-1, tmp_ndt_3=1, token=0] [L11449] tmp = exists_runnable_thread() [L11451] 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_2=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, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, tmp=1, tmp_ndt_1=0, tmp_ndt_2=-1, tmp_ndt_3=1, token=0] [L11456] COND TRUE m_st == 0 [L11457] int tmp_ndt_1; [L11458] tmp_ndt_1 = __VERIFIER_nondet_int() [L11459] COND TRUE \read(tmp_ndt_1) [L11461] m_st = 1 [L11462] CALL master() [L11201] int tmp_var = __VERIFIER_nondet_int(); [L11203] 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_2=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, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, tmp_var=0, token=0] [L11214] 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_2=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, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, tmp_var=0, token=0] [L11217] token = __VERIFIER_nondet_int() [L11218] local = token [L11219] 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_2=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, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, tmp_var=0, token=0] [L11220] CALL immediate_notify() VAL [\old(m_st)=1, \old(t1_st)=2, \old(t2_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_2=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, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, token=0] [L11620] CALL activate_threads() VAL [\old(m_st)=1, \old(t1_st)=2, \old(t2_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_2=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, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, token=0] [L11582] int tmp ; [L11583] int tmp___0 ; [L11584] int tmp___1 ; [L11588] CALL, EXPR is_master_triggered() [L11328] int __retres1 ; VAL [\old(m_st)=1, \old(t1_st)=2, \old(t2_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_2=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, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, token=0] [L11331] COND FALSE !(m_pc == 1) VAL [\old(m_st)=1, \old(t1_st)=2, \old(t2_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_2=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, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, token=0] [L11341] __retres1 = 0 VAL [\old(m_st)=1, \old(t1_st)=2, \old(t2_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_2=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, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, token=0] [L11343] return (__retres1); VAL [\old(m_st)=1, \old(t1_st)=2, \old(t2_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_2=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, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, token=0] [L11588] RET, EXPR is_master_triggered() [L11588] tmp = is_master_triggered() [L11590] COND FALSE !(\read(tmp)) VAL [\old(m_st)=1, \old(t1_st)=2, \old(t2_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_2=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, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, tmp=0, token=0] [L11596] CALL, EXPR is_transmit1_triggered() [L11347] int __retres1 ; VAL [\old(m_st)=1, \old(t1_st)=2, \old(t2_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_2=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, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, token=0] [L11350] COND TRUE t1_pc == 1 VAL [\old(m_st)=1, \old(t1_st)=2, \old(t2_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_2=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, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, token=0] [L11351] COND TRUE E_1 == 1 [L11352] __retres1 = 1 VAL [\old(m_st)=1, \old(t1_st)=2, \old(t2_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_2=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, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, token=0] [L11362] return (__retres1); VAL [\old(m_st)=1, \old(t1_st)=2, \old(t2_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_2=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, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, token=0] [L11596] RET, EXPR is_transmit1_triggered() [L11596] tmp___0 = is_transmit1_triggered() [L11598] COND TRUE \read(tmp___0) [L11599] t1_st = 0 VAL [\old(m_st)=1, \old(t1_st)=2, \old(t2_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_2=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=0, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, tmp=0, tmp___0=1, token=0] [L11604] CALL, EXPR is_transmit2_triggered() [L11366] int __retres1 ; VAL [\old(m_st)=1, \old(t1_st)=2, \old(t2_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_2=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=0, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, token=0] [L11369] COND TRUE t2_pc == 1 VAL [\old(m_st)=1, \old(t1_st)=2, \old(t2_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_2=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=0, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, token=0] [L11370] COND FALSE !(E_2 == 1) VAL [\old(m_st)=1, \old(t1_st)=2, \old(t2_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_2=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=0, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, token=0] [L11379] __retres1 = 0 VAL [\old(m_st)=1, \old(t1_st)=2, \old(t2_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_2=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=0, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, token=0] [L11381] return (__retres1); VAL [\old(m_st)=1, \old(t1_st)=2, \old(t2_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_2=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=0, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, token=0] [L11604] RET, EXPR is_transmit2_triggered() [L11604] tmp___1 = is_transmit2_triggered() [L11606] COND FALSE !(\read(tmp___1)) VAL [\old(m_st)=1, \old(t1_st)=2, \old(t2_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_2=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=0, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, tmp=0, tmp___0=1, tmp___1=0, token=0] [L11620] RET activate_threads() VAL [\old(m_st)=1, \old(t1_st)=2, \old(t2_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_2=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=0, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, token=0] [L11220] 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_2=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=0, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, tmp_var=0, token=0] [L11221] E_1 = 2 [L11222] m_pc = 1 [L11223] 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_2=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, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, tmp_var=0, token=0] [L11462] RET master() [L11470] COND TRUE t1_st == 0 [L11471] int tmp_ndt_2; [L11472] tmp_ndt_2 = __VERIFIER_nondet_int() [L11473] COND TRUE \read(tmp_ndt_2) [L11475] t1_st = 1 [L11476] CALL transmit1() [L11259] 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_2=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, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, token=0] [L11262] 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_2=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, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, token=0] [L11278] token += 1 [L11279] E_2 = 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_2=1, 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, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, token=1] [L11280] CALL immediate_notify() VAL [\old(m_st)=2, \old(t1_st)=1, \old(t2_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=2, E_2=1, 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, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, token=1] [L11620] CALL activate_threads() VAL [\old(m_st)=2, \old(t1_st)=1, \old(t2_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=2, E_2=1, 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, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, token=1] [L11582] int tmp ; [L11583] int tmp___0 ; [L11584] int tmp___1 ; [L11588] CALL, EXPR is_master_triggered() [L11328] int __retres1 ; VAL [\old(m_st)=2, \old(t1_st)=1, \old(t2_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=2, E_2=1, 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, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, token=1] [L11331] COND TRUE m_pc == 1 VAL [\old(m_st)=2, \old(t1_st)=1, \old(t2_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=2, E_2=1, 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, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, token=1] [L11332] COND FALSE !(E_M == 1) VAL [\old(m_st)=2, \old(t1_st)=1, \old(t2_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=2, E_2=1, 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, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, token=1] [L11341] __retres1 = 0 VAL [\old(m_st)=2, \old(t1_st)=1, \old(t2_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=2, E_2=1, 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, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, token=1] [L11343] return (__retres1); VAL [\old(m_st)=2, \old(t1_st)=1, \old(t2_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=2, E_2=1, 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, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, token=1] [L11588] RET, EXPR is_master_triggered() [L11588] tmp = is_master_triggered() [L11590] COND FALSE !(\read(tmp)) VAL [\old(m_st)=2, \old(t1_st)=1, \old(t2_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=2, E_2=1, 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, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, tmp=0, token=1] [L11596] CALL, EXPR is_transmit1_triggered() [L11347] int __retres1 ; VAL [\old(m_st)=2, \old(t1_st)=1, \old(t2_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=2, E_2=1, 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, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, token=1] [L11350] COND TRUE t1_pc == 1 VAL [\old(m_st)=2, \old(t1_st)=1, \old(t2_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=2, E_2=1, 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, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, token=1] [L11351] COND FALSE !(E_1 == 1) VAL [\old(m_st)=2, \old(t1_st)=1, \old(t2_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=2, E_2=1, 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, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, token=1] [L11360] __retres1 = 0 VAL [\old(m_st)=2, \old(t1_st)=1, \old(t2_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=2, E_2=1, 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, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, token=1] [L11362] return (__retres1); VAL [\old(m_st)=2, \old(t1_st)=1, \old(t2_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=2, E_2=1, 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, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, token=1] [L11596] RET, EXPR is_transmit1_triggered() [L11596] tmp___0 = is_transmit1_triggered() [L11598] COND FALSE !(\read(tmp___0)) VAL [\old(m_st)=2, \old(t1_st)=1, \old(t2_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=2, E_2=1, 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, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, tmp=0, tmp___0=0, token=1] [L11604] CALL, EXPR is_transmit2_triggered() [L11366] int __retres1 ; VAL [\old(m_st)=2, \old(t1_st)=1, \old(t2_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=2, E_2=1, 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, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, token=1] [L11369] COND TRUE t2_pc == 1 VAL [\old(m_st)=2, \old(t1_st)=1, \old(t2_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=2, E_2=1, 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, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, token=1] [L11370] COND TRUE E_2 == 1 [L11371] __retres1 = 1 VAL [\old(m_st)=2, \old(t1_st)=1, \old(t2_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=2, E_2=1, 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, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, token=1] [L11381] return (__retres1); VAL [\old(m_st)=2, \old(t1_st)=1, \old(t2_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=2, E_2=1, 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, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, token=1] [L11604] RET, EXPR is_transmit2_triggered() [L11604] tmp___1 = is_transmit2_triggered() [L11606] COND TRUE \read(tmp___1) [L11607] t2_st = 0 VAL [\old(m_st)=2, \old(t1_st)=1, \old(t2_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=2, E_2=1, 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, T2_E=2, t2_i=1, t2_pc=1, t2_st=0, tmp=0, tmp___0=0, tmp___1=1, token=1] [L11620] RET activate_threads() VAL [\old(m_st)=2, \old(t1_st)=1, \old(t2_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=2, E_2=1, 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, T2_E=2, t2_i=1, t2_pc=1, t2_st=0, token=1] [L11280] 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_2=1, 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, T2_E=2, t2_i=1, t2_pc=1, t2_st=0, token=1] [L11281] E_2 = 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_2=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, T2_E=2, t2_i=1, t2_pc=1, t2_st=0, token=1] [L11270] 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_2=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, T2_E=2, t2_i=1, t2_pc=1, t2_st=0, token=1] [L11272] t1_pc = 1 [L11273] 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_2=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=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=0, token=1] [L11476] RET transmit1() [L11484] COND TRUE t2_st == 0 [L11485] int tmp_ndt_3; [L11486] tmp_ndt_3 = __VERIFIER_nondet_int() [L11487] COND TRUE \read(tmp_ndt_3) [L11489] t2_st = 1 [L11490] CALL transmit2() [L11295] COND FALSE !(t2_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_2=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=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=1, token=1] [L11298] COND TRUE t2_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_2=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=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=1, token=1] [L11314] token += 1 [L11315] 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_2=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=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=1, token=2] [L11316] CALL immediate_notify() VAL [\old(m_st)=2, \old(t1_st)=2, \old(t2_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_2=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=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=1, token=2] [L11620] CALL activate_threads() VAL [\old(m_st)=2, \old(t1_st)=2, \old(t2_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_2=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=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=1, token=2] [L11582] int tmp ; [L11583] int tmp___0 ; [L11584] int tmp___1 ; [L11588] CALL, EXPR is_master_triggered() [L11328] int __retres1 ; VAL [\old(m_st)=2, \old(t1_st)=2, \old(t2_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_2=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=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=1, token=2] [L11331] COND TRUE m_pc == 1 VAL [\old(m_st)=2, \old(t1_st)=2, \old(t2_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_2=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=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=1, token=2] [L11332] COND TRUE E_M == 1 [L11333] __retres1 = 1 VAL [\old(m_st)=2, \old(t1_st)=2, \old(t2_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_2=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=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=1, token=2] [L11343] return (__retres1); VAL [\old(m_st)=2, \old(t1_st)=2, \old(t2_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_2=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=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=1, token=2] [L11588] RET, EXPR is_master_triggered() [L11588] tmp = is_master_triggered() [L11590] COND TRUE \read(tmp) [L11591] m_st = 0 VAL [\old(m_st)=2, \old(t1_st)=2, \old(t2_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_2=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=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=1, tmp=1, token=2] [L11596] CALL, EXPR is_transmit1_triggered() [L11347] int __retres1 ; VAL [\old(m_st)=2, \old(t1_st)=2, \old(t2_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_2=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=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=1, token=2] [L11350] COND TRUE t1_pc == 1 VAL [\old(m_st)=2, \old(t1_st)=2, \old(t2_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_2=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=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=1, token=2] [L11351] COND FALSE !(E_1 == 1) VAL [\old(m_st)=2, \old(t1_st)=2, \old(t2_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_2=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=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=1, token=2] [L11360] __retres1 = 0 VAL [\old(m_st)=2, \old(t1_st)=2, \old(t2_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_2=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=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=1, token=2] [L11362] return (__retres1); VAL [\old(m_st)=2, \old(t1_st)=2, \old(t2_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_2=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=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=1, token=2] [L11596] RET, EXPR is_transmit1_triggered() [L11596] tmp___0 = is_transmit1_triggered() [L11598] COND FALSE !(\read(tmp___0)) VAL [\old(m_st)=2, \old(t1_st)=2, \old(t2_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_2=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=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=1, tmp=1, tmp___0=0, token=2] [L11604] CALL, EXPR is_transmit2_triggered() [L11366] int __retres1 ; VAL [\old(m_st)=2, \old(t1_st)=2, \old(t2_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_2=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=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=1, token=2] [L11369] COND TRUE t2_pc == 1 VAL [\old(m_st)=2, \old(t1_st)=2, \old(t2_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_2=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=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=1, token=2] [L11370] COND FALSE !(E_2 == 1) VAL [\old(m_st)=2, \old(t1_st)=2, \old(t2_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_2=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=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=1, token=2] [L11379] __retres1 = 0 VAL [\old(m_st)=2, \old(t1_st)=2, \old(t2_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_2=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=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=1, token=2] [L11381] return (__retres1); VAL [\old(m_st)=2, \old(t1_st)=2, \old(t2_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_2=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=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=1, token=2] [L11604] RET, EXPR is_transmit2_triggered() [L11604] tmp___1 = is_transmit2_triggered() [L11606] COND FALSE !(\read(tmp___1)) VAL [\old(m_st)=2, \old(t1_st)=2, \old(t2_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_2=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=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=1, tmp=1, tmp___0=0, tmp___1=0, token=2] [L11620] RET activate_threads() VAL [\old(m_st)=2, \old(t1_st)=2, \old(t2_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_2=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=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=1, token=2] [L11316] 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_2=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=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=1, token=2] [L11317] 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_2=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, T2_E=2, t2_i=1, t2_pc=1, t2_st=1, token=2] [L11306] 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_2=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, T2_E=2, t2_i=1, t2_pc=1, t2_st=1, token=2] [L11308] t2_pc = 1 [L11309] t2_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_2=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, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, token=2] [L11490] RET transmit2() [L11446] 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_2=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, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, tmp=1, tmp_ndt_1=-2, tmp_ndt_2=-3, tmp_ndt_3=1, token=2] [L11449] 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_2=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, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, token=2] [L11416] 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_2=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, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, token=2] [L11419] COND TRUE m_st == 0 [L11420] __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_2=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, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, token=2] [L11437] 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_2=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, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, token=2] [L11449] 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_2=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, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, tmp=1, tmp_ndt_1=-2, tmp_ndt_2=-3, tmp_ndt_3=1, token=2] [L11449] tmp = exists_runnable_thread() [L11451] 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_2=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, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, tmp=1, tmp_ndt_1=-2, tmp_ndt_2=-3, tmp_ndt_3=1, token=2] [L11456] COND TRUE m_st == 0 [L11457] int tmp_ndt_1; [L11458] tmp_ndt_1 = __VERIFIER_nondet_int() [L11459] COND TRUE \read(tmp_ndt_1) [L11461] m_st = 1 [L11462] CALL master() [L11201] int tmp_var = __VERIFIER_nondet_int(); [L11203] 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_2=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, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, tmp_var=5, token=2] [L11206] 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_2=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, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, tmp_var=5, token=2] [L11228] COND FALSE !(token != local + 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_2=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, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, tmp_var=5, token=2] [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_2=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, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, tmp_var=5, token=2] [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_2=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, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, tmp_var=5, token=2] [L11239] 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_2=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, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, tmp_var=5, token=2] [L11240] 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_2=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, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, tmp_var=5, token=2] [L11241] 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_2=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, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, tmp_var=5, token=2] [L11242] 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_2=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, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, token=2] [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_2=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, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, token=2] - 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, 2323 locations, 2 error locations. Started 1 CEGAR loops. OverallTime: 45.1s, OverallIterations: 29, TraceHistogramMax: 4, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.5s, AutomataDifference: 18.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, PartialOrderReductionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 69872 SdHoareTripleChecker+Valid, 3.6s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 69711 mSDsluCounter, 331943 SdHoareTripleChecker+Invalid, 2.9s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 214147 mSDsCounter, 757 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 5604 IncrementalHoareTripleChecker+Invalid, 6361 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 757 mSolverCounterUnsat, 117796 mSDtfsCounter, 5604 mSolverCounterSat, 0.4s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 3573 GetRequests, 3351 SyntacticMatches, 6 SemanticMatches, 216 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 203 ImplicationChecksByTransitivity, 1.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=33589occurred in iteration=14, InterpolantAutomatonStates: 167, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 14.2s AutomataMinimizationTime, 28 MinimizatonAttempts, 14837 StatesRemovedByMinimization, 24 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.3s SsaConstructionTime, 0.9s SatisfiabilityAnalysisTime, 5.9s InterpolantComputationTime, 6960 NumberOfCodeBlocks, 6960 NumberOfCodeBlocksAsserted, 47 NumberOfCheckSat, 6706 ConstructedInterpolants, 0 QuantifiedInterpolants, 10859 SizeOfPredicates, 9 NumberOfNonLiveVariables, 9564 ConjunctsInSsa, 61 ConjunctsInUnsatCore, 46 InterpolantComputations, 28 PerfectInterpolantSequences, 3368/3904 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! [2021-12-14 15:44:24,265 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