./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/systemc/token_ring.01.cil-1.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version f4b24e32 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/systemc/token_ring.01.cil-1.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 7b0a21004c99a1cc1588d43a2481960a2ce9f2cdf68e9a363306433e7d24bd30 --- Real Ultimate output --- This is Ultimate 0.2.2-?-f4b24e3 [2022-07-13 18:12:51,791 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-07-13 18:12:51,793 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-07-13 18:12:51,828 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-07-13 18:12:51,828 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-07-13 18:12:51,829 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-07-13 18:12:51,830 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-07-13 18:12:51,832 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-07-13 18:12:51,833 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-07-13 18:12:51,836 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-07-13 18:12:51,837 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-07-13 18:12:51,838 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-07-13 18:12:51,839 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-07-13 18:12:51,840 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-07-13 18:12:51,841 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-07-13 18:12:51,843 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-07-13 18:12:51,844 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-07-13 18:12:51,845 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-07-13 18:12:51,846 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-07-13 18:12:51,850 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-07-13 18:12:51,852 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-07-13 18:12:51,852 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-07-13 18:12:51,853 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-07-13 18:12:51,853 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-07-13 18:12:51,855 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-07-13 18:12:51,859 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-07-13 18:12:51,860 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-07-13 18:12:51,860 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-07-13 18:12:51,861 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-07-13 18:12:51,861 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-07-13 18:12:51,862 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-07-13 18:12:51,862 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-07-13 18:12:51,863 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-07-13 18:12:51,864 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-07-13 18:12:51,864 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-07-13 18:12:51,865 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-07-13 18:12:51,865 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-07-13 18:12:51,865 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-07-13 18:12:51,865 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-07-13 18:12:51,866 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-07-13 18:12:51,867 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-07-13 18:12:51,868 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-07-13 18:12:51,870 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2022-07-13 18:12:51,902 INFO L113 SettingsManager]: Loading preferences was successful [2022-07-13 18:12:51,902 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-07-13 18:12:51,902 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-07-13 18:12:51,903 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-07-13 18:12:51,903 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-07-13 18:12:51,903 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-07-13 18:12:51,904 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-07-13 18:12:51,904 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-07-13 18:12:51,904 INFO L138 SettingsManager]: * Use SBE=true [2022-07-13 18:12:51,905 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-07-13 18:12:51,905 INFO L138 SettingsManager]: * sizeof long=4 [2022-07-13 18:12:51,905 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-07-13 18:12:51,905 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-07-13 18:12:51,905 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-07-13 18:12:51,905 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-07-13 18:12:51,905 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-07-13 18:12:51,906 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-07-13 18:12:51,906 INFO L138 SettingsManager]: * sizeof long double=12 [2022-07-13 18:12:51,906 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-07-13 18:12:51,907 INFO L138 SettingsManager]: * Use constant arrays=true [2022-07-13 18:12:51,907 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-07-13 18:12:51,907 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-07-13 18:12:51,907 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-07-13 18:12:51,907 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-07-13 18:12:51,907 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-13 18:12:51,912 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-07-13 18:12:51,912 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-07-13 18:12:51,913 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-07-13 18:12:51,913 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-07-13 18:12:51,913 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-07-13 18:12:51,913 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-07-13 18:12:51,913 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-07-13 18:12:51,913 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-07-13 18:12:51,914 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 -> 7b0a21004c99a1cc1588d43a2481960a2ce9f2cdf68e9a363306433e7d24bd30 [2022-07-13 18:12:52,081 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-07-13 18:12:52,104 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-07-13 18:12:52,107 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-07-13 18:12:52,108 INFO L271 PluginConnector]: Initializing CDTParser... [2022-07-13 18:12:52,109 INFO L275 PluginConnector]: CDTParser initialized [2022-07-13 18:12:52,109 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/systemc/token_ring.01.cil-1.c [2022-07-13 18:12:52,160 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5926703f4/576e047e777a44e5aad721582c7608d2/FLAGa6bb94069 [2022-07-13 18:12:52,537 INFO L306 CDTParser]: Found 1 translation units. [2022-07-13 18:12:52,537 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/systemc/token_ring.01.cil-1.c [2022-07-13 18:12:52,542 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5926703f4/576e047e777a44e5aad721582c7608d2/FLAGa6bb94069 [2022-07-13 18:12:52,940 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5926703f4/576e047e777a44e5aad721582c7608d2 [2022-07-13 18:12:52,942 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-07-13 18:12:52,943 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-07-13 18:12:52,944 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-07-13 18:12:52,944 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-07-13 18:12:52,946 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-07-13 18:12:52,947 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.07 06:12:52" (1/1) ... [2022-07-13 18:12:52,948 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@ff54ca1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 06:12:52, skipping insertion in model container [2022-07-13 18:12:52,948 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.07 06:12:52" (1/1) ... [2022-07-13 18:12:52,952 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-07-13 18:12:52,967 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-07-13 18:12:53,042 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/systemc/token_ring.01.cil-1.c[671,684] [2022-07-13 18:12:53,070 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-13 18:12:53,076 INFO L203 MainTranslator]: Completed pre-run [2022-07-13 18:12:53,083 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/systemc/token_ring.01.cil-1.c[671,684] [2022-07-13 18:12:53,095 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-13 18:12:53,105 INFO L208 MainTranslator]: Completed translation [2022-07-13 18:12:53,105 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 06:12:53 WrapperNode [2022-07-13 18:12:53,105 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-07-13 18:12:53,106 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-07-13 18:12:53,106 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-07-13 18:12:53,106 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-07-13 18:12:53,111 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 06:12:53" (1/1) ... [2022-07-13 18:12:53,115 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 06:12:53" (1/1) ... [2022-07-13 18:12:53,129 INFO L137 Inliner]: procedures = 30, calls = 34, calls flagged for inlining = 14, calls inlined = 14, statements flattened = 215 [2022-07-13 18:12:53,129 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-07-13 18:12:53,130 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-07-13 18:12:53,130 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-07-13 18:12:53,130 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-07-13 18:12:53,135 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 06:12:53" (1/1) ... [2022-07-13 18:12:53,135 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 06:12:53" (1/1) ... [2022-07-13 18:12:53,136 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 06:12:53" (1/1) ... [2022-07-13 18:12:53,136 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 06:12:53" (1/1) ... [2022-07-13 18:12:53,139 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 06:12:53" (1/1) ... [2022-07-13 18:12:53,142 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 06:12:53" (1/1) ... [2022-07-13 18:12:53,143 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 06:12:53" (1/1) ... [2022-07-13 18:12:53,145 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-07-13 18:12:53,145 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-07-13 18:12:53,145 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-07-13 18:12:53,145 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-07-13 18:12:53,146 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 06:12:53" (1/1) ... [2022-07-13 18:12:53,151 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-13 18:12:53,161 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 18:12:53,171 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-07-13 18:12:53,189 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-07-13 18:12:53,207 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-07-13 18:12:53,207 INFO L130 BoogieDeclarations]: Found specification of procedure fire_delta_events [2022-07-13 18:12:53,207 INFO L138 BoogieDeclarations]: Found implementation of procedure fire_delta_events [2022-07-13 18:12:53,207 INFO L130 BoogieDeclarations]: Found specification of procedure activate_threads [2022-07-13 18:12:53,207 INFO L138 BoogieDeclarations]: Found implementation of procedure activate_threads [2022-07-13 18:12:53,208 INFO L130 BoogieDeclarations]: Found specification of procedure immediate_notify [2022-07-13 18:12:53,208 INFO L138 BoogieDeclarations]: Found implementation of procedure immediate_notify [2022-07-13 18:12:53,208 INFO L130 BoogieDeclarations]: Found specification of procedure exists_runnable_thread [2022-07-13 18:12:53,208 INFO L138 BoogieDeclarations]: Found implementation of procedure exists_runnable_thread [2022-07-13 18:12:53,208 INFO L130 BoogieDeclarations]: Found specification of procedure reset_delta_events [2022-07-13 18:12:53,208 INFO L138 BoogieDeclarations]: Found implementation of procedure reset_delta_events [2022-07-13 18:12:53,208 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-07-13 18:12:53,209 INFO L130 BoogieDeclarations]: Found specification of procedure update_channels [2022-07-13 18:12:53,209 INFO L138 BoogieDeclarations]: Found implementation of procedure update_channels [2022-07-13 18:12:53,209 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-07-13 18:12:53,209 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-07-13 18:12:53,260 INFO L234 CfgBuilder]: Building ICFG [2022-07-13 18:12:53,261 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-07-13 18:12:53,475 INFO L275 CfgBuilder]: Performing block encoding [2022-07-13 18:12:53,480 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-07-13 18:12:53,481 INFO L299 CfgBuilder]: Removed 4 assume(true) statements. [2022-07-13 18:12:53,482 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.07 06:12:53 BoogieIcfgContainer [2022-07-13 18:12:53,482 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-07-13 18:12:53,490 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-07-13 18:12:53,491 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-07-13 18:12:53,494 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-07-13 18:12:53,495 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.07 06:12:52" (1/3) ... [2022-07-13 18:12:53,496 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5406ed42 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.07 06:12:53, skipping insertion in model container [2022-07-13 18:12:53,496 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 06:12:53" (2/3) ... [2022-07-13 18:12:53,496 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5406ed42 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.07 06:12:53, skipping insertion in model container [2022-07-13 18:12:53,496 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.07 06:12:53" (3/3) ... [2022-07-13 18:12:53,497 INFO L111 eAbstractionObserver]: Analyzing ICFG token_ring.01.cil-1.c [2022-07-13 18:12:53,540 INFO L201 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-07-13 18:12:53,540 INFO L160 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-07-13 18:12:53,590 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-07-13 18:12:53,596 INFO L357 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@580705f9, mLbeIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@2b5f0e47 [2022-07-13 18:12:53,597 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-07-13 18:12:53,600 INFO L276 IsEmpty]: Start isEmpty. Operand has 107 states, 84 states have (on average 1.5238095238095237) internal successors, (128), 86 states have internal predecessors, (128), 15 states have call successors, (15), 6 states have call predecessors, (15), 6 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2022-07-13 18:12:53,618 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2022-07-13 18:12:53,621 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 18:12:53,622 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 18:12:53,622 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 18:12:53,627 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 18:12:53,628 INFO L85 PathProgramCache]: Analyzing trace with hash 1624964503, now seen corresponding path program 1 times [2022-07-13 18:12:53,633 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 18:12:53,634 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1875375061] [2022-07-13 18:12:53,634 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 18:12:53,635 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 18:12:53,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:12:53,824 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-13 18:12:53,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:12:53,842 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-13 18:12:53,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:12:53,886 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-07-13 18:12:53,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:12:53,907 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2022-07-13 18:12:53,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:12:53,916 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2022-07-13 18:12:53,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:12:53,926 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-13 18:12:53,927 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 18:12:53,928 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1875375061] [2022-07-13 18:12:53,928 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1875375061] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 18:12:53,928 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 18:12:53,928 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-13 18:12:53,929 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [683945765] [2022-07-13 18:12:53,930 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 18:12:53,936 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-13 18:12:53,936 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 18:12:53,956 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-13 18:12:53,957 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-13 18:12:53,958 INFO L87 Difference]: Start difference. First operand has 107 states, 84 states have (on average 1.5238095238095237) internal successors, (128), 86 states have internal predecessors, (128), 15 states have call successors, (15), 6 states have call predecessors, (15), 6 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) Second operand has 6 states, 6 states have (on average 7.666666666666667) internal successors, (46), 4 states have internal predecessors, (46), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-07-13 18:12:54,439 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 18:12:54,440 INFO L93 Difference]: Finished difference Result 339 states and 511 transitions. [2022-07-13 18:12:54,441 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-07-13 18:12:54,442 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 7.666666666666667) internal successors, (46), 4 states have internal predecessors, (46), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 56 [2022-07-13 18:12:54,442 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 18:12:54,462 INFO L225 Difference]: With dead ends: 339 [2022-07-13 18:12:54,462 INFO L226 Difference]: Without dead ends: 233 [2022-07-13 18:12:54,464 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=33, Invalid=77, Unknown=0, NotChecked=0, Total=110 [2022-07-13 18:12:54,467 INFO L413 NwaCegarLoop]: 167 mSDtfsCounter, 293 mSDsluCounter, 281 mSDsCounter, 0 mSdLazyCounter, 410 mSolverCounterSat, 72 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 301 SdHoareTripleChecker+Valid, 448 SdHoareTripleChecker+Invalid, 482 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 72 IncrementalHoareTripleChecker+Valid, 410 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-07-13 18:12:54,467 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [301 Valid, 448 Invalid, 482 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [72 Valid, 410 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-07-13 18:12:54,479 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 233 states. [2022-07-13 18:12:54,505 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 233 to 192. [2022-07-13 18:12:54,506 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 192 states, 153 states have (on average 1.4313725490196079) internal successors, (219), 155 states have internal predecessors, (219), 25 states have call successors, (25), 12 states have call predecessors, (25), 13 states have return successors, (28), 25 states have call predecessors, (28), 25 states have call successors, (28) [2022-07-13 18:12:54,507 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 192 states to 192 states and 272 transitions. [2022-07-13 18:12:54,508 INFO L78 Accepts]: Start accepts. Automaton has 192 states and 272 transitions. Word has length 56 [2022-07-13 18:12:54,509 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 18:12:54,509 INFO L495 AbstractCegarLoop]: Abstraction has 192 states and 272 transitions. [2022-07-13 18:12:54,509 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 7.666666666666667) internal successors, (46), 4 states have internal predecessors, (46), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-07-13 18:12:54,509 INFO L276 IsEmpty]: Start isEmpty. Operand 192 states and 272 transitions. [2022-07-13 18:12:54,511 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2022-07-13 18:12:54,511 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 18:12:54,511 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 18:12:54,511 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-07-13 18:12:54,511 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 18:12:54,512 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 18:12:54,512 INFO L85 PathProgramCache]: Analyzing trace with hash 713012507, now seen corresponding path program 1 times [2022-07-13 18:12:54,512 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 18:12:54,512 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [959408480] [2022-07-13 18:12:54,513 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 18:12:54,513 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 18:12:54,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:12:54,534 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-13 18:12:54,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:12:54,541 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-13 18:12:54,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:12:54,564 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-07-13 18:12:54,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:12:54,571 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2022-07-13 18:12:54,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:12:54,575 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2022-07-13 18:12:54,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:12:54,579 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-13 18:12:54,579 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 18:12:54,580 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [959408480] [2022-07-13 18:12:54,580 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [959408480] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 18:12:54,581 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 18:12:54,581 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-07-13 18:12:54,581 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [633689690] [2022-07-13 18:12:54,581 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 18:12:54,582 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-07-13 18:12:54,583 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 18:12:54,583 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-07-13 18:12:54,584 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-07-13 18:12:54,584 INFO L87 Difference]: Start difference. First operand 192 states and 272 transitions. Second operand has 7 states, 7 states have (on average 6.571428571428571) internal successors, (46), 5 states have internal predecessors, (46), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-07-13 18:12:55,036 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 18:12:55,036 INFO L93 Difference]: Finished difference Result 524 states and 746 transitions. [2022-07-13 18:12:55,037 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-07-13 18:12:55,037 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 6.571428571428571) internal successors, (46), 5 states have internal predecessors, (46), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 56 [2022-07-13 18:12:55,037 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 18:12:55,040 INFO L225 Difference]: With dead ends: 524 [2022-07-13 18:12:55,040 INFO L226 Difference]: Without dead ends: 341 [2022-07-13 18:12:55,041 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=66, Invalid=174, Unknown=0, NotChecked=0, Total=240 [2022-07-13 18:12:55,042 INFO L413 NwaCegarLoop]: 218 mSDtfsCounter, 274 mSDsluCounter, 467 mSDsCounter, 0 mSdLazyCounter, 636 mSolverCounterSat, 53 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 282 SdHoareTripleChecker+Valid, 685 SdHoareTripleChecker+Invalid, 689 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 53 IncrementalHoareTripleChecker+Valid, 636 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-07-13 18:12:55,043 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [282 Valid, 685 Invalid, 689 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [53 Valid, 636 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-07-13 18:12:55,043 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 341 states. [2022-07-13 18:12:55,063 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 341 to 277. [2022-07-13 18:12:55,068 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 277 states, 221 states have (on average 1.420814479638009) internal successors, (314), 224 states have internal predecessors, (314), 35 states have call successors, (35), 18 states have call predecessors, (35), 20 states have return successors, (40), 36 states have call predecessors, (40), 35 states have call successors, (40) [2022-07-13 18:12:55,071 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 277 states to 277 states and 389 transitions. [2022-07-13 18:12:55,072 INFO L78 Accepts]: Start accepts. Automaton has 277 states and 389 transitions. Word has length 56 [2022-07-13 18:12:55,073 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 18:12:55,074 INFO L495 AbstractCegarLoop]: Abstraction has 277 states and 389 transitions. [2022-07-13 18:12:55,074 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 6.571428571428571) internal successors, (46), 5 states have internal predecessors, (46), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-07-13 18:12:55,074 INFO L276 IsEmpty]: Start isEmpty. Operand 277 states and 389 transitions. [2022-07-13 18:12:55,077 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2022-07-13 18:12:55,078 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 18:12:55,078 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 18:12:55,079 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-07-13 18:12:55,079 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 18:12:55,079 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 18:12:55,080 INFO L85 PathProgramCache]: Analyzing trace with hash -1336375335, now seen corresponding path program 1 times [2022-07-13 18:12:55,080 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 18:12:55,081 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [959059141] [2022-07-13 18:12:55,081 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 18:12:55,081 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 18:12:55,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:12:55,102 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-13 18:12:55,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:12:55,109 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-13 18:12:55,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:12:55,127 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-07-13 18:12:55,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:12:55,134 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2022-07-13 18:12:55,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:12:55,137 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2022-07-13 18:12:55,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:12:55,139 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-13 18:12:55,139 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 18:12:55,139 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [959059141] [2022-07-13 18:12:55,140 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [959059141] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 18:12:55,140 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 18:12:55,140 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-07-13 18:12:55,140 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [590233936] [2022-07-13 18:12:55,140 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 18:12:55,141 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-07-13 18:12:55,141 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 18:12:55,141 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-07-13 18:12:55,141 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-07-13 18:12:55,142 INFO L87 Difference]: Start difference. First operand 277 states and 389 transitions. Second operand has 7 states, 7 states have (on average 6.571428571428571) internal successors, (46), 5 states have internal predecessors, (46), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-07-13 18:12:55,612 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 18:12:55,613 INFO L93 Difference]: Finished difference Result 860 states and 1213 transitions. [2022-07-13 18:12:55,613 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-07-13 18:12:55,613 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 6.571428571428571) internal successors, (46), 5 states have internal predecessors, (46), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 56 [2022-07-13 18:12:55,613 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 18:12:55,616 INFO L225 Difference]: With dead ends: 860 [2022-07-13 18:12:55,616 INFO L226 Difference]: Without dead ends: 592 [2022-07-13 18:12:55,617 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 46 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=73, Invalid=199, Unknown=0, NotChecked=0, Total=272 [2022-07-13 18:12:55,618 INFO L413 NwaCegarLoop]: 208 mSDtfsCounter, 328 mSDsluCounter, 459 mSDsCounter, 0 mSdLazyCounter, 631 mSolverCounterSat, 61 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 338 SdHoareTripleChecker+Valid, 667 SdHoareTripleChecker+Invalid, 692 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 61 IncrementalHoareTripleChecker+Valid, 631 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-07-13 18:12:55,619 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [338 Valid, 667 Invalid, 692 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [61 Valid, 631 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-07-13 18:12:55,620 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 592 states. [2022-07-13 18:12:55,639 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 592 to 442. [2022-07-13 18:12:55,640 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 442 states, 354 states have (on average 1.4152542372881356) internal successors, (501), 359 states have internal predecessors, (501), 53 states have call successors, (53), 30 states have call predecessors, (53), 34 states have return successors, (66), 56 states have call predecessors, (66), 53 states have call successors, (66) [2022-07-13 18:12:55,642 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 442 states to 442 states and 620 transitions. [2022-07-13 18:12:55,642 INFO L78 Accepts]: Start accepts. Automaton has 442 states and 620 transitions. Word has length 56 [2022-07-13 18:12:55,642 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 18:12:55,643 INFO L495 AbstractCegarLoop]: Abstraction has 442 states and 620 transitions. [2022-07-13 18:12:55,643 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 6.571428571428571) internal successors, (46), 5 states have internal predecessors, (46), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-07-13 18:12:55,643 INFO L276 IsEmpty]: Start isEmpty. Operand 442 states and 620 transitions. [2022-07-13 18:12:55,644 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2022-07-13 18:12:55,644 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 18:12:55,644 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 18:12:55,645 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-07-13 18:12:55,645 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 18:12:55,645 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 18:12:55,645 INFO L85 PathProgramCache]: Analyzing trace with hash 2061198683, now seen corresponding path program 1 times [2022-07-13 18:12:55,645 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 18:12:55,645 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1286306070] [2022-07-13 18:12:55,646 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 18:12:55,646 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 18:12:55,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:12:55,665 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-13 18:12:55,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:12:55,672 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-13 18:12:55,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:12:55,686 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-07-13 18:12:55,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:12:55,692 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2022-07-13 18:12:55,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:12:55,694 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2022-07-13 18:12:55,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:12:55,696 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-13 18:12:55,696 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 18:12:55,696 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1286306070] [2022-07-13 18:12:55,696 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1286306070] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 18:12:55,696 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 18:12:55,696 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-07-13 18:12:55,697 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1363225549] [2022-07-13 18:12:55,697 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 18:12:55,697 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-07-13 18:12:55,697 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 18:12:55,698 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-07-13 18:12:55,698 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2022-07-13 18:12:55,698 INFO L87 Difference]: Start difference. First operand 442 states and 620 transitions. Second operand has 7 states, 7 states have (on average 6.571428571428571) internal successors, (46), 5 states have internal predecessors, (46), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-07-13 18:12:55,895 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 18:12:55,895 INFO L93 Difference]: Finished difference Result 961 states and 1363 transitions. [2022-07-13 18:12:55,895 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-13 18:12:55,896 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 6.571428571428571) internal successors, (46), 5 states have internal predecessors, (46), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 56 [2022-07-13 18:12:55,896 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 18:12:55,898 INFO L225 Difference]: With dead ends: 961 [2022-07-13 18:12:55,898 INFO L226 Difference]: Without dead ends: 528 [2022-07-13 18:12:55,899 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=36, Invalid=74, Unknown=0, NotChecked=0, Total=110 [2022-07-13 18:12:55,900 INFO L413 NwaCegarLoop]: 119 mSDtfsCounter, 250 mSDsluCounter, 176 mSDsCounter, 0 mSdLazyCounter, 257 mSolverCounterSat, 73 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 259 SdHoareTripleChecker+Valid, 295 SdHoareTripleChecker+Invalid, 330 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 73 IncrementalHoareTripleChecker+Valid, 257 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-13 18:12:55,900 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [259 Valid, 295 Invalid, 330 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [73 Valid, 257 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-13 18:12:55,901 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 528 states. [2022-07-13 18:12:55,917 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 528 to 442. [2022-07-13 18:12:55,918 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 442 states, 354 states have (on average 1.4011299435028248) internal successors, (496), 359 states have internal predecessors, (496), 53 states have call successors, (53), 30 states have call predecessors, (53), 34 states have return successors, (66), 56 states have call predecessors, (66), 53 states have call successors, (66) [2022-07-13 18:12:55,920 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 442 states to 442 states and 615 transitions. [2022-07-13 18:12:55,920 INFO L78 Accepts]: Start accepts. Automaton has 442 states and 615 transitions. Word has length 56 [2022-07-13 18:12:55,921 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 18:12:55,921 INFO L495 AbstractCegarLoop]: Abstraction has 442 states and 615 transitions. [2022-07-13 18:12:55,921 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 6.571428571428571) internal successors, (46), 5 states have internal predecessors, (46), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-07-13 18:12:55,921 INFO L276 IsEmpty]: Start isEmpty. Operand 442 states and 615 transitions. [2022-07-13 18:12:55,922 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2022-07-13 18:12:55,922 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 18:12:55,922 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 18:12:55,923 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-07-13 18:12:55,923 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 18:12:55,923 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 18:12:55,923 INFO L85 PathProgramCache]: Analyzing trace with hash -1985622119, now seen corresponding path program 1 times [2022-07-13 18:12:55,923 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 18:12:55,923 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [301093189] [2022-07-13 18:12:55,924 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 18:12:55,924 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 18:12:55,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:12:55,953 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-13 18:12:55,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:12:55,959 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-13 18:12:55,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:12:55,965 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-07-13 18:12:55,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:12:55,990 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2022-07-13 18:12:55,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:12:55,993 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2022-07-13 18:12:55,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:12:55,994 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-13 18:12:55,994 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 18:12:55,995 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [301093189] [2022-07-13 18:12:55,995 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [301093189] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 18:12:55,995 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 18:12:55,995 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-13 18:12:55,998 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [634821810] [2022-07-13 18:12:55,998 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 18:12:55,998 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-13 18:12:55,998 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 18:12:55,999 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-13 18:12:55,999 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-13 18:12:55,999 INFO L87 Difference]: Start difference. First operand 442 states and 615 transitions. Second operand has 6 states, 6 states have (on average 7.666666666666667) internal successors, (46), 4 states have internal predecessors, (46), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-07-13 18:12:56,339 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 18:12:56,339 INFO L93 Difference]: Finished difference Result 1435 states and 2006 transitions. [2022-07-13 18:12:56,339 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-07-13 18:12:56,340 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 7.666666666666667) internal successors, (46), 4 states have internal predecessors, (46), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 56 [2022-07-13 18:12:56,340 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 18:12:56,345 INFO L225 Difference]: With dead ends: 1435 [2022-07-13 18:12:56,345 INFO L226 Difference]: Without dead ends: 1003 [2022-07-13 18:12:56,346 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=39, Invalid=93, Unknown=0, NotChecked=0, Total=132 [2022-07-13 18:12:56,351 INFO L413 NwaCegarLoop]: 253 mSDtfsCounter, 379 mSDsluCounter, 282 mSDsCounter, 0 mSdLazyCounter, 459 mSolverCounterSat, 79 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 402 SdHoareTripleChecker+Valid, 535 SdHoareTripleChecker+Invalid, 538 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 79 IncrementalHoareTripleChecker+Valid, 459 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-07-13 18:12:56,351 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [402 Valid, 535 Invalid, 538 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [79 Valid, 459 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-07-13 18:12:56,353 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1003 states. [2022-07-13 18:12:56,388 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1003 to 846. [2022-07-13 18:12:56,390 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 846 states, 675 states have (on average 1.3733333333333333) internal successors, (927), 689 states have internal predecessors, (927), 102 states have call successors, (102), 60 states have call predecessors, (102), 68 states have return successors, (125), 100 states have call predecessors, (125), 102 states have call successors, (125) [2022-07-13 18:12:56,395 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 846 states to 846 states and 1154 transitions. [2022-07-13 18:12:56,395 INFO L78 Accepts]: Start accepts. Automaton has 846 states and 1154 transitions. Word has length 56 [2022-07-13 18:12:56,396 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 18:12:56,396 INFO L495 AbstractCegarLoop]: Abstraction has 846 states and 1154 transitions. [2022-07-13 18:12:56,396 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 7.666666666666667) internal successors, (46), 4 states have internal predecessors, (46), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-07-13 18:12:56,396 INFO L276 IsEmpty]: Start isEmpty. Operand 846 states and 1154 transitions. [2022-07-13 18:12:56,399 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2022-07-13 18:12:56,399 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 18:12:56,399 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 18:12:56,400 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-07-13 18:12:56,400 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 18:12:56,400 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 18:12:56,400 INFO L85 PathProgramCache]: Analyzing trace with hash -34790867, now seen corresponding path program 1 times [2022-07-13 18:12:56,400 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 18:12:56,401 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1323355620] [2022-07-13 18:12:56,401 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 18:12:56,402 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 18:12:56,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:12:56,434 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-13 18:12:56,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:12:56,444 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-13 18:12:56,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:12:56,450 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-07-13 18:12:56,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:12:56,490 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2022-07-13 18:12:56,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:12:56,494 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2022-07-13 18:12:56,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:12:56,499 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2022-07-13 18:12:56,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:12:56,507 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-07-13 18:12:56,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:12:56,512 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2022-07-13 18:12:56,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:12:56,513 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2022-07-13 18:12:56,513 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 18:12:56,514 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1323355620] [2022-07-13 18:12:56,514 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1323355620] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-13 18:12:56,514 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [950014424] [2022-07-13 18:12:56,514 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 18:12:56,514 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-13 18:12:56,514 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 18:12:56,516 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-13 18:12:56,539 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-07-13 18:12:56,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:12:56,586 INFO L263 TraceCheckSpWp]: Trace formula consists of 293 conjuncts, 2 conjunts are in the unsatisfiable core [2022-07-13 18:12:56,590 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 18:12:56,609 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2022-07-13 18:12:56,609 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-13 18:12:56,610 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [950014424] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 18:12:56,610 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-07-13 18:12:56,610 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [7] total 8 [2022-07-13 18:12:56,610 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1623730132] [2022-07-13 18:12:56,610 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 18:12:56,611 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-13 18:12:56,611 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 18:12:56,611 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-13 18:12:56,611 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2022-07-13 18:12:56,611 INFO L87 Difference]: Start difference. First operand 846 states and 1154 transitions. Second operand has 3 states, 3 states have (on average 20.666666666666668) internal successors, (62), 3 states have internal predecessors, (62), 2 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2022-07-13 18:12:56,682 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 18:12:56,683 INFO L93 Difference]: Finished difference Result 2437 states and 3376 transitions. [2022-07-13 18:12:56,683 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-13 18:12:56,683 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 20.666666666666668) internal successors, (62), 3 states have internal predecessors, (62), 2 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) Word has length 91 [2022-07-13 18:12:56,684 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 18:12:56,689 INFO L225 Difference]: With dead ends: 2437 [2022-07-13 18:12:56,690 INFO L226 Difference]: Without dead ends: 1602 [2022-07-13 18:12:56,692 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 112 GetRequests, 106 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2022-07-13 18:12:56,692 INFO L413 NwaCegarLoop]: 256 mSDtfsCounter, 113 mSDsluCounter, 137 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 113 SdHoareTripleChecker+Valid, 393 SdHoareTripleChecker+Invalid, 13 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-13 18:12:56,692 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [113 Valid, 393 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-13 18:12:56,693 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1602 states. [2022-07-13 18:12:56,747 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1602 to 1602. [2022-07-13 18:12:56,751 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1602 states, 1280 states have (on average 1.36171875) internal successors, (1743), 1303 states have internal predecessors, (1743), 189 states have call successors, (189), 116 states have call predecessors, (189), 132 states have return successors, (260), 190 states have call predecessors, (260), 189 states have call successors, (260) [2022-07-13 18:12:56,756 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1602 states to 1602 states and 2192 transitions. [2022-07-13 18:12:56,757 INFO L78 Accepts]: Start accepts. Automaton has 1602 states and 2192 transitions. Word has length 91 [2022-07-13 18:12:56,758 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 18:12:56,759 INFO L495 AbstractCegarLoop]: Abstraction has 1602 states and 2192 transitions. [2022-07-13 18:12:56,759 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 20.666666666666668) internal successors, (62), 3 states have internal predecessors, (62), 2 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2022-07-13 18:12:56,759 INFO L276 IsEmpty]: Start isEmpty. Operand 1602 states and 2192 transitions. [2022-07-13 18:12:56,764 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2022-07-13 18:12:56,764 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 18:12:56,766 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 18:12:56,786 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-07-13 18:12:56,976 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable5 [2022-07-13 18:12:56,977 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 18:12:56,977 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 18:12:56,977 INFO L85 PathProgramCache]: Analyzing trace with hash 1902655295, now seen corresponding path program 1 times [2022-07-13 18:12:56,977 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 18:12:56,977 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1507817290] [2022-07-13 18:12:56,977 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 18:12:56,977 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 18:12:56,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:12:57,006 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-13 18:12:57,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:12:57,026 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-13 18:12:57,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:12:57,032 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-07-13 18:12:57,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:12:57,061 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2022-07-13 18:12:57,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:12:57,065 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2022-07-13 18:12:57,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:12:57,067 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2022-07-13 18:12:57,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:12:57,074 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-07-13 18:12:57,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:12:57,085 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2022-07-13 18:12:57,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:12:57,094 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-07-13 18:12:57,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:12:57,097 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 103 [2022-07-13 18:12:57,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:12:57,100 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 22 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2022-07-13 18:12:57,101 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 18:12:57,103 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1507817290] [2022-07-13 18:12:57,103 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1507817290] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-13 18:12:57,103 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [60666808] [2022-07-13 18:12:57,103 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 18:12:57,103 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-13 18:12:57,103 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 18:12:57,104 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-13 18:12:57,106 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-07-13 18:12:57,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:12:57,184 INFO L263 TraceCheckSpWp]: Trace formula consists of 367 conjuncts, 2 conjunts are in the unsatisfiable core [2022-07-13 18:12:57,187 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 18:12:57,279 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 41 proven. 0 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2022-07-13 18:12:57,279 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-13 18:12:57,279 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [60666808] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 18:12:57,279 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-07-13 18:12:57,279 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [7] total 8 [2022-07-13 18:12:57,279 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [82010181] [2022-07-13 18:12:57,279 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 18:12:57,280 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-13 18:12:57,280 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 18:12:57,280 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-13 18:12:57,280 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2022-07-13 18:12:57,280 INFO L87 Difference]: Start difference. First operand 1602 states and 2192 transitions. Second operand has 3 states, 3 states have (on average 28.0) internal successors, (84), 2 states have internal predecessors, (84), 2 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) [2022-07-13 18:12:57,401 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 18:12:57,402 INFO L93 Difference]: Finished difference Result 4682 states and 6441 transitions. [2022-07-13 18:12:57,402 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-13 18:12:57,402 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 28.0) internal successors, (84), 2 states have internal predecessors, (84), 2 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) Word has length 117 [2022-07-13 18:12:57,403 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 18:12:57,414 INFO L225 Difference]: With dead ends: 4682 [2022-07-13 18:12:57,414 INFO L226 Difference]: Without dead ends: 3094 [2022-07-13 18:12:57,418 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 142 GetRequests, 136 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2022-07-13 18:12:57,419 INFO L413 NwaCegarLoop]: 158 mSDtfsCounter, 68 mSDsluCounter, 119 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 68 SdHoareTripleChecker+Valid, 277 SdHoareTripleChecker+Invalid, 12 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-13 18:12:57,420 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [68 Valid, 277 Invalid, 12 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-13 18:12:57,422 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3094 states. [2022-07-13 18:12:57,528 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3094 to 3052. [2022-07-13 18:12:57,532 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3052 states, 2440 states have (on average 1.353688524590164) internal successors, (3303), 2484 states have internal predecessors, (3303), 353 states have call successors, (353), 226 states have call predecessors, (353), 258 states have return successors, (476), 349 states have call predecessors, (476), 353 states have call successors, (476) [2022-07-13 18:12:57,543 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3052 states to 3052 states and 4132 transitions. [2022-07-13 18:12:57,544 INFO L78 Accepts]: Start accepts. Automaton has 3052 states and 4132 transitions. Word has length 117 [2022-07-13 18:12:57,544 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 18:12:57,545 INFO L495 AbstractCegarLoop]: Abstraction has 3052 states and 4132 transitions. [2022-07-13 18:12:57,545 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 28.0) internal successors, (84), 2 states have internal predecessors, (84), 2 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) [2022-07-13 18:12:57,545 INFO L276 IsEmpty]: Start isEmpty. Operand 3052 states and 4132 transitions. [2022-07-13 18:12:57,550 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 134 [2022-07-13 18:12:57,550 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 18:12:57,550 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 18:12:57,570 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2022-07-13 18:12:57,768 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable6 [2022-07-13 18:12:57,769 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 18:12:57,769 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 18:12:57,769 INFO L85 PathProgramCache]: Analyzing trace with hash -844102889, now seen corresponding path program 1 times [2022-07-13 18:12:57,769 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 18:12:57,769 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2087985345] [2022-07-13 18:12:57,769 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 18:12:57,769 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 18:12:57,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:12:57,782 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-13 18:12:57,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:12:57,789 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-13 18:12:57,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:12:57,793 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-07-13 18:12:57,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:12:57,821 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2022-07-13 18:12:57,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:12:57,825 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2022-07-13 18:12:57,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:12:57,827 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2022-07-13 18:12:57,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:12:57,828 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2022-07-13 18:12:57,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:12:57,833 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-07-13 18:12:57,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:12:57,837 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2022-07-13 18:12:57,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:12:57,840 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-07-13 18:12:57,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:12:57,844 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2022-07-13 18:12:57,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:12:57,846 INFO L134 CoverageAnalysis]: Checked inductivity of 81 backedges. 0 proven. 22 refuted. 0 times theorem prover too weak. 59 trivial. 0 not checked. [2022-07-13 18:12:57,846 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 18:12:57,846 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2087985345] [2022-07-13 18:12:57,847 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2087985345] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-13 18:12:57,847 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1708758450] [2022-07-13 18:12:57,847 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 18:12:57,847 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-13 18:12:57,847 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 18:12:57,850 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-13 18:12:57,851 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-07-13 18:12:57,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:12:57,938 INFO L263 TraceCheckSpWp]: Trace formula consists of 404 conjuncts, 3 conjunts are in the unsatisfiable core [2022-07-13 18:12:57,947 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 18:12:57,987 INFO L134 CoverageAnalysis]: Checked inductivity of 81 backedges. 47 proven. 0 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2022-07-13 18:12:57,991 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-13 18:12:57,991 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1708758450] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 18:12:57,991 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-07-13 18:12:57,992 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [7] total 8 [2022-07-13 18:12:57,992 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1055276642] [2022-07-13 18:12:57,992 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 18:12:57,993 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-13 18:12:57,993 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 18:12:57,993 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-13 18:12:57,994 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2022-07-13 18:12:57,994 INFO L87 Difference]: Start difference. First operand 3052 states and 4132 transitions. Second operand has 3 states, 3 states have (on average 28.333333333333332) internal successors, (85), 3 states have internal predecessors, (85), 3 states have call successors, (9), 3 states have call predecessors, (9), 3 states have return successors, (9), 3 states have call predecessors, (9), 3 states have call successors, (9) [2022-07-13 18:12:58,122 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 18:12:58,123 INFO L93 Difference]: Finished difference Result 5716 states and 7745 transitions. [2022-07-13 18:12:58,123 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-13 18:12:58,123 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 28.333333333333332) internal successors, (85), 3 states have internal predecessors, (85), 3 states have call successors, (9), 3 states have call predecessors, (9), 3 states have return successors, (9), 3 states have call predecessors, (9), 3 states have call successors, (9) Word has length 133 [2022-07-13 18:12:58,124 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 18:12:58,137 INFO L225 Difference]: With dead ends: 5716 [2022-07-13 18:12:58,137 INFO L226 Difference]: Without dead ends: 3388 [2022-07-13 18:12:58,142 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 160 GetRequests, 154 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2022-07-13 18:12:58,143 INFO L413 NwaCegarLoop]: 164 mSDtfsCounter, 100 mSDsluCounter, 127 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 100 SdHoareTripleChecker+Valid, 291 SdHoareTripleChecker+Invalid, 10 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-13 18:12:58,143 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [100 Valid, 291 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-13 18:12:58,146 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3388 states. [2022-07-13 18:12:58,265 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3388 to 3350. [2022-07-13 18:12:58,270 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3350 states, 2706 states have (on average 1.3263118994826313) internal successors, (3589), 2750 states have internal predecessors, (3589), 359 states have call successors, (359), 252 states have call predecessors, (359), 284 states have return successors, (508), 355 states have call predecessors, (508), 359 states have call successors, (508) [2022-07-13 18:12:58,283 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3350 states to 3350 states and 4456 transitions. [2022-07-13 18:12:58,284 INFO L78 Accepts]: Start accepts. Automaton has 3350 states and 4456 transitions. Word has length 133 [2022-07-13 18:12:58,285 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 18:12:58,285 INFO L495 AbstractCegarLoop]: Abstraction has 3350 states and 4456 transitions. [2022-07-13 18:12:58,285 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 28.333333333333332) internal successors, (85), 3 states have internal predecessors, (85), 3 states have call successors, (9), 3 states have call predecessors, (9), 3 states have return successors, (9), 3 states have call predecessors, (9), 3 states have call successors, (9) [2022-07-13 18:12:58,285 INFO L276 IsEmpty]: Start isEmpty. Operand 3350 states and 4456 transitions. [2022-07-13 18:12:58,296 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2022-07-13 18:12:58,296 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 18:12:58,297 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 18:12:58,317 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2022-07-13 18:12:58,503 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-13 18:12:58,503 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 18:12:58,504 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 18:12:58,504 INFO L85 PathProgramCache]: Analyzing trace with hash -797474129, now seen corresponding path program 1 times [2022-07-13 18:12:58,504 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 18:12:58,504 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1758355562] [2022-07-13 18:12:58,504 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 18:12:58,504 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 18:12:58,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:12:58,521 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-13 18:12:58,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:12:58,527 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-13 18:12:58,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:12:58,531 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-07-13 18:12:58,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:12:58,559 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2022-07-13 18:12:58,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:12:58,562 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2022-07-13 18:12:58,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:12:58,564 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2022-07-13 18:12:58,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:12:58,565 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2022-07-13 18:12:58,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:12:58,567 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-07-13 18:12:58,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:12:58,570 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2022-07-13 18:12:58,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:12:58,574 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-07-13 18:12:58,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:12:58,577 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 120 [2022-07-13 18:12:58,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:12:58,579 INFO L134 CoverageAnalysis]: Checked inductivity of 83 backedges. 0 proven. 22 refuted. 0 times theorem prover too weak. 61 trivial. 0 not checked. [2022-07-13 18:12:58,580 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 18:12:58,580 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1758355562] [2022-07-13 18:12:58,580 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1758355562] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-13 18:12:58,580 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [293746940] [2022-07-13 18:12:58,580 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 18:12:58,580 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-13 18:12:58,580 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 18:12:58,582 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-13 18:12:58,583 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2022-07-13 18:12:58,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:12:58,648 INFO L263 TraceCheckSpWp]: Trace formula consists of 411 conjuncts, 3 conjunts are in the unsatisfiable core [2022-07-13 18:12:58,652 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 18:12:58,681 INFO L134 CoverageAnalysis]: Checked inductivity of 83 backedges. 75 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2022-07-13 18:12:58,682 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-13 18:12:58,682 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [293746940] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 18:12:58,682 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-07-13 18:12:58,682 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [7] total 8 [2022-07-13 18:12:58,682 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2112743051] [2022-07-13 18:12:58,682 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 18:12:58,683 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-13 18:12:58,683 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 18:12:58,683 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-13 18:12:58,683 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2022-07-13 18:12:58,684 INFO L87 Difference]: Start difference. First operand 3350 states and 4456 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, (11), 3 states have call predecessors, (11), 3 states have return successors, (11), 3 states have call predecessors, (11), 3 states have call successors, (11) [2022-07-13 18:12:58,797 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 18:12:58,797 INFO L93 Difference]: Finished difference Result 5125 states and 6937 transitions. [2022-07-13 18:12:58,798 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-13 18:12:58,798 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, (11), 3 states have call predecessors, (11), 3 states have return successors, (11), 3 states have call predecessors, (11), 3 states have call successors, (11) Word has length 134 [2022-07-13 18:12:58,798 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 18:12:58,810 INFO L225 Difference]: With dead ends: 5125 [2022-07-13 18:12:58,810 INFO L226 Difference]: Without dead ends: 3376 [2022-07-13 18:12:58,814 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 161 GetRequests, 155 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2022-07-13 18:12:58,816 INFO L413 NwaCegarLoop]: 245 mSDtfsCounter, 98 mSDsluCounter, 128 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 98 SdHoareTripleChecker+Valid, 373 SdHoareTripleChecker+Invalid, 10 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-13 18:12:58,817 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [98 Valid, 373 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-13 18:12:58,819 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3376 states. [2022-07-13 18:12:58,937 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3376 to 3334. [2022-07-13 18:12:58,942 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3334 states, 2690 states have (on average 1.3022304832713754) internal successors, (3503), 2734 states have internal predecessors, (3503), 359 states have call successors, (359), 252 states have call predecessors, (359), 284 states have return successors, (508), 355 states have call predecessors, (508), 359 states have call successors, (508) [2022-07-13 18:12:58,951 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3334 states to 3334 states and 4370 transitions. [2022-07-13 18:12:58,952 INFO L78 Accepts]: Start accepts. Automaton has 3334 states and 4370 transitions. Word has length 134 [2022-07-13 18:12:58,953 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 18:12:58,953 INFO L495 AbstractCegarLoop]: Abstraction has 3334 states and 4370 transitions. [2022-07-13 18:12:58,954 INFO L496 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, (11), 3 states have call predecessors, (11), 3 states have return successors, (11), 3 states have call predecessors, (11), 3 states have call successors, (11) [2022-07-13 18:12:58,954 INFO L276 IsEmpty]: Start isEmpty. Operand 3334 states and 4370 transitions. [2022-07-13 18:12:58,959 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2022-07-13 18:12:58,960 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 18:12:58,960 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 18:12:58,980 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2022-07-13 18:12:59,175 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-13 18:12:59,175 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 18:12:59,176 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 18:12:59,176 INFO L85 PathProgramCache]: Analyzing trace with hash -215256625, now seen corresponding path program 1 times [2022-07-13 18:12:59,176 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 18:12:59,176 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1303891417] [2022-07-13 18:12:59,176 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 18:12:59,176 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 18:12:59,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:12:59,188 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-13 18:12:59,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:12:59,194 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-13 18:12:59,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:12:59,199 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-07-13 18:12:59,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:12:59,223 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2022-07-13 18:12:59,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:12:59,226 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2022-07-13 18:12:59,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:12:59,227 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2022-07-13 18:12:59,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:12:59,228 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2022-07-13 18:12:59,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:12:59,231 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-07-13 18:12:59,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:12:59,234 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2022-07-13 18:12:59,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:12:59,237 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-07-13 18:12:59,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:12:59,239 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 120 [2022-07-13 18:12:59,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:12:59,241 INFO L134 CoverageAnalysis]: Checked inductivity of 81 backedges. 0 proven. 20 refuted. 0 times theorem prover too weak. 61 trivial. 0 not checked. [2022-07-13 18:12:59,241 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 18:12:59,241 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1303891417] [2022-07-13 18:12:59,241 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1303891417] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-13 18:12:59,241 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1471733809] [2022-07-13 18:12:59,241 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 18:12:59,242 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-13 18:12:59,242 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 18:12:59,243 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-13 18:12:59,296 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2022-07-13 18:12:59,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:12:59,335 INFO L263 TraceCheckSpWp]: Trace formula consists of 417 conjuncts, 2 conjunts are in the unsatisfiable core [2022-07-13 18:12:59,337 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 18:12:59,361 INFO L134 CoverageAnalysis]: Checked inductivity of 81 backedges. 57 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2022-07-13 18:12:59,361 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-13 18:12:59,361 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1471733809] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 18:12:59,361 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-07-13 18:12:59,361 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [7] total 8 [2022-07-13 18:12:59,362 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1876237754] [2022-07-13 18:12:59,362 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 18:12:59,362 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-13 18:12:59,362 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 18:12:59,362 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-13 18:12:59,363 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2022-07-13 18:12:59,363 INFO L87 Difference]: Start difference. First operand 3334 states and 4370 transitions. Second operand has 3 states, 3 states have (on average 31.0) internal successors, (93), 3 states have internal predecessors, (93), 3 states have call successors, (10), 3 states have call predecessors, (10), 2 states have return successors, (10), 2 states have call predecessors, (10), 3 states have call successors, (10) [2022-07-13 18:12:59,475 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 18:12:59,475 INFO L93 Difference]: Finished difference Result 6834 states and 9069 transitions. [2022-07-13 18:12:59,475 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-13 18:12:59,476 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 31.0) internal successors, (93), 3 states have internal predecessors, (93), 3 states have call successors, (10), 3 states have call predecessors, (10), 2 states have return successors, (10), 2 states have call predecessors, (10), 3 states have call successors, (10) Word has length 134 [2022-07-13 18:12:59,476 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 18:12:59,487 INFO L225 Difference]: With dead ends: 6834 [2022-07-13 18:12:59,487 INFO L226 Difference]: Without dead ends: 3516 [2022-07-13 18:12:59,508 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 161 GetRequests, 155 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2022-07-13 18:12:59,509 INFO L413 NwaCegarLoop]: 142 mSDtfsCounter, 119 mSDsluCounter, 24 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 119 SdHoareTripleChecker+Valid, 166 SdHoareTripleChecker+Invalid, 10 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-13 18:12:59,510 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [119 Valid, 166 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-13 18:12:59,512 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3516 states. [2022-07-13 18:12:59,610 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3516 to 3334. [2022-07-13 18:12:59,614 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3334 states, 2690 states have (on average 1.262081784386617) internal successors, (3395), 2734 states have internal predecessors, (3395), 359 states have call successors, (359), 252 states have call predecessors, (359), 284 states have return successors, (482), 355 states have call predecessors, (482), 359 states have call successors, (482) [2022-07-13 18:12:59,621 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3334 states to 3334 states and 4236 transitions. [2022-07-13 18:12:59,622 INFO L78 Accepts]: Start accepts. Automaton has 3334 states and 4236 transitions. Word has length 134 [2022-07-13 18:12:59,623 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 18:12:59,623 INFO L495 AbstractCegarLoop]: Abstraction has 3334 states and 4236 transitions. [2022-07-13 18:12:59,623 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 31.0) internal successors, (93), 3 states have internal predecessors, (93), 3 states have call successors, (10), 3 states have call predecessors, (10), 2 states have return successors, (10), 2 states have call predecessors, (10), 3 states have call successors, (10) [2022-07-13 18:12:59,623 INFO L276 IsEmpty]: Start isEmpty. Operand 3334 states and 4236 transitions. [2022-07-13 18:12:59,628 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 136 [2022-07-13 18:12:59,628 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 18:12:59,628 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 18:12:59,649 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2022-07-13 18:12:59,846 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2022-07-13 18:12:59,846 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 18:12:59,846 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 18:12:59,847 INFO L85 PathProgramCache]: Analyzing trace with hash -564777140, now seen corresponding path program 1 times [2022-07-13 18:12:59,847 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 18:12:59,847 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [44742943] [2022-07-13 18:12:59,847 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 18:12:59,847 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 18:12:59,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:12:59,861 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-13 18:12:59,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:12:59,867 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-13 18:12:59,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:12:59,872 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-07-13 18:12:59,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:12:59,898 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2022-07-13 18:12:59,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:12:59,900 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2022-07-13 18:12:59,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:12:59,901 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2022-07-13 18:12:59,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:12:59,902 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2022-07-13 18:12:59,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:12:59,905 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-07-13 18:12:59,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:12:59,907 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2022-07-13 18:12:59,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:12:59,909 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-07-13 18:12:59,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:12:59,912 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 121 [2022-07-13 18:12:59,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:12:59,913 INFO L134 CoverageAnalysis]: Checked inductivity of 82 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 61 trivial. 0 not checked. [2022-07-13 18:12:59,913 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 18:12:59,913 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [44742943] [2022-07-13 18:12:59,913 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [44742943] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-13 18:12:59,914 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1413552104] [2022-07-13 18:12:59,914 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 18:12:59,914 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-13 18:12:59,914 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 18:12:59,915 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-13 18:12:59,916 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2022-07-13 18:12:59,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:12:59,976 INFO L263 TraceCheckSpWp]: Trace formula consists of 413 conjuncts, 6 conjunts are in the unsatisfiable core [2022-07-13 18:12:59,978 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 18:13:00,041 INFO L134 CoverageAnalysis]: Checked inductivity of 82 backedges. 26 proven. 0 refuted. 0 times theorem prover too weak. 56 trivial. 0 not checked. [2022-07-13 18:13:00,041 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-13 18:13:00,041 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1413552104] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 18:13:00,041 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-07-13 18:13:00,041 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [7] total 10 [2022-07-13 18:13:00,041 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1525356001] [2022-07-13 18:13:00,041 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 18:13:00,042 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-07-13 18:13:00,042 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 18:13:00,042 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-13 18:13:00,042 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2022-07-13 18:13:00,042 INFO L87 Difference]: Start difference. First operand 3334 states and 4236 transitions. Second operand has 5 states, 5 states have (on average 16.0) internal successors, (80), 4 states have internal predecessors, (80), 2 states have call successors, (8), 3 states have call predecessors, (8), 4 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2022-07-13 18:13:00,236 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 18:13:00,237 INFO L93 Difference]: Finished difference Result 4752 states and 6093 transitions. [2022-07-13 18:13:00,237 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-13 18:13:00,237 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 16.0) internal successors, (80), 4 states have internal predecessors, (80), 2 states have call successors, (8), 3 states have call predecessors, (8), 4 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) Word has length 135 [2022-07-13 18:13:00,237 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 18:13:00,246 INFO L225 Difference]: With dead ends: 4752 [2022-07-13 18:13:00,246 INFO L226 Difference]: Without dead ends: 2682 [2022-07-13 18:13:00,251 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 163 GetRequests, 154 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=22, Invalid=88, Unknown=0, NotChecked=0, Total=110 [2022-07-13 18:13:00,251 INFO L413 NwaCegarLoop]: 120 mSDtfsCounter, 137 mSDsluCounter, 137 mSDsCounter, 0 mSdLazyCounter, 97 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 145 SdHoareTripleChecker+Valid, 257 SdHoareTripleChecker+Invalid, 119 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 97 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-13 18:13:00,252 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [145 Valid, 257 Invalid, 119 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 97 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-13 18:13:00,254 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2682 states. [2022-07-13 18:13:00,367 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2682 to 2658. [2022-07-13 18:13:00,370 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2658 states, 2142 states have (on average 1.2254901960784315) internal successors, (2625), 2168 states have internal predecessors, (2625), 295 states have call successors, (295), 204 states have call predecessors, (295), 220 states have return successors, (354), 289 states have call predecessors, (354), 295 states have call successors, (354) [2022-07-13 18:13:00,377 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2658 states to 2658 states and 3274 transitions. [2022-07-13 18:13:00,378 INFO L78 Accepts]: Start accepts. Automaton has 2658 states and 3274 transitions. Word has length 135 [2022-07-13 18:13:00,378 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 18:13:00,378 INFO L495 AbstractCegarLoop]: Abstraction has 2658 states and 3274 transitions. [2022-07-13 18:13:00,378 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 16.0) internal successors, (80), 4 states have internal predecessors, (80), 2 states have call successors, (8), 3 states have call predecessors, (8), 4 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2022-07-13 18:13:00,378 INFO L276 IsEmpty]: Start isEmpty. Operand 2658 states and 3274 transitions. [2022-07-13 18:13:00,381 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 136 [2022-07-13 18:13:00,381 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 18:13:00,382 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 18:13:00,402 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2022-07-13 18:13:00,595 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-13 18:13:00,596 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 18:13:00,596 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 18:13:00,596 INFO L85 PathProgramCache]: Analyzing trace with hash -1871919538, now seen corresponding path program 1 times [2022-07-13 18:13:00,596 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 18:13:00,596 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [542356935] [2022-07-13 18:13:00,596 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 18:13:00,596 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 18:13:00,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:13:00,607 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-13 18:13:00,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:13:00,612 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-13 18:13:00,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:13:00,616 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-07-13 18:13:00,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:13:00,638 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2022-07-13 18:13:00,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:13:00,641 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2022-07-13 18:13:00,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:13:00,642 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2022-07-13 18:13:00,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:13:00,643 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2022-07-13 18:13:00,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:13:00,645 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-07-13 18:13:00,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:13:00,647 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2022-07-13 18:13:00,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:13:00,649 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-07-13 18:13:00,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:13:00,651 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 121 [2022-07-13 18:13:00,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:13:00,652 INFO L134 CoverageAnalysis]: Checked inductivity of 82 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 61 trivial. 0 not checked. [2022-07-13 18:13:00,652 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 18:13:00,653 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [542356935] [2022-07-13 18:13:00,653 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [542356935] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-13 18:13:00,653 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [138251797] [2022-07-13 18:13:00,653 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 18:13:00,653 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-13 18:13:00,653 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 18:13:00,654 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-13 18:13:00,655 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2022-07-13 18:13:00,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:13:00,715 INFO L263 TraceCheckSpWp]: Trace formula consists of 410 conjuncts, 6 conjunts are in the unsatisfiable core [2022-07-13 18:13:00,723 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 18:13:00,768 INFO L134 CoverageAnalysis]: Checked inductivity of 82 backedges. 26 proven. 0 refuted. 0 times theorem prover too weak. 56 trivial. 0 not checked. [2022-07-13 18:13:00,769 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-13 18:13:00,769 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [138251797] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 18:13:00,769 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-07-13 18:13:00,769 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [7] total 10 [2022-07-13 18:13:00,769 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1373939267] [2022-07-13 18:13:00,769 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 18:13:00,769 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-07-13 18:13:00,769 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 18:13:00,770 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-13 18:13:00,770 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2022-07-13 18:13:00,770 INFO L87 Difference]: Start difference. First operand 2658 states and 3274 transitions. Second operand has 5 states, 5 states have (on average 16.0) internal successors, (80), 4 states have internal predecessors, (80), 2 states have call successors, (8), 3 states have call predecessors, (8), 4 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2022-07-13 18:13:00,969 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 18:13:00,969 INFO L93 Difference]: Finished difference Result 4962 states and 6189 transitions. [2022-07-13 18:13:00,970 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-07-13 18:13:00,970 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 16.0) internal successors, (80), 4 states have internal predecessors, (80), 2 states have call successors, (8), 3 states have call predecessors, (8), 4 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) Word has length 135 [2022-07-13 18:13:00,970 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 18:13:00,978 INFO L225 Difference]: With dead ends: 4962 [2022-07-13 18:13:00,978 INFO L226 Difference]: Without dead ends: 2611 [2022-07-13 18:13:00,982 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 164 GetRequests, 154 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=26, Invalid=106, Unknown=0, NotChecked=0, Total=132 [2022-07-13 18:13:00,983 INFO L413 NwaCegarLoop]: 132 mSDtfsCounter, 158 mSDsluCounter, 132 mSDsCounter, 0 mSdLazyCounter, 147 mSolverCounterSat, 27 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 166 SdHoareTripleChecker+Valid, 264 SdHoareTripleChecker+Invalid, 174 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 27 IncrementalHoareTripleChecker+Valid, 147 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-13 18:13:00,983 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [166 Valid, 264 Invalid, 174 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [27 Valid, 147 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-13 18:13:00,985 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2611 states. [2022-07-13 18:13:01,086 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2611 to 1652. [2022-07-13 18:13:01,088 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1652 states, 1348 states have (on average 1.1802670623145401) internal successors, (1591), 1362 states have internal predecessors, (1591), 173 states have call successors, (173), 122 states have call predecessors, (173), 130 states have return successors, (203), 169 states have call predecessors, (203), 173 states have call successors, (203) [2022-07-13 18:13:01,092 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1652 states to 1652 states and 1967 transitions. [2022-07-13 18:13:01,093 INFO L78 Accepts]: Start accepts. Automaton has 1652 states and 1967 transitions. Word has length 135 [2022-07-13 18:13:01,093 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 18:13:01,093 INFO L495 AbstractCegarLoop]: Abstraction has 1652 states and 1967 transitions. [2022-07-13 18:13:01,093 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 16.0) internal successors, (80), 4 states have internal predecessors, (80), 2 states have call successors, (8), 3 states have call predecessors, (8), 4 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2022-07-13 18:13:01,093 INFO L276 IsEmpty]: Start isEmpty. Operand 1652 states and 1967 transitions. [2022-07-13 18:13:01,095 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 136 [2022-07-13 18:13:01,095 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 18:13:01,095 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 18:13:01,112 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2022-07-13 18:13:01,312 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-13 18:13:01,313 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 18:13:01,313 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 18:13:01,313 INFO L85 PathProgramCache]: Analyzing trace with hash 25577228, now seen corresponding path program 1 times [2022-07-13 18:13:01,313 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 18:13:01,313 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1152605923] [2022-07-13 18:13:01,313 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 18:13:01,313 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 18:13:01,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:13:01,330 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-13 18:13:01,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:13:01,337 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-13 18:13:01,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:13:01,343 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-07-13 18:13:01,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:13:01,369 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2022-07-13 18:13:01,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:13:01,372 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2022-07-13 18:13:01,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:13:01,373 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2022-07-13 18:13:01,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:13:01,375 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2022-07-13 18:13:01,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:13:01,379 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-07-13 18:13:01,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:13:01,381 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2022-07-13 18:13:01,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:13:01,383 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-07-13 18:13:01,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:13:01,388 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 121 [2022-07-13 18:13:01,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:13:01,390 INFO L134 CoverageAnalysis]: Checked inductivity of 82 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 61 trivial. 0 not checked. [2022-07-13 18:13:01,390 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 18:13:01,390 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1152605923] [2022-07-13 18:13:01,390 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1152605923] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-13 18:13:01,390 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [192510302] [2022-07-13 18:13:01,390 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 18:13:01,390 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-13 18:13:01,390 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 18:13:01,391 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-13 18:13:01,392 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2022-07-13 18:13:01,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:13:01,466 INFO L263 TraceCheckSpWp]: Trace formula consists of 407 conjuncts, 7 conjunts are in the unsatisfiable core [2022-07-13 18:13:01,468 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 18:13:01,490 INFO L134 CoverageAnalysis]: Checked inductivity of 82 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 71 trivial. 0 not checked. [2022-07-13 18:13:01,490 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-13 18:13:01,490 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [192510302] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 18:13:01,490 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-07-13 18:13:01,490 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [7] total 7 [2022-07-13 18:13:01,490 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [722908847] [2022-07-13 18:13:01,491 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 18:13:01,491 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-07-13 18:13:01,491 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 18:13:01,491 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-13 18:13:01,491 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-07-13 18:13:01,491 INFO L87 Difference]: Start difference. First operand 1652 states and 1967 transitions. Second operand has 5 states, 5 states have (on average 14.8) internal successors, (74), 5 states have internal predecessors, (74), 2 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2022-07-13 18:13:01,585 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 18:13:01,585 INFO L93 Difference]: Finished difference Result 2779 states and 3331 transitions. [2022-07-13 18:13:01,585 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-07-13 18:13:01,586 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 14.8) internal successors, (74), 5 states have internal predecessors, (74), 2 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) Word has length 135 [2022-07-13 18:13:01,586 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 18:13:01,589 INFO L225 Difference]: With dead ends: 2779 [2022-07-13 18:13:01,589 INFO L226 Difference]: Without dead ends: 1137 [2022-07-13 18:13:01,592 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 164 GetRequests, 155 SyntacticMatches, 2 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2022-07-13 18:13:01,593 INFO L413 NwaCegarLoop]: 132 mSDtfsCounter, 48 mSDsluCounter, 405 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 48 SdHoareTripleChecker+Valid, 537 SdHoareTripleChecker+Invalid, 14 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-13 18:13:01,593 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [48 Valid, 537 Invalid, 14 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-13 18:13:01,594 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1137 states. [2022-07-13 18:13:01,663 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1137 to 1101. [2022-07-13 18:13:01,669 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1101 states, 904 states have (on average 1.1537610619469028) internal successors, (1043), 914 states have internal predecessors, (1043), 110 states have call successors, (110), 79 states have call predecessors, (110), 86 states have return successors, (121), 108 states have call predecessors, (121), 110 states have call successors, (121) [2022-07-13 18:13:01,671 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1101 states to 1101 states and 1274 transitions. [2022-07-13 18:13:01,672 INFO L78 Accepts]: Start accepts. Automaton has 1101 states and 1274 transitions. Word has length 135 [2022-07-13 18:13:01,672 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 18:13:01,672 INFO L495 AbstractCegarLoop]: Abstraction has 1101 states and 1274 transitions. [2022-07-13 18:13:01,673 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 14.8) internal successors, (74), 5 states have internal predecessors, (74), 2 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2022-07-13 18:13:01,673 INFO L276 IsEmpty]: Start isEmpty. Operand 1101 states and 1274 transitions. [2022-07-13 18:13:01,674 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 136 [2022-07-13 18:13:01,674 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 18:13:01,674 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 18:13:01,695 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2022-07-13 18:13:01,895 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2022-07-13 18:13:01,895 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 18:13:01,896 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 18:13:01,896 INFO L85 PathProgramCache]: Analyzing trace with hash 537608328, now seen corresponding path program 1 times [2022-07-13 18:13:01,896 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 18:13:01,896 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [254060058] [2022-07-13 18:13:01,896 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 18:13:01,896 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 18:13:01,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:13:01,912 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-13 18:13:01,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:13:01,917 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-13 18:13:01,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:13:01,922 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-07-13 18:13:01,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:13:01,947 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2022-07-13 18:13:01,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:13:01,949 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2022-07-13 18:13:01,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:13:01,960 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2022-07-13 18:13:01,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:13:01,961 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2022-07-13 18:13:01,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:13:01,964 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-07-13 18:13:01,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:13:01,966 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2022-07-13 18:13:01,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:13:01,968 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-07-13 18:13:01,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:13:01,970 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 121 [2022-07-13 18:13:01,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:13:01,971 INFO L134 CoverageAnalysis]: Checked inductivity of 82 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 72 trivial. 0 not checked. [2022-07-13 18:13:01,971 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 18:13:01,972 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [254060058] [2022-07-13 18:13:01,972 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [254060058] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-13 18:13:01,972 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1385358483] [2022-07-13 18:13:01,972 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 18:13:01,972 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-13 18:13:01,972 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 18:13:01,976 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-13 18:13:01,977 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2022-07-13 18:13:02,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:13:02,039 INFO L263 TraceCheckSpWp]: Trace formula consists of 405 conjuncts, 7 conjunts are in the unsatisfiable core [2022-07-13 18:13:02,042 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 18:13:02,060 INFO L134 CoverageAnalysis]: Checked inductivity of 82 backedges. 22 proven. 0 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2022-07-13 18:13:02,061 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-13 18:13:02,061 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1385358483] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 18:13:02,061 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-07-13 18:13:02,061 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [7] total 7 [2022-07-13 18:13:02,061 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1997557635] [2022-07-13 18:13:02,061 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 18:13:02,061 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-07-13 18:13:02,062 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 18:13:02,062 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-13 18:13:02,062 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-07-13 18:13:02,062 INFO L87 Difference]: Start difference. First operand 1101 states and 1274 transitions. Second operand has 5 states, 5 states have (on average 16.0) internal successors, (80), 5 states have internal predecessors, (80), 2 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2022-07-13 18:13:02,142 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 18:13:02,142 INFO L93 Difference]: Finished difference Result 2220 states and 2613 transitions. [2022-07-13 18:13:02,142 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-07-13 18:13:02,143 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 16.0) internal successors, (80), 5 states have internal predecessors, (80), 2 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) Word has length 135 [2022-07-13 18:13:02,143 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 18:13:02,146 INFO L225 Difference]: With dead ends: 2220 [2022-07-13 18:13:02,146 INFO L226 Difference]: Without dead ends: 1129 [2022-07-13 18:13:02,147 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 164 GetRequests, 155 SyntacticMatches, 2 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2022-07-13 18:13:02,148 INFO L413 NwaCegarLoop]: 131 mSDtfsCounter, 10 mSDsluCounter, 392 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 523 SdHoareTripleChecker+Invalid, 14 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-13 18:13:02,148 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [10 Valid, 523 Invalid, 14 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-13 18:13:02,149 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1129 states. [2022-07-13 18:13:02,203 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1129 to 1113. [2022-07-13 18:13:02,205 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1113 states, 916 states have (on average 1.1288209606986899) internal successors, (1034), 926 states have internal predecessors, (1034), 110 states have call successors, (110), 79 states have call predecessors, (110), 86 states have return successors, (121), 108 states have call predecessors, (121), 110 states have call successors, (121) [2022-07-13 18:13:02,206 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1113 states to 1113 states and 1265 transitions. [2022-07-13 18:13:02,207 INFO L78 Accepts]: Start accepts. Automaton has 1113 states and 1265 transitions. Word has length 135 [2022-07-13 18:13:02,207 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 18:13:02,207 INFO L495 AbstractCegarLoop]: Abstraction has 1113 states and 1265 transitions. [2022-07-13 18:13:02,207 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 16.0) internal successors, (80), 5 states have internal predecessors, (80), 2 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2022-07-13 18:13:02,207 INFO L276 IsEmpty]: Start isEmpty. Operand 1113 states and 1265 transitions. [2022-07-13 18:13:02,208 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 136 [2022-07-13 18:13:02,209 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 18:13:02,209 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 18:13:02,233 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2022-07-13 18:13:02,423 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13 [2022-07-13 18:13:02,423 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 18:13:02,424 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 18:13:02,424 INFO L85 PathProgramCache]: Analyzing trace with hash -219686780, now seen corresponding path program 1 times [2022-07-13 18:13:02,424 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 18:13:02,424 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [151704662] [2022-07-13 18:13:02,424 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 18:13:02,424 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 18:13:02,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:13:02,466 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-13 18:13:02,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:13:02,473 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-13 18:13:02,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:13:02,479 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-07-13 18:13:02,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:13:02,481 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2022-07-13 18:13:02,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:13:02,484 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2022-07-13 18:13:02,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:13:02,485 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2022-07-13 18:13:02,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:13:02,486 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2022-07-13 18:13:02,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:13:02,490 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-07-13 18:13:02,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:13:02,493 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2022-07-13 18:13:02,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:13:02,496 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-07-13 18:13:02,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:13:02,497 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 121 [2022-07-13 18:13:02,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:13:02,508 INFO L134 CoverageAnalysis]: Checked inductivity of 82 backedges. 19 proven. 0 refuted. 0 times theorem prover too weak. 63 trivial. 0 not checked. [2022-07-13 18:13:02,509 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 18:13:02,509 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [151704662] [2022-07-13 18:13:02,509 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [151704662] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 18:13:02,509 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 18:13:02,509 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-13 18:13:02,509 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1023718165] [2022-07-13 18:13:02,509 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 18:13:02,510 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-13 18:13:02,510 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 18:13:02,510 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-13 18:13:02,511 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-13 18:13:02,511 INFO L87 Difference]: Start difference. First operand 1113 states and 1265 transitions. Second operand has 6 states, 6 states have (on average 13.333333333333334) internal successors, (80), 4 states have internal predecessors, (80), 4 states have call successors, (9), 3 states have call predecessors, (9), 1 states have return successors, (9), 3 states have call predecessors, (9), 4 states have call successors, (9) [2022-07-13 18:13:02,935 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 18:13:02,935 INFO L93 Difference]: Finished difference Result 2070 states and 2337 transitions. [2022-07-13 18:13:02,935 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-07-13 18:13:02,936 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 13.333333333333334) internal successors, (80), 4 states have internal predecessors, (80), 4 states have call successors, (9), 3 states have call predecessors, (9), 1 states have return successors, (9), 3 states have call predecessors, (9), 4 states have call successors, (9) Word has length 135 [2022-07-13 18:13:02,936 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 18:13:02,948 INFO L225 Difference]: With dead ends: 2070 [2022-07-13 18:13:02,948 INFO L226 Difference]: Without dead ends: 2068 [2022-07-13 18:13:02,950 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=45, Invalid=111, Unknown=0, NotChecked=0, Total=156 [2022-07-13 18:13:02,951 INFO L413 NwaCegarLoop]: 202 mSDtfsCounter, 470 mSDsluCounter, 272 mSDsCounter, 0 mSdLazyCounter, 338 mSolverCounterSat, 87 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 493 SdHoareTripleChecker+Valid, 474 SdHoareTripleChecker+Invalid, 425 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 87 IncrementalHoareTripleChecker+Valid, 338 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-07-13 18:13:02,951 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [493 Valid, 474 Invalid, 425 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [87 Valid, 338 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-07-13 18:13:02,953 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2068 states. [2022-07-13 18:13:03,039 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2068 to 1489. [2022-07-13 18:13:03,041 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1489 states, 1226 states have (on average 1.1305057096247961) internal successors, (1386), 1240 states have internal predecessors, (1386), 144 states have call successors, (144), 103 states have call predecessors, (144), 118 states have return successors, (163), 146 states have call predecessors, (163), 144 states have call successors, (163) [2022-07-13 18:13:03,043 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1489 states to 1489 states and 1693 transitions. [2022-07-13 18:13:03,044 INFO L78 Accepts]: Start accepts. Automaton has 1489 states and 1693 transitions. Word has length 135 [2022-07-13 18:13:03,044 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 18:13:03,044 INFO L495 AbstractCegarLoop]: Abstraction has 1489 states and 1693 transitions. [2022-07-13 18:13:03,044 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 13.333333333333334) internal successors, (80), 4 states have internal predecessors, (80), 4 states have call successors, (9), 3 states have call predecessors, (9), 1 states have return successors, (9), 3 states have call predecessors, (9), 4 states have call successors, (9) [2022-07-13 18:13:03,044 INFO L276 IsEmpty]: Start isEmpty. Operand 1489 states and 1693 transitions. [2022-07-13 18:13:03,047 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 175 [2022-07-13 18:13:03,047 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 18:13:03,047 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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] [2022-07-13 18:13:03,047 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2022-07-13 18:13:03,047 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 18:13:03,047 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 18:13:03,047 INFO L85 PathProgramCache]: Analyzing trace with hash -1479334343, now seen corresponding path program 2 times [2022-07-13 18:13:03,047 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 18:13:03,047 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1526692434] [2022-07-13 18:13:03,047 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 18:13:03,048 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 18:13:03,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:13:03,074 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-13 18:13:03,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:13:03,080 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-13 18:13:03,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:13:03,085 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-07-13 18:13:03,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:13:03,087 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2022-07-13 18:13:03,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:13:03,088 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2022-07-13 18:13:03,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:13:03,092 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2022-07-13 18:13:03,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:13:03,093 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2022-07-13 18:13:03,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:13:03,095 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-07-13 18:13:03,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:13:03,096 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2022-07-13 18:13:03,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:13:03,098 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-07-13 18:13:03,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:13:03,100 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 121 [2022-07-13 18:13:03,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:13:03,101 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 136 [2022-07-13 18:13:03,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:13:03,103 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-07-13 18:13:03,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:13:03,105 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 160 [2022-07-13 18:13:03,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:13:03,106 INFO L134 CoverageAnalysis]: Checked inductivity of 178 backedges. 48 proven. 0 refuted. 0 times theorem prover too weak. 130 trivial. 0 not checked. [2022-07-13 18:13:03,106 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 18:13:03,106 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1526692434] [2022-07-13 18:13:03,106 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1526692434] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 18:13:03,106 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 18:13:03,107 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-13 18:13:03,107 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [324907283] [2022-07-13 18:13:03,107 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 18:13:03,107 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-13 18:13:03,107 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 18:13:03,108 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-13 18:13:03,108 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-13 18:13:03,108 INFO L87 Difference]: Start difference. First operand 1489 states and 1693 transitions. Second operand has 6 states, 6 states have (on average 15.166666666666666) internal successors, (91), 4 states have internal predecessors, (91), 5 states have call successors, (11), 3 states have call predecessors, (11), 1 states have return successors, (11), 4 states have call predecessors, (11), 5 states have call successors, (11) [2022-07-13 18:13:03,549 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 18:13:03,549 INFO L93 Difference]: Finished difference Result 3212 states and 3666 transitions. [2022-07-13 18:13:03,549 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2022-07-13 18:13:03,549 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 15.166666666666666) internal successors, (91), 4 states have internal predecessors, (91), 5 states have call successors, (11), 3 states have call predecessors, (11), 1 states have return successors, (11), 4 states have call predecessors, (11), 5 states have call successors, (11) Word has length 174 [2022-07-13 18:13:03,550 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 18:13:03,550 INFO L225 Difference]: With dead ends: 3212 [2022-07-13 18:13:03,550 INFO L226 Difference]: Without dead ends: 0 [2022-07-13 18:13:03,555 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 36 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 52 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=81, Invalid=191, Unknown=0, NotChecked=0, Total=272 [2022-07-13 18:13:03,555 INFO L413 NwaCegarLoop]: 162 mSDtfsCounter, 582 mSDsluCounter, 256 mSDsCounter, 0 mSdLazyCounter, 380 mSolverCounterSat, 165 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 597 SdHoareTripleChecker+Valid, 418 SdHoareTripleChecker+Invalid, 545 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 165 IncrementalHoareTripleChecker+Valid, 380 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-07-13 18:13:03,556 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [597 Valid, 418 Invalid, 545 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [165 Valid, 380 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-07-13 18:13:03,557 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2022-07-13 18:13:03,557 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2022-07-13 18:13:03,557 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 18:13:03,557 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2022-07-13 18:13:03,557 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 174 [2022-07-13 18:13:03,558 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 18:13:03,558 INFO L495 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-07-13 18:13:03,558 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 15.166666666666666) internal successors, (91), 4 states have internal predecessors, (91), 5 states have call successors, (11), 3 states have call predecessors, (11), 1 states have return successors, (11), 4 states have call predecessors, (11), 5 states have call successors, (11) [2022-07-13 18:13:03,558 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-07-13 18:13:03,558 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-07-13 18:13:03,560 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2022-07-13 18:13:03,561 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2022-07-13 18:13:03,562 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2022-07-13 18:13:15,289 INFO L899 garLoopResultBuilder]: For program point L124(lines 124 133) no Hoare annotation was computed. [2022-07-13 18:13:15,290 INFO L895 garLoopResultBuilder]: At program point L155(lines 139 157) the Hoare annotation is: (let ((.cse20 (<= |activate_threads_is_transmit1_triggered_#res#1| 0)) (.cse22 (<= |activate_threads_is_transmit1_triggered_~__retres1~1#1| 0)) (.cse23 (<= 0 |activate_threads_is_transmit1_triggered_#res#1|)) (.cse24 (<= 0 |activate_threads_is_transmit1_triggered_~__retres1~1#1|)) (.cse17 (= |old(~t1_st~0)| ~t1_st~0)) (.cse19 (= ~m_st~0 |old(~m_st~0)|)) (.cse25 (<= 0 |activate_threads_is_master_triggered_#res#1|)) (.cse26 (<= |activate_threads_is_master_triggered_#res#1| 0)) (.cse18 (< 0 (+ |activate_threads_~tmp~1#1| 1))) (.cse27 (<= 0 |activate_threads_is_master_triggered_~__retres1~0#1|)) (.cse21 (<= |activate_threads_~tmp~1#1| 0)) (.cse28 (<= |activate_threads_is_master_triggered_~__retres1~0#1| 0))) (let ((.cse9 (and .cse25 .cse26 .cse18 (<= 2 ~m_st~0) .cse27 .cse21 .cse28)) (.cse12 (not (= |old(~m_st~0)| 0))) (.cse14 (not (< ~local~0 ~token~0))) (.cse16 (not (<= ~token~0 (+ ~local~0 1)))) (.cse8 (not (<= 2 |old(~m_st~0)|))) (.cse10 (not (<= 2 ~E_1~0))) (.cse1 (not (= ~t1_pc~0 1))) (.cse3 (= |old(~t1_st~0)| 0)) (.cse15 (not (<= 1 ~m_pc~0))) (.cse6 (and .cse25 .cse26 .cse17 .cse18 .cse19 .cse27 .cse21 .cse28)) (.cse0 (not (<= 2 ~T1_E~0))) (.cse11 (not (<= ~t1_pc~0 0))) (.cse2 (not (= ~m_pc~0 0))) (.cse4 (not (<= 2 ~E_M~0))) (.cse13 (and .cse25 .cse26 .cse17 .cse18 .cse19 .cse27 .cse20 .cse21 .cse22 .cse28 .cse23 .cse24)) (.cse5 (= ~E_1~0 0)) (.cse7 (not (= ~token~0 ~local~0)))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7) (or .cse8 .cse0 .cse1 .cse2 .cse9 .cse10) (or .cse8 .cse0 .cse11 .cse2 .cse4 .cse9 .cse10) (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse12 .cse13 .cse10) (or .cse0 .cse1 .cse3 .cse4 .cse14 .cse15 .cse12 .cse13 .cse10 .cse16) (or (and .cse17 .cse18 .cse19 .cse20 .cse21 .cse22 .cse23 .cse24) (and (= ~m_st~0 0) .cse20 .cse22 (not (= ~t1_st~0 0)) .cse23 .cse24) .cse8 .cse0 .cse1 .cse3 .cse14 .cse15 .cse10 .cse16) (or .cse8 .cse0 .cse11 .cse4 .cse15 .cse13 .cse10 .cse7) (or .cse8 .cse0 .cse1 .cse4 .cse15 .cse13 .cse10 .cse7) (or .cse8 .cse0 .cse1 .cse3 .cse4 .cse15 .cse13 .cse10) (or .cse0 .cse1 .cse3 .cse4 .cse15 .cse5 .cse6 .cse7) (or .cse0 .cse11 .cse2 .cse4 .cse13 .cse5 .cse7)))) [2022-07-13 18:13:15,290 INFO L899 garLoopResultBuilder]: For program point L124-2(lines 124 133) no Hoare annotation was computed. [2022-07-13 18:13:15,290 INFO L899 garLoopResultBuilder]: For program point L143(lines 143 152) no Hoare annotation was computed. [2022-07-13 18:13:15,290 INFO L899 garLoopResultBuilder]: For program point L143-2(lines 143 152) no Hoare annotation was computed. [2022-07-13 18:13:15,290 INFO L895 garLoopResultBuilder]: At program point L135(lines 123 137) the Hoare annotation is: (let ((.cse15 (= |old(~t1_st~0)| ~t1_st~0)) (.cse16 (= ~m_st~0 |old(~m_st~0)|))) (let ((.cse9 (not (= |old(~m_st~0)| 0))) (.cse2 (not (<= ~t1_pc~0 0))) (.cse14 (= ~E_1~0 0)) (.cse11 (not (= ~token~0 ~local~0))) (.cse4 (not (<= 2 ~E_M~0))) (.cse3 (not (= ~m_pc~0 0))) (.cse5 (and .cse15 .cse16 (<= 0 |activate_threads_is_master_triggered_~__retres1~0#1|) (<= |activate_threads_is_master_triggered_~__retres1~0#1| 0))) (.cse0 (not (<= 2 |old(~m_st~0)|))) (.cse1 (not (<= 2 ~T1_E~0))) (.cse7 (not (= ~t1_pc~0 1))) (.cse8 (= |old(~t1_st~0)| 0)) (.cse12 (not (< ~local~0 ~token~0))) (.cse10 (not (<= 1 ~m_pc~0))) (.cse6 (not (<= 2 ~E_1~0))) (.cse13 (not (<= ~token~0 (+ ~local~0 1))))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6) (or .cse1 .cse7 .cse3 .cse8 .cse4 .cse5 .cse9 .cse6) (or .cse0 .cse1 .cse7 .cse4 .cse5 .cse10 .cse6 .cse11) (or .cse0 .cse1 .cse2 .cse4 .cse5 .cse10 .cse6 .cse11) (or .cse1 .cse7 .cse8 .cse4 .cse12 .cse5 .cse10 .cse9 .cse6 .cse13) (or .cse1 .cse7 .cse8 .cse4 .cse5 .cse10 .cse14 .cse11) (or .cse1 .cse2 .cse3 .cse4 .cse5 .cse14 .cse11) (or .cse1 .cse7 .cse3 .cse8 .cse4 .cse5 .cse14 .cse11) (or .cse0 .cse1 .cse7 .cse8 .cse4 .cse5 .cse10 .cse6) (or .cse0 .cse1 .cse7 .cse3 .cse5 .cse6) (or .cse0 .cse1 (and .cse15 .cse16) .cse7 .cse8 .cse12 .cse10 .cse6 .cse13)))) [2022-07-13 18:13:15,290 INFO L899 garLoopResultBuilder]: For program point L327(lines 327 331) no Hoare annotation was computed. [2022-07-13 18:13:15,290 INFO L899 garLoopResultBuilder]: For program point L327-2(lines 311 335) no Hoare annotation was computed. [2022-07-13 18:13:15,291 INFO L899 garLoopResultBuilder]: For program point L319(lines 319 323) no Hoare annotation was computed. [2022-07-13 18:13:15,291 INFO L899 garLoopResultBuilder]: For program point L125(lines 125 130) no Hoare annotation was computed. [2022-07-13 18:13:15,291 INFO L899 garLoopResultBuilder]: For program point L319-2(lines 319 323) no Hoare annotation was computed. [2022-07-13 18:13:15,291 INFO L895 garLoopResultBuilder]: At program point L154(lines 142 156) the Hoare annotation is: (let ((.cse17 (= |old(~t1_st~0)| ~t1_st~0)) (.cse19 (= ~m_st~0 |old(~m_st~0)|)) (.cse21 (<= |activate_threads_is_transmit1_triggered_~__retres1~1#1| 0)) (.cse22 (<= 0 |activate_threads_is_transmit1_triggered_~__retres1~1#1|)) (.cse23 (<= 0 |activate_threads_is_master_triggered_#res#1|)) (.cse24 (<= |activate_threads_is_master_triggered_#res#1| 0)) (.cse18 (< 0 (+ |activate_threads_~tmp~1#1| 1))) (.cse25 (<= 0 |activate_threads_is_master_triggered_~__retres1~0#1|)) (.cse20 (<= |activate_threads_~tmp~1#1| 0)) (.cse26 (<= |activate_threads_is_master_triggered_~__retres1~0#1| 0))) (let ((.cse16 (and .cse23 .cse24 .cse18 (<= 2 ~m_st~0) .cse25 .cse20 .cse26)) (.cse5 (not (< ~local~0 ~token~0))) (.cse9 (not (<= ~token~0 (+ ~local~0 1)))) (.cse7 (not (= |old(~m_st~0)| 0))) (.cse15 (not (<= ~t1_pc~0 0))) (.cse10 (not (= ~m_pc~0 0))) (.cse0 (and .cse23 .cse24 .cse17 .cse18 .cse19 .cse25 .cse20 .cse21 .cse26 .cse22)) (.cse14 (not (<= 2 |old(~m_st~0)|))) (.cse8 (not (<= 2 ~E_1~0))) (.cse1 (not (<= 2 ~T1_E~0))) (.cse2 (not (= ~t1_pc~0 1))) (.cse3 (= |old(~t1_st~0)| 0)) (.cse4 (not (<= 2 ~E_M~0))) (.cse6 (not (<= 1 ~m_pc~0))) (.cse11 (= ~E_1~0 0)) (.cse12 (and .cse23 .cse24 .cse17 .cse18 .cse19 .cse25 .cse20 .cse26)) (.cse13 (not (= ~token~0 ~local~0)))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9) (or .cse1 .cse2 .cse10 .cse3 .cse4 .cse11 .cse12 .cse13) (or .cse0 .cse14 .cse1 .cse15 .cse4 .cse6 .cse8 .cse13) (or .cse14 .cse1 .cse2 .cse10 .cse16 .cse8) (or .cse14 .cse1 .cse15 .cse10 .cse4 .cse16 .cse8) (or (and .cse17 .cse18 .cse19 .cse20 .cse21 .cse22) .cse14 .cse1 .cse2 .cse3 .cse5 .cse6 (and (= ~m_st~0 0) .cse21 (not (= ~t1_st~0 0)) .cse22) .cse8 .cse9) (or .cse0 .cse1 .cse2 .cse10 .cse3 .cse4 .cse7 .cse8) (or .cse0 .cse1 .cse15 .cse10 .cse4 .cse11 .cse13) (or .cse0 .cse14 .cse1 .cse2 .cse3 .cse4 .cse6 .cse8) (or .cse0 .cse14 .cse1 .cse2 .cse4 .cse6 .cse8 .cse13) (or .cse1 .cse2 .cse3 .cse4 .cse6 .cse11 .cse12 .cse13)))) [2022-07-13 18:13:15,291 INFO L899 garLoopResultBuilder]: For program point L144(lines 144 149) no Hoare annotation was computed. [2022-07-13 18:13:15,291 INFO L895 garLoopResultBuilder]: At program point activate_threadsENTRY(lines 311 335) the Hoare annotation is: (let ((.cse13 (not (= |old(~m_st~0)| 0))) (.cse3 (not (<= ~t1_pc~0 0))) (.cse10 (not (= ~m_pc~0 0))) (.cse4 (not (<= 2 ~E_M~0))) (.cse11 (= ~E_1~0 0)) (.cse7 (not (= ~token~0 ~local~0))) (.cse0 (not (<= 2 |old(~m_st~0)|))) (.cse1 (not (<= 2 ~T1_E~0))) (.cse2 (and (= |old(~t1_st~0)| ~t1_st~0) (= ~m_st~0 |old(~m_st~0)|))) (.cse8 (not (= ~t1_pc~0 1))) (.cse9 (= |old(~t1_st~0)| 0)) (.cse12 (not (< ~local~0 ~token~0))) (.cse5 (not (<= 1 ~m_pc~0))) (.cse6 (not (<= 2 ~E_1~0))) (.cse14 (not (<= ~token~0 (+ ~local~0 1))))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7) (or .cse0 .cse1 .cse2 .cse8 .cse9 .cse4 .cse5 .cse6) (or .cse0 .cse1 .cse2 .cse8 .cse4 .cse5 .cse6 .cse7) (or .cse0 .cse1 .cse2 .cse8 .cse10 .cse6) (or .cse1 .cse2 .cse8 .cse9 .cse4 .cse5 .cse11 .cse7) (or .cse1 .cse2 .cse8 .cse10 .cse9 .cse4 .cse11 .cse7) (or .cse1 .cse2 .cse8 .cse9 .cse4 .cse12 .cse5 .cse13 .cse6 .cse14) (or .cse1 .cse2 .cse8 .cse10 .cse9 .cse4 .cse13 .cse6) (or .cse0 .cse1 .cse2 .cse3 .cse10 .cse4 .cse6) (or .cse1 .cse2 .cse3 .cse10 .cse4 .cse11 .cse7) (or .cse0 .cse1 .cse2 .cse8 .cse9 .cse12 .cse5 .cse6 .cse14))) [2022-07-13 18:13:15,291 INFO L899 garLoopResultBuilder]: For program point activate_threadsEXIT(lines 311 335) no Hoare annotation was computed. [2022-07-13 18:13:15,291 INFO L895 garLoopResultBuilder]: At program point L136(lines 120 138) the Hoare annotation is: (let ((.cse15 (= |old(~t1_st~0)| ~t1_st~0)) (.cse16 (= ~m_st~0 |old(~m_st~0)|))) (let ((.cse9 (not (= |old(~m_st~0)| 0))) (.cse4 (= ~E_1~0 0)) (.cse5 (not (= ~token~0 ~local~0))) (.cse7 (not (= ~t1_pc~0 1))) (.cse8 (= |old(~t1_st~0)| 0)) (.cse13 (not (< ~local~0 ~token~0))) (.cse12 (not (<= 1 ~m_pc~0))) (.cse14 (not (<= ~token~0 (+ ~local~0 1)))) (.cse11 (not (<= 2 |old(~m_st~0)|))) (.cse0 (not (<= 2 ~T1_E~0))) (.cse1 (not (<= ~t1_pc~0 0))) (.cse2 (not (= ~m_pc~0 0))) (.cse3 (not (<= 2 ~E_M~0))) (.cse10 (not (<= 2 ~E_1~0))) (.cse6 (and (<= 0 |activate_threads_is_master_triggered_#res#1|) (<= |activate_threads_is_master_triggered_#res#1| 0) .cse15 .cse16 (<= 0 |activate_threads_is_master_triggered_~__retres1~0#1|) (<= |activate_threads_is_master_triggered_~__retres1~0#1| 0)))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6) (or .cse0 .cse7 .cse2 .cse8 .cse3 .cse9 .cse10 .cse6) (or .cse11 .cse0 .cse1 .cse3 .cse12 .cse10 .cse5 .cse6) (or .cse0 .cse7 .cse8 .cse3 .cse13 .cse12 .cse9 .cse10 .cse14 .cse6) (or .cse11 .cse0 .cse7 .cse8 .cse3 .cse12 .cse10 .cse6) (or .cse11 .cse0 .cse7 .cse3 .cse12 .cse10 .cse5 .cse6) (or .cse0 .cse7 .cse2 .cse8 .cse3 .cse4 .cse5 .cse6) (or .cse0 .cse7 .cse8 .cse3 .cse12 .cse4 .cse5 .cse6) (or .cse11 .cse0 .cse7 .cse2 .cse10 .cse6) (or .cse11 .cse0 (and .cse15 .cse16) .cse7 .cse8 .cse13 .cse12 .cse10 .cse14) (or .cse11 .cse0 .cse1 .cse2 .cse3 .cse10 .cse6)))) [2022-07-13 18:13:15,291 INFO L899 garLoopResultBuilder]: For program point immediate_notifyEXIT(lines 336 346) no Hoare annotation was computed. [2022-07-13 18:13:15,291 INFO L895 garLoopResultBuilder]: At program point immediate_notifyENTRY(lines 336 346) the Hoare annotation is: (let ((.cse4 (not (= ~m_pc~0 0))) (.cse7 (not (<= 2 ~E_M~0))) (.cse9 (= ~E_1~0 0)) (.cse10 (not (= ~token~0 ~local~0))) (.cse0 (not (<= 2 |old(~m_st~0)|))) (.cse1 (not (<= 2 ~T1_E~0))) (.cse2 (and (= |old(~t1_st~0)| ~t1_st~0) (= ~m_st~0 |old(~m_st~0)|))) (.cse3 (not (= ~t1_pc~0 1))) (.cse6 (= |old(~t1_st~0)| 0)) (.cse8 (not (<= 1 ~m_pc~0))) (.cse5 (not (<= 2 ~E_1~0)))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5) (or .cse1 .cse2 .cse3 .cse6 .cse7 .cse8 .cse9 .cse10) (or .cse1 .cse2 .cse3 .cse4 .cse6 .cse7 .cse9 .cse10) (or .cse1 .cse2 (not (<= ~t1_pc~0 0)) .cse4 .cse7 .cse9 .cse10) (or .cse0 .cse1 .cse2 .cse3 .cse6 (not (< ~local~0 ~token~0)) .cse8 .cse5 (not (<= ~token~0 (+ ~local~0 1)))))) [2022-07-13 18:13:15,291 INFO L899 garLoopResultBuilder]: For program point immediate_notifyFINAL(lines 336 346) no Hoare annotation was computed. [2022-07-13 18:13:15,292 INFO L899 garLoopResultBuilder]: For program point L192(lines 192 197) no Hoare annotation was computed. [2022-07-13 18:13:15,292 INFO L899 garLoopResultBuilder]: For program point exists_runnable_threadEXIT(lines 184 203) no Hoare annotation was computed. [2022-07-13 18:13:15,292 INFO L899 garLoopResultBuilder]: For program point L188(lines 188 198) no Hoare annotation was computed. [2022-07-13 18:13:15,292 INFO L902 garLoopResultBuilder]: At program point exists_runnable_threadENTRY(lines 184 203) the Hoare annotation is: true [2022-07-13 18:13:15,292 INFO L902 garLoopResultBuilder]: At program point L200(lines 187 202) the Hoare annotation is: true [2022-07-13 18:13:15,292 INFO L899 garLoopResultBuilder]: For program point exists_runnable_threadFINAL(lines 184 203) no Hoare annotation was computed. [2022-07-13 18:13:15,292 INFO L895 garLoopResultBuilder]: At program point fire_delta_eventsENTRY(lines 255 282) the Hoare annotation is: (let ((.cse1 (not (<= ~t1_pc~0 0))) (.cse8 (not (= ~token~0 ~local~0))) (.cse7 (not (= ~m_st~0 0))) (.cse11 (= ~t1_st~0 0)) (.cse10 (not (<= 1 ~m_pc~0))) (.cse0 (not (<= 2 ~m_st~0))) (.cse9 (not (= ~t1_pc~0 1))) (.cse2 (not (= ~m_pc~0 0))) (.cse3 (not (<= 2 |old(~T1_E~0)|))) (.cse4 (not (<= 2 |old(~E_1~0)|))) (.cse5 (and (= ~M_E~0 |old(~M_E~0)|) (= |old(~T1_E~0)| ~T1_E~0) (= ~E_M~0 |old(~E_M~0)|) (= ~E_1~0 |old(~E_1~0)|))) (.cse6 (not (<= 2 |old(~E_M~0)|)))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6) (or .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8) (or .cse0 .cse9 .cse3 .cse4 .cse5 .cse6 .cse10 .cse8) (or .cse9 .cse3 .cse11 .cse4 .cse5 (not (< ~local~0 ~token~0)) .cse6 .cse10 .cse7 (not (<= ~token~0 (+ ~local~0 1)))) (or .cse0 .cse1 .cse3 .cse4 .cse5 .cse6 .cse10 .cse8) (or .cse9 .cse2 .cse3 .cse11 .cse4 .cse5 .cse6 .cse7) (or .cse0 .cse9 .cse3 .cse11 .cse4 .cse5 .cse6 .cse10) (or .cse0 .cse9 .cse2 .cse3 .cse4 .cse5 .cse6))) [2022-07-13 18:13:15,292 INFO L899 garLoopResultBuilder]: For program point fire_delta_eventsEXIT(lines 255 282) no Hoare annotation was computed. [2022-07-13 18:13:15,292 INFO L899 garLoopResultBuilder]: For program point L274-1(lines 255 282) no Hoare annotation was computed. [2022-07-13 18:13:15,293 INFO L899 garLoopResultBuilder]: For program point L269-1(lines 258 281) no Hoare annotation was computed. [2022-07-13 18:13:15,293 INFO L899 garLoopResultBuilder]: For program point L264-1(lines 258 281) no Hoare annotation was computed. [2022-07-13 18:13:15,293 INFO L899 garLoopResultBuilder]: For program point L259-1(lines 258 281) no Hoare annotation was computed. [2022-07-13 18:13:15,293 INFO L899 garLoopResultBuilder]: For program point update_channelsEXIT(lines 158 165) no Hoare annotation was computed. [2022-07-13 18:13:15,293 INFO L902 garLoopResultBuilder]: At program point update_channelsFINAL(lines 158 165) the Hoare annotation is: true [2022-07-13 18:13:15,293 INFO L899 garLoopResultBuilder]: For program point L287-1(lines 286 309) no Hoare annotation was computed. [2022-07-13 18:13:15,293 INFO L895 garLoopResultBuilder]: At program point reset_delta_eventsENTRY(lines 283 310) the Hoare annotation is: (let ((.cse1 (not (<= ~t1_pc~0 0))) (.cse8 (not (= ~token~0 ~local~0))) (.cse7 (not (= ~m_st~0 0))) (.cse11 (= ~t1_st~0 0)) (.cse10 (not (<= 1 ~m_pc~0))) (.cse0 (not (<= 2 ~m_st~0))) (.cse9 (not (= ~t1_pc~0 1))) (.cse2 (not (= ~m_pc~0 0))) (.cse3 (not (<= 2 |old(~T1_E~0)|))) (.cse4 (not (<= 2 |old(~E_1~0)|))) (.cse5 (and (= ~M_E~0 |old(~M_E~0)|) (= |old(~T1_E~0)| ~T1_E~0) (= ~E_M~0 |old(~E_M~0)|) (= ~E_1~0 |old(~E_1~0)|))) (.cse6 (not (<= 2 |old(~E_M~0)|)))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6) (or .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8) (or .cse0 .cse9 .cse3 .cse4 .cse5 .cse6 .cse10 .cse8) (or .cse9 .cse3 .cse11 .cse4 .cse5 (not (< ~local~0 ~token~0)) .cse6 .cse10 .cse7 (not (<= ~token~0 (+ ~local~0 1)))) (or .cse0 .cse1 .cse3 .cse4 .cse5 .cse6 .cse10 .cse8) (or .cse9 .cse2 .cse3 .cse11 .cse4 .cse5 .cse6 .cse7) (or .cse0 .cse9 .cse3 .cse11 .cse4 .cse5 .cse6 .cse10) (or .cse0 .cse9 .cse2 .cse3 .cse4 .cse5 .cse6))) [2022-07-13 18:13:15,293 INFO L899 garLoopResultBuilder]: For program point reset_delta_eventsEXIT(lines 283 310) no Hoare annotation was computed. [2022-07-13 18:13:15,293 INFO L899 garLoopResultBuilder]: For program point L302-1(lines 283 310) no Hoare annotation was computed. [2022-07-13 18:13:15,293 INFO L899 garLoopResultBuilder]: For program point L297-1(lines 286 309) no Hoare annotation was computed. [2022-07-13 18:13:15,294 INFO L899 garLoopResultBuilder]: For program point L292-1(lines 286 309) no Hoare annotation was computed. [2022-07-13 18:13:15,294 INFO L902 garLoopResultBuilder]: At program point L481(lines 472 483) the Hoare annotation is: true [2022-07-13 18:13:15,294 INFO L895 garLoopResultBuilder]: At program point L234(lines 210 248) the Hoare annotation is: (let ((.cse7 (<= ~t1_pc~0 0)) (.cse6 (= ~token~0 ~local~0)) (.cse9 (= ~m_st~0 0)) (.cse8 (= ~m_pc~0 0)) (.cse0 (= ~t1_pc~0 1)) (.cse1 (<= 2 ~E_1~0)) (.cse2 (<= 2 ~E_M~0)) (.cse3 (<= 2 ~m_st~0)) (.cse4 (<= 1 ~m_pc~0)) (.cse5 (<= 2 ~T1_E~0)) (.cse10 (not (= ~t1_st~0 0)))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6) (and .cse1 .cse2 .cse3 .cse7 .cse5 .cse8) (and .cse1 .cse2 .cse3 .cse7 .cse4 .cse5 .cse6) (and .cse0 .cse1 .cse2 .cse9 .cse5 .cse8 .cse10) (and .cse1 .cse2 .cse9 .cse7 .cse5 .cse8 .cse6) (and .cse0 .cse1 .cse2 .cse9 (<= ~token~0 (+ ~local~0 1)) .cse4 .cse5 .cse10 (< ~local~0 ~token~0)) (and .cse0 .cse1 .cse2 .cse3 .cse5 .cse8) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse10))) [2022-07-13 18:13:15,294 INFO L895 garLoopResultBuilder]: At program point L69-1(lines 43 82) the Hoare annotation is: (let ((.cse4 (= ~t1_pc~0 1)) (.cse0 (<= 2 ~E_1~0)) (.cse1 (<= 2 ~E_M~0)) (.cse2 (<= 2 ~T1_E~0)) (.cse3 (= ~m_pc~0 0)) (.cse5 (not (= ~t1_st~0 0)))) (or (and .cse0 .cse1 (<= ~t1_pc~0 0) .cse2 .cse3 (= ~token~0 ~local~0)) (and .cse4 .cse0 .cse1 (<= 1 ~m_pc~0) .cse2 .cse5) (and .cse4 .cse0 .cse1 .cse2 .cse3 .cse5))) [2022-07-13 18:13:15,294 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2022-07-13 18:13:15,294 INFO L899 garLoopResultBuilder]: For program point L20(line 20) no Hoare annotation was computed. [2022-07-13 18:13:15,294 INFO L902 garLoopResultBuilder]: At program point L466(lines 413 471) the Hoare annotation is: true [2022-07-13 18:13:15,294 INFO L895 garLoopResultBuilder]: At program point L400(line 400) the Hoare annotation is: (let ((.cse7 (<= ~t1_pc~0 0)) (.cse6 (= ~token~0 ~local~0)) (.cse9 (= ~m_st~0 0)) (.cse8 (= ~m_pc~0 0)) (.cse0 (= ~t1_pc~0 1)) (.cse1 (<= 2 ~E_1~0)) (.cse2 (<= 2 ~E_M~0)) (.cse3 (<= 2 ~m_st~0)) (.cse4 (<= 1 ~m_pc~0)) (.cse5 (<= 2 ~T1_E~0)) (.cse10 (not (= ~t1_st~0 0)))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6) (and .cse1 .cse2 .cse3 .cse7 .cse5 .cse8) (and .cse1 .cse2 .cse3 .cse7 .cse4 .cse5 .cse6) (and .cse0 .cse1 .cse2 .cse9 .cse5 .cse8 .cse10) (and .cse1 .cse2 .cse9 .cse7 .cse5 .cse8 .cse6) (and .cse0 .cse1 .cse2 .cse9 (<= ~token~0 (+ ~local~0 1)) .cse4 .cse5 .cse10 (< ~local~0 ~token~0)) (and .cse0 .cse1 .cse2 .cse3 .cse5 .cse8) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse10))) [2022-07-13 18:13:15,295 INFO L899 garLoopResultBuilder]: For program point L400-1(line 400) no Hoare annotation was computed. [2022-07-13 18:13:15,295 INFO L895 garLoopResultBuilder]: At program point L21(lines 16 23) the Hoare annotation is: false [2022-07-13 18:13:15,295 INFO L899 garLoopResultBuilder]: For program point L170(lines 170 174) no Hoare annotation was computed. [2022-07-13 18:13:15,295 INFO L899 garLoopResultBuilder]: For program point L170-2(lines 169 182) no Hoare annotation was computed. [2022-07-13 18:13:15,295 INFO L895 garLoopResultBuilder]: At program point L451(line 451) the Hoare annotation is: (let ((.cse7 (<= ~t1_pc~0 0)) (.cse6 (= ~token~0 ~local~0)) (.cse9 (= ~m_st~0 0)) (.cse8 (= ~m_pc~0 0)) (.cse0 (= ~t1_pc~0 1)) (.cse1 (<= 2 ~E_1~0)) (.cse2 (<= 2 ~E_M~0)) (.cse3 (<= 2 ~m_st~0)) (.cse4 (<= 1 ~m_pc~0)) (.cse5 (<= 2 ~T1_E~0)) (.cse10 (not (= ~t1_st~0 0)))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6) (and .cse1 .cse2 .cse3 .cse7 .cse5 .cse8) (and .cse1 .cse2 .cse3 .cse7 .cse4 .cse5 .cse6) (and .cse0 .cse1 .cse2 .cse9 .cse5 .cse8 .cse10) (and .cse1 .cse2 .cse9 .cse7 .cse5 .cse8 .cse6) (and .cse0 .cse1 .cse2 .cse9 (<= ~token~0 (+ ~local~0 1)) .cse4 .cse5 .cse10 (< ~local~0 ~token~0)) (and .cse0 .cse1 .cse2 .cse3 .cse5 .cse8) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse10))) [2022-07-13 18:13:15,295 INFO L899 garLoopResultBuilder]: For program point L451-1(line 451) no Hoare annotation was computed. [2022-07-13 18:13:15,295 INFO L899 garLoopResultBuilder]: For program point L220(lines 210 248) no Hoare annotation was computed. [2022-07-13 18:13:15,295 INFO L899 garLoopResultBuilder]: For program point L88(lines 88 96) no Hoare annotation was computed. [2022-07-13 18:13:15,295 INFO L899 garLoopResultBuilder]: For program point L402(lines 402 407) no Hoare annotation was computed. [2022-07-13 18:13:15,295 INFO L899 garLoopResultBuilder]: For program point L237(lines 237 244) no Hoare annotation was computed. [2022-07-13 18:13:15,295 INFO L895 garLoopResultBuilder]: At program point L353(lines 347 355) the Hoare annotation is: (let ((.cse7 (<= ~t1_pc~0 0)) (.cse6 (= ~token~0 ~local~0)) (.cse9 (= ~m_st~0 0)) (.cse8 (= ~m_pc~0 0)) (.cse0 (= ~t1_pc~0 1)) (.cse1 (<= 2 ~E_1~0)) (.cse2 (<= 2 ~E_M~0)) (.cse3 (<= 2 ~m_st~0)) (.cse4 (<= 1 ~m_pc~0)) (.cse5 (<= 2 ~T1_E~0)) (.cse10 (not (= ~t1_st~0 0)))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6) (and .cse1 .cse2 .cse3 .cse7 .cse5 .cse8) (and .cse1 .cse2 .cse3 .cse7 .cse4 .cse5 .cse6) (and .cse0 .cse1 .cse2 .cse9 .cse5 .cse8 .cse10) (and .cse1 .cse2 .cse9 .cse7 .cse5 .cse8 .cse6) (and .cse0 .cse1 .cse2 .cse9 (<= ~token~0 (+ ~local~0 1)) .cse4 .cse5 .cse10 (< ~local~0 ~token~0)) (and .cse0 .cse1 .cse2 .cse3 .cse5 .cse8) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse10))) [2022-07-13 18:13:15,296 INFO L899 garLoopResultBuilder]: For program point L56(line 56) no Hoare annotation was computed. [2022-07-13 18:13:15,296 INFO L895 garLoopResultBuilder]: At program point L436(line 436) the Hoare annotation is: (let ((.cse7 (<= ~t1_pc~0 0)) (.cse6 (= ~token~0 ~local~0)) (.cse9 (= ~m_st~0 0)) (.cse8 (= ~m_pc~0 0)) (.cse0 (= ~t1_pc~0 1)) (.cse1 (<= 2 ~E_1~0)) (.cse2 (<= 2 ~E_M~0)) (.cse3 (<= 2 ~m_st~0)) (.cse4 (<= 1 ~m_pc~0)) (.cse5 (<= 2 ~T1_E~0)) (.cse10 (not (= ~t1_st~0 0)))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6) (and .cse1 .cse2 .cse3 .cse7 .cse5 .cse8) (and .cse1 .cse2 .cse3 .cse7 .cse4 .cse5 .cse6) (and .cse0 .cse1 .cse2 .cse9 .cse5 .cse8 .cse10) (and .cse1 .cse2 .cse9 .cse7 .cse5 .cse8 .cse6) (and .cse0 .cse1 .cse2 .cse9 (<= ~token~0 (+ ~local~0 1)) .cse4 .cse5 .cse10 (< ~local~0 ~token~0)) (and .cse0 .cse1 .cse2 .cse3 .cse5 .cse8) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse10))) [2022-07-13 18:13:15,296 INFO L899 garLoopResultBuilder]: For program point L436-1(line 436) no Hoare annotation was computed. [2022-07-13 18:13:15,296 INFO L899 garLoopResultBuilder]: For program point L370-1(lines 359 382) no Hoare annotation was computed. [2022-07-13 18:13:15,296 INFO L895 garLoopResultBuilder]: At program point L421(line 421) the Hoare annotation is: (and (= ~T1_E~0 ~M_E~0) (<= 2 ~E_1~0) (= ~m_st~0 0) (<= ~t1_pc~0 0) (= ~m_pc~0 0) (= ~E_M~0 ~M_E~0) (= ~token~0 ~local~0) (= ~M_E~0 2)) [2022-07-13 18:13:15,296 INFO L899 garLoopResultBuilder]: For program point L421-1(line 421) no Hoare annotation was computed. [2022-07-13 18:13:15,296 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2022-07-13 18:13:15,296 INFO L899 garLoopResultBuilder]: For program point L223(lines 223 230) no Hoare annotation was computed. [2022-07-13 18:13:15,296 INFO L899 garLoopResultBuilder]: For program point L91(lines 91 95) no Hoare annotation was computed. [2022-07-13 18:13:15,296 INFO L895 garLoopResultBuilder]: At program point L92(lines 87 118) the Hoare annotation is: (let ((.cse0 (= ~t1_pc~0 1)) (.cse1 (<= 2 ~E_1~0)) (.cse2 (<= 2 ~E_M~0)) (.cse3 (<= 2 ~m_st~0)) (.cse4 (<= 2 ~T1_E~0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 (= ~m_pc~0 0)) (and .cse0 .cse1 .cse2 .cse3 (<= 1 ~m_pc~0) .cse4 (not (= ~t1_st~0 0)) (= ~token~0 ~local~0)))) [2022-07-13 18:13:15,296 INFO L895 garLoopResultBuilder]: At program point L175-1(lines 166 183) the Hoare annotation is: (let ((.cse0 (= ~T1_E~0 ~M_E~0)) (.cse1 (<= 2 ~E_1~0)) (.cse2 (<= ~t1_pc~0 0)) (.cse3 (= ~m_pc~0 0)) (.cse4 (= ~E_M~0 ~M_E~0)) (.cse5 (= ~M_E~0 2))) (or (and .cse0 .cse1 (<= 2 ~m_st~0) .cse2 .cse3 .cse4 .cse5) (and .cse0 .cse1 (= ~m_st~0 0) .cse2 .cse3 .cse4 (= ~token~0 ~local~0) .cse5))) [2022-07-13 18:13:15,296 INFO L895 garLoopResultBuilder]: At program point L109(line 109) the Hoare annotation is: (let ((.cse0 (= ~t1_pc~0 1)) (.cse1 (<= 2 ~E_1~0)) (.cse2 (<= 2 ~m_st~0)) (.cse3 (<= 2 ~T1_E~0))) (or (and .cse0 .cse1 (<= ~token~0 (+ ~local~0 1)) .cse2 (<= 1 ~m_pc~0) .cse3 (not (= ~t1_st~0 0)) (< ~local~0 ~token~0)) (and .cse0 .cse1 .cse2 .cse3 (= ~m_pc~0 0)))) [2022-07-13 18:13:15,296 INFO L899 garLoopResultBuilder]: For program point L109-1(line 109) no Hoare annotation was computed. [2022-07-13 18:13:15,297 INFO L895 garLoopResultBuilder]: At program point L423(line 423) the Hoare annotation is: (let ((.cse0 (= ~T1_E~0 ~M_E~0)) (.cse1 (<= 2 ~E_1~0)) (.cse2 (<= ~t1_pc~0 0)) (.cse3 (= ~m_pc~0 0)) (.cse4 (= ~E_M~0 ~M_E~0)) (.cse5 (= ~M_E~0 2))) (or (and .cse0 .cse1 (<= 2 ~m_st~0) .cse2 .cse3 .cse4 .cse5) (and .cse0 .cse1 (= ~m_st~0 0) .cse2 .cse3 .cse4 (= ~token~0 ~local~0) .cse5))) [2022-07-13 18:13:15,297 INFO L895 garLoopResultBuilder]: At program point L423-1(line 423) the Hoare annotation is: (let ((.cse0 (= ~T1_E~0 ~M_E~0)) (.cse1 (<= 2 ~E_1~0)) (.cse2 (<= ~t1_pc~0 0)) (.cse3 (= ~m_pc~0 0)) (.cse4 (= ~E_M~0 ~M_E~0)) (.cse5 (= ~M_E~0 2))) (or (and .cse0 .cse1 (<= 2 ~m_st~0) .cse2 .cse3 .cse4 .cse5) (and .cse0 .cse1 (= ~m_st~0 0) .cse2 .cse3 .cse4 (= ~token~0 ~local~0) .cse5))) [2022-07-13 18:13:15,297 INFO L895 garLoopResultBuilder]: At program point L440(line 440) the Hoare annotation is: (let ((.cse7 (<= ~t1_pc~0 0)) (.cse6 (= ~token~0 ~local~0)) (.cse9 (= ~m_st~0 0)) (.cse8 (= ~m_pc~0 0)) (.cse0 (= ~t1_pc~0 1)) (.cse1 (<= 2 ~E_1~0)) (.cse2 (<= 2 ~E_M~0)) (.cse3 (<= 2 ~m_st~0)) (.cse4 (<= 1 ~m_pc~0)) (.cse5 (<= 2 ~T1_E~0)) (.cse10 (not (= ~t1_st~0 0)))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6) (and .cse1 .cse2 .cse3 .cse7 .cse5 .cse8) (and .cse1 .cse2 .cse3 .cse7 .cse4 .cse5 .cse6) (and .cse0 .cse1 .cse2 .cse9 .cse5 .cse8 .cse10) (and .cse1 .cse2 .cse9 .cse7 .cse5 .cse8 .cse6) (and .cse0 .cse1 .cse2 .cse9 (<= ~token~0 (+ ~local~0 1)) .cse4 .cse5 .cse10 (< ~local~0 ~token~0)) (and .cse0 .cse1 .cse2 .cse3 .cse5 .cse8) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse10))) [2022-07-13 18:13:15,297 INFO L895 garLoopResultBuilder]: At program point L440-1(line 440) the Hoare annotation is: (let ((.cse7 (<= ~t1_pc~0 0)) (.cse6 (= ~token~0 ~local~0)) (.cse9 (= ~m_st~0 0)) (.cse8 (= ~m_pc~0 0)) (.cse0 (= ~t1_pc~0 1)) (.cse1 (<= 2 ~E_1~0)) (.cse2 (<= 2 ~E_M~0)) (.cse3 (<= 2 ~m_st~0)) (.cse4 (<= 1 ~m_pc~0)) (.cse5 (<= 2 ~T1_E~0)) (.cse10 (not (= ~t1_st~0 0)))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6) (and .cse1 .cse2 .cse3 .cse7 .cse5 .cse8) (and .cse1 .cse2 .cse3 .cse7 .cse4 .cse5 .cse6) (and .cse0 .cse1 .cse2 .cse9 .cse5 .cse8 .cse10) (and .cse1 .cse2 .cse9 .cse7 .cse5 .cse8 .cse6) (and .cse0 .cse1 .cse2 .cse9 (<= ~token~0 (+ ~local~0 1)) .cse4 .cse5 .cse10 (< ~local~0 ~token~0)) (and .cse0 .cse1 .cse2 .cse3 .cse5 .cse8) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse10))) [2022-07-13 18:13:15,297 INFO L895 garLoopResultBuilder]: At program point L77(lines 40 83) the Hoare annotation is: (let ((.cse0 (<= 2 ~E_1~0)) (.cse1 (<= 2 ~E_M~0)) (.cse2 (<= 2 ~m_st~0)) (.cse3 (<= 1 ~m_pc~0)) (.cse4 (<= 2 ~T1_E~0)) (.cse5 (= ~token~0 ~local~0))) (or (and (= ~t1_pc~0 1) .cse0 .cse1 .cse2 .cse3 .cse4 .cse5) (and .cse0 .cse1 .cse2 (<= ~t1_pc~0 0) .cse3 .cse4 .cse5))) [2022-07-13 18:13:15,297 INFO L899 garLoopResultBuilder]: For program point L44(lines 44 52) no Hoare annotation was computed. [2022-07-13 18:13:15,297 INFO L895 garLoopResultBuilder]: At program point L424(line 424) the Hoare annotation is: (let ((.cse0 (= ~T1_E~0 ~M_E~0)) (.cse1 (<= 2 ~E_1~0)) (.cse2 (<= ~t1_pc~0 0)) (.cse3 (= ~m_pc~0 0)) (.cse4 (= ~E_M~0 ~M_E~0)) (.cse5 (= ~M_E~0 2))) (or (and .cse0 .cse1 (<= 2 ~m_st~0) .cse2 .cse3 .cse4 .cse5) (and .cse0 .cse1 (= ~m_st~0 0) .cse2 .cse3 .cse4 (= ~token~0 ~local~0) .cse5))) [2022-07-13 18:13:15,297 INFO L895 garLoopResultBuilder]: At program point L391(lines 384 393) the Hoare annotation is: (and (= ~T1_E~0 ~M_E~0) (<= 2 ~E_1~0) (= ~m_st~0 0) (<= ~t1_pc~0 0) (= ~m_pc~0 0) (= ~E_M~0 ~M_E~0) (= ~token~0 ~local~0) (= ~M_E~0 2)) [2022-07-13 18:13:15,297 INFO L895 garLoopResultBuilder]: At program point L61(line 61) the Hoare annotation is: (let ((.cse0 (= ~t1_pc~0 1)) (.cse5 (not (= ~t1_st~0 0))) (.cse1 (<= 2 ~E_M~0)) (.cse2 (<= 2 ~T1_E~0)) (.cse3 (not (= ~E_1~0 0))) (.cse4 (= ~m_pc~0 0)) (.cse6 (= ~token~0 ~local~0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6) (and .cse0 .cse1 (<= 1 ~m_pc~0) .cse2 .cse3 .cse5 .cse6) (and .cse1 (<= ~t1_pc~0 0) .cse2 .cse3 .cse4 .cse6))) [2022-07-13 18:13:15,298 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2022-07-13 18:13:15,298 INFO L899 garLoopResultBuilder]: For program point L61-1(line 61) no Hoare annotation was computed. [2022-07-13 18:13:15,298 INFO L895 garLoopResultBuilder]: At program point L441(line 441) the Hoare annotation is: (let ((.cse7 (<= ~t1_pc~0 0)) (.cse6 (= ~token~0 ~local~0)) (.cse9 (= ~m_st~0 0)) (.cse8 (= ~m_pc~0 0)) (.cse0 (= ~t1_pc~0 1)) (.cse1 (<= 2 ~E_1~0)) (.cse2 (<= 2 ~E_M~0)) (.cse3 (<= 2 ~m_st~0)) (.cse4 (<= 1 ~m_pc~0)) (.cse5 (<= 2 ~T1_E~0)) (.cse10 (not (= ~t1_st~0 0)))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6) (and .cse1 .cse2 .cse3 .cse7 .cse5 .cse8) (and .cse1 .cse2 .cse3 .cse7 .cse4 .cse5 .cse6) (and .cse0 .cse1 .cse2 .cse9 .cse5 .cse8 .cse10) (and .cse1 .cse2 .cse9 .cse7 .cse5 .cse8 .cse6) (and .cse0 .cse1 .cse2 .cse9 (<= ~token~0 (+ ~local~0 1)) .cse4 .cse5 .cse10 (< ~local~0 ~token~0)) (and .cse0 .cse1 .cse2 .cse3 .cse5 .cse8) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse10))) [2022-07-13 18:13:15,298 INFO L895 garLoopResultBuilder]: At program point L375-1(lines 356 383) the Hoare annotation is: (let ((.cse7 (<= ~t1_pc~0 0)) (.cse6 (= ~token~0 ~local~0)) (.cse9 (= ~m_st~0 0)) (.cse8 (= ~m_pc~0 0)) (.cse0 (= ~t1_pc~0 1)) (.cse1 (<= 2 ~E_1~0)) (.cse2 (<= 2 ~E_M~0)) (.cse3 (<= 2 ~m_st~0)) (.cse4 (<= 1 ~m_pc~0)) (.cse5 (<= 2 ~T1_E~0)) (.cse10 (not (= ~t1_st~0 0)))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6) (and .cse1 .cse2 .cse3 .cse7 .cse5 .cse8) (and .cse1 .cse2 .cse3 .cse7 .cse4 .cse5 .cse6) (and .cse0 .cse1 .cse2 .cse9 .cse5 .cse8 .cse10) (and .cse1 .cse2 .cse9 .cse7 .cse5 .cse8 .cse6) (and .cse0 .cse1 .cse2 .cse9 (<= ~token~0 (+ ~local~0 1)) .cse4 .cse5 .cse10 (< ~local~0 ~token~0)) (and .cse0 .cse1 .cse2 .cse3 .cse5 .cse8) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse10))) [2022-07-13 18:13:15,298 INFO L895 garLoopResultBuilder]: At program point L442(line 442) the Hoare annotation is: (let ((.cse7 (<= ~t1_pc~0 0)) (.cse6 (= ~token~0 ~local~0)) (.cse9 (= ~m_st~0 0)) (.cse8 (= ~m_pc~0 0)) (.cse0 (= ~t1_pc~0 1)) (.cse1 (<= 2 ~E_1~0)) (.cse2 (<= 2 ~E_M~0)) (.cse3 (<= 2 ~m_st~0)) (.cse4 (<= 1 ~m_pc~0)) (.cse5 (<= 2 ~T1_E~0)) (.cse10 (not (= ~t1_st~0 0)))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6) (and .cse1 .cse2 .cse3 .cse7 .cse5 .cse8) (and .cse1 .cse2 .cse3 .cse7 .cse4 .cse5 .cse6) (and .cse0 .cse1 .cse2 .cse9 .cse5 .cse8 .cse10) (and .cse1 .cse2 .cse9 .cse7 .cse5 .cse8 .cse6) (and .cse0 .cse1 .cse2 .cse9 (<= ~token~0 (+ ~local~0 1)) .cse4 .cse5 .cse10 (< ~local~0 ~token~0)) (and .cse0 .cse1 .cse2 .cse3 .cse5 .cse8) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse10))) [2022-07-13 18:13:15,298 INFO L895 garLoopResultBuilder]: At program point L409(lines 398 411) the Hoare annotation is: (let ((.cse7 (<= ~t1_pc~0 0)) (.cse6 (= ~token~0 ~local~0)) (.cse9 (= ~m_st~0 0)) (.cse8 (= ~m_pc~0 0)) (.cse0 (= ~t1_pc~0 1)) (.cse1 (<= 2 ~E_1~0)) (.cse2 (<= 2 ~E_M~0)) (.cse3 (<= 2 ~m_st~0)) (.cse4 (<= 1 ~m_pc~0)) (.cse5 (<= 2 ~T1_E~0)) (.cse10 (not (= ~t1_st~0 0)))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6) (and .cse1 .cse2 .cse3 .cse7 .cse5 .cse8) (and .cse1 .cse2 .cse3 .cse7 .cse4 .cse5 .cse6) (and .cse0 .cse1 .cse2 .cse9 .cse5 .cse8 .cse10) (and .cse1 .cse2 .cse9 .cse7 .cse5 .cse8 .cse6) (and .cse0 .cse1 .cse2 .cse9 (<= ~token~0 (+ ~local~0 1)) .cse4 .cse5 .cse10 (< ~local~0 ~token~0)) (and .cse0 .cse1 .cse2 .cse3 .cse5 .cse8) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse10))) [2022-07-13 18:13:15,298 INFO L895 garLoopResultBuilder]: At program point L211(line 211) the Hoare annotation is: (let ((.cse7 (<= ~t1_pc~0 0)) (.cse6 (= ~token~0 ~local~0)) (.cse9 (= ~m_st~0 0)) (.cse8 (= ~m_pc~0 0)) (.cse0 (= ~t1_pc~0 1)) (.cse1 (<= 2 ~E_1~0)) (.cse2 (<= 2 ~E_M~0)) (.cse3 (<= 2 ~m_st~0)) (.cse4 (<= 1 ~m_pc~0)) (.cse5 (<= 2 ~T1_E~0)) (.cse10 (not (= ~t1_st~0 0)))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6) (and .cse1 .cse2 .cse3 .cse7 .cse5 .cse8) (and .cse1 .cse2 .cse3 .cse7 .cse4 .cse5 .cse6) (and .cse0 .cse1 .cse2 .cse9 .cse5 .cse8 .cse10) (and .cse1 .cse2 .cse9 .cse7 .cse5 .cse8 .cse6) (and .cse0 .cse1 .cse2 .cse9 (<= ~token~0 (+ ~local~0 1)) .cse4 .cse5 .cse10 (< ~local~0 ~token~0)) (and .cse0 .cse1 .cse2 .cse3 .cse5 .cse8) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse10))) [2022-07-13 18:13:15,298 INFO L899 garLoopResultBuilder]: For program point L360(lines 360 364) no Hoare annotation was computed. [2022-07-13 18:13:15,298 INFO L899 garLoopResultBuilder]: For program point L360-2(lines 359 382) no Hoare annotation was computed. [2022-07-13 18:13:15,298 INFO L895 garLoopResultBuilder]: At program point L410(lines 394 412) the Hoare annotation is: (let ((.cse7 (<= ~t1_pc~0 0)) (.cse6 (= ~token~0 ~local~0)) (.cse9 (= ~m_st~0 0)) (.cse8 (= ~m_pc~0 0)) (.cse0 (= ~t1_pc~0 1)) (.cse1 (<= 2 ~E_1~0)) (.cse2 (<= 2 ~E_M~0)) (.cse3 (<= 2 ~m_st~0)) (.cse4 (<= 1 ~m_pc~0)) (.cse5 (<= 2 ~T1_E~0)) (.cse10 (not (= ~t1_st~0 0)))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6) (and .cse1 .cse2 .cse3 .cse7 .cse5 .cse8) (and .cse1 .cse2 .cse3 .cse7 .cse4 .cse5 .cse6) (and .cse0 .cse1 .cse2 .cse9 .cse5 .cse8 .cse10) (and .cse1 .cse2 .cse9 .cse7 .cse5 .cse8 .cse6) (and .cse0 .cse1 .cse2 .cse9 (<= ~token~0 (+ ~local~0 1)) .cse4 .cse5 .cse10 (< ~local~0 ~token~0)) (and .cse0 .cse1 .cse2 .cse3 .cse5 .cse8) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse10))) [2022-07-13 18:13:15,299 INFO L895 garLoopResultBuilder]: At program point L113(lines 84 119) the Hoare annotation is: (let ((.cse3 (= ~m_st~0 0)) (.cse5 (= ~m_pc~0 0)) (.cse0 (= ~t1_pc~0 1)) (.cse1 (<= 2 ~E_1~0)) (.cse2 (<= 2 ~E_M~0)) (.cse8 (<= 2 ~m_st~0)) (.cse7 (<= 1 ~m_pc~0)) (.cse4 (<= 2 ~T1_E~0)) (.cse6 (not (= ~t1_st~0 0)))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6) (and .cse0 .cse1 .cse2 .cse3 (<= ~token~0 (+ ~local~0 1)) .cse7 .cse4 .cse6 (< ~local~0 ~token~0)) (and .cse0 .cse1 .cse2 .cse8 .cse4 .cse5) (and .cse0 .cse1 .cse2 .cse8 .cse7 .cse4 .cse6))) [2022-07-13 18:13:15,299 INFO L899 garLoopResultBuilder]: For program point L47(lines 47 51) no Hoare annotation was computed. [2022-07-13 18:13:15,299 INFO L899 garLoopResultBuilder]: For program point L460(lines 460 464) no Hoare annotation was computed. [2022-07-13 18:13:15,299 INFO L899 garLoopResultBuilder]: For program point L213(line 213) no Hoare annotation was computed. [2022-07-13 18:13:15,299 INFO L895 garLoopResultBuilder]: At program point L48(lines 43 82) the Hoare annotation is: (and (= ~t1_pc~0 1) (<= 2 ~E_1~0) (<= 2 ~E_M~0) (<= ~token~0 (+ ~local~0 1)) (<= 1 ~m_pc~0) (<= 2 ~T1_E~0) (not (= ~t1_st~0 0)) (< ~local~0 ~token~0)) [2022-07-13 18:13:15,299 INFO L895 garLoopResultBuilder]: At program point L428-1(lines 425 465) the Hoare annotation is: (let ((.cse7 (<= ~t1_pc~0 0)) (.cse6 (= ~token~0 ~local~0)) (.cse9 (= ~m_st~0 0)) (.cse8 (= ~m_pc~0 0)) (.cse0 (= ~t1_pc~0 1)) (.cse1 (<= 2 ~E_1~0)) (.cse2 (<= 2 ~E_M~0)) (.cse3 (<= 2 ~m_st~0)) (.cse4 (<= 1 ~m_pc~0)) (.cse5 (<= 2 ~T1_E~0)) (.cse10 (not (= ~t1_st~0 0)))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6) (and .cse1 .cse2 .cse3 .cse7 .cse5 .cse8) (and .cse1 .cse2 .cse3 .cse7 .cse4 .cse5 .cse6) (and .cse0 .cse1 .cse2 .cse9 .cse5 .cse8 .cse10) (and .cse1 .cse2 .cse9 .cse7 .cse5 .cse8 .cse6) (and .cse0 .cse1 .cse2 .cse9 (<= ~token~0 (+ ~local~0 1)) .cse4 .cse5 .cse10 (< ~local~0 ~token~0)) (and .cse0 .cse1 .cse2 .cse3 .cse5 .cse8) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse10))) [2022-07-13 18:13:15,299 INFO L899 garLoopResultBuilder]: For program point L-1(line -1) no Hoare annotation was computed. [2022-07-13 18:13:15,299 INFO L899 garLoopResultBuilder]: For program point L445(line 445) no Hoare annotation was computed. [2022-07-13 18:13:15,299 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 20) no Hoare annotation was computed. [2022-07-13 18:13:15,300 INFO L899 garLoopResultBuilder]: For program point L429(line 429) no Hoare annotation was computed. [2022-07-13 18:13:15,300 INFO L895 garLoopResultBuilder]: At program point L99-1(lines 87 118) the Hoare annotation is: (let ((.cse2 (<= 2 ~m_st~0)) (.cse6 (= ~m_pc~0 0)) (.cse0 (<= 2 ~E_1~0)) (.cse1 (<= 2 ~E_M~0)) (.cse7 (= ~m_st~0 0)) (.cse3 (<= 1 ~m_pc~0)) (.cse4 (<= 2 ~T1_E~0)) (.cse5 (not (= ~t1_st~0 0)))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5) (and .cse0 .cse1 .cse2 .cse4 .cse6) (and .cse0 .cse1 .cse7 .cse4 .cse6 .cse5) (and .cse0 .cse1 .cse7 (<= ~token~0 (+ ~local~0 1)) .cse3 .cse4 .cse5 (< ~local~0 ~token~0)))) [2022-07-13 18:13:15,300 INFO L899 garLoopResultBuilder]: For program point L215(lines 215 219) no Hoare annotation was computed. [2022-07-13 18:13:15,300 INFO L899 garLoopResultBuilder]: For program point L215-1(lines 210 248) no Hoare annotation was computed. [2022-07-13 18:13:15,300 INFO L899 garLoopResultBuilder]: For program point L100(line 100) no Hoare annotation was computed. [2022-07-13 18:13:15,300 INFO L899 garLoopResultBuilder]: For program point L447(lines 447 456) no Hoare annotation was computed. [2022-07-13 18:13:15,300 INFO L899 garLoopResultBuilder]: For program point L447-2(lines 447 456) no Hoare annotation was computed. [2022-07-13 18:13:15,300 INFO L895 garLoopResultBuilder]: At program point L249(lines 204 254) the Hoare annotation is: (let ((.cse7 (<= ~t1_pc~0 0)) (.cse6 (= ~token~0 ~local~0)) (.cse9 (= ~m_st~0 0)) (.cse8 (= ~m_pc~0 0)) (.cse0 (= ~t1_pc~0 1)) (.cse1 (<= 2 ~E_1~0)) (.cse2 (<= 2 ~E_M~0)) (.cse3 (<= 2 ~m_st~0)) (.cse4 (<= 1 ~m_pc~0)) (.cse5 (<= 2 ~T1_E~0)) (.cse10 (not (= ~t1_st~0 0)))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6) (and .cse1 .cse2 .cse3 .cse7 .cse5 .cse8) (and .cse1 .cse2 .cse3 .cse7 .cse4 .cse5 .cse6) (and .cse0 .cse1 .cse2 .cse9 .cse5 .cse8 .cse10) (and .cse1 .cse2 .cse9 .cse7 .cse5 .cse8 .cse6) (and .cse0 .cse1 .cse2 .cse9 (<= ~token~0 (+ ~local~0 1)) .cse4 .cse5 .cse10 (< ~local~0 ~token~0)) (and .cse0 .cse1 .cse2 .cse3 .cse5 .cse8) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse10))) [2022-07-13 18:13:15,300 INFO L899 garLoopResultBuilder]: For program point L365-1(lines 359 382) no Hoare annotation was computed. [2022-07-13 18:13:15,303 INFO L356 BasicCegarLoop]: Path program histogram: [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 18:13:15,304 INFO L176 ceAbstractionStarter]: Computing trace abstraction results [2022-07-13 18:13:15,346 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 13.07 06:13:15 BoogieIcfgContainer [2022-07-13 18:13:15,346 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-07-13 18:13:15,347 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-07-13 18:13:15,347 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-07-13 18:13:15,347 INFO L275 PluginConnector]: Witness Printer initialized [2022-07-13 18:13:15,347 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.07 06:12:53" (3/4) ... [2022-07-13 18:13:15,349 INFO L137 WitnessPrinter]: Generating witness for correct program [2022-07-13 18:13:15,353 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure activate_threads [2022-07-13 18:13:15,353 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure immediate_notify [2022-07-13 18:13:15,353 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure exists_runnable_thread [2022-07-13 18:13:15,354 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure fire_delta_events [2022-07-13 18:13:15,354 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure update_channels [2022-07-13 18:13:15,354 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure reset_delta_events [2022-07-13 18:13:15,358 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 17 nodes and edges [2022-07-13 18:13:15,359 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 5 nodes and edges [2022-07-13 18:13:15,359 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2022-07-13 18:13:15,359 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2022-07-13 18:13:15,374 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((((((!(2 <= \old(m_st)) || !(2 <= T1_E)) || !(t1_pc <= 0)) || !(m_pc == 0)) || !(2 <= E_M)) || (((\old(t1_st) == t1_st && m_st == \old(m_st)) && 0 <= __retres1) && __retres1 <= 0)) || !(2 <= E_1)) && (((((((!(2 <= T1_E) || !(t1_pc == 1)) || !(m_pc == 0)) || \old(t1_st) == 0) || !(2 <= E_M)) || (((\old(t1_st) == t1_st && m_st == \old(m_st)) && 0 <= __retres1) && __retres1 <= 0)) || !(\old(m_st) == 0)) || !(2 <= E_1))) && (((((((!(2 <= \old(m_st)) || !(2 <= T1_E)) || !(t1_pc == 1)) || !(2 <= E_M)) || (((\old(t1_st) == t1_st && m_st == \old(m_st)) && 0 <= __retres1) && __retres1 <= 0)) || !(1 <= m_pc)) || !(2 <= E_1)) || !(token == local))) && (((((((!(2 <= \old(m_st)) || !(2 <= T1_E)) || !(t1_pc <= 0)) || !(2 <= E_M)) || (((\old(t1_st) == t1_st && m_st == \old(m_st)) && 0 <= __retres1) && __retres1 <= 0)) || !(1 <= m_pc)) || !(2 <= E_1)) || !(token == local))) && (((((((((!(2 <= T1_E) || !(t1_pc == 1)) || \old(t1_st) == 0) || !(2 <= E_M)) || !(local < token)) || (((\old(t1_st) == t1_st && m_st == \old(m_st)) && 0 <= __retres1) && __retres1 <= 0)) || !(1 <= m_pc)) || !(\old(m_st) == 0)) || !(2 <= E_1)) || !(token <= local + 1))) && (((((((!(2 <= T1_E) || !(t1_pc == 1)) || \old(t1_st) == 0) || !(2 <= E_M)) || (((\old(t1_st) == t1_st && m_st == \old(m_st)) && 0 <= __retres1) && __retres1 <= 0)) || !(1 <= m_pc)) || E_1 == 0) || !(token == local))) && ((((((!(2 <= T1_E) || !(t1_pc <= 0)) || !(m_pc == 0)) || !(2 <= E_M)) || (((\old(t1_st) == t1_st && m_st == \old(m_st)) && 0 <= __retres1) && __retres1 <= 0)) || E_1 == 0) || !(token == local))) && (((((((!(2 <= T1_E) || !(t1_pc == 1)) || !(m_pc == 0)) || \old(t1_st) == 0) || !(2 <= E_M)) || (((\old(t1_st) == t1_st && m_st == \old(m_st)) && 0 <= __retres1) && __retres1 <= 0)) || E_1 == 0) || !(token == local))) && (((((((!(2 <= \old(m_st)) || !(2 <= T1_E)) || !(t1_pc == 1)) || \old(t1_st) == 0) || !(2 <= E_M)) || (((\old(t1_st) == t1_st && m_st == \old(m_st)) && 0 <= __retres1) && __retres1 <= 0)) || !(1 <= m_pc)) || !(2 <= E_1))) && (((((!(2 <= \old(m_st)) || !(2 <= T1_E)) || !(t1_pc == 1)) || !(m_pc == 0)) || (((\old(t1_st) == t1_st && m_st == \old(m_st)) && 0 <= __retres1) && __retres1 <= 0)) || !(2 <= E_1))) && ((((((((!(2 <= \old(m_st)) || !(2 <= T1_E)) || (\old(t1_st) == t1_st && m_st == \old(m_st))) || !(t1_pc == 1)) || \old(t1_st) == 0) || !(local < token)) || !(1 <= m_pc)) || !(2 <= E_1)) || !(token <= local + 1)) [2022-07-13 18:13:15,375 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((((((!(2 <= T1_E) || !(t1_pc <= 0)) || !(m_pc == 0)) || !(2 <= E_M)) || E_1 == 0) || !(token == local)) || (((((0 <= \result && \result <= 0) && \old(t1_st) == t1_st) && m_st == \old(m_st)) && 0 <= __retres1) && __retres1 <= 0)) && (((((((!(2 <= T1_E) || !(t1_pc == 1)) || !(m_pc == 0)) || \old(t1_st) == 0) || !(2 <= E_M)) || !(\old(m_st) == 0)) || !(2 <= E_1)) || (((((0 <= \result && \result <= 0) && \old(t1_st) == t1_st) && m_st == \old(m_st)) && 0 <= __retres1) && __retres1 <= 0))) && (((((((!(2 <= \old(m_st)) || !(2 <= T1_E)) || !(t1_pc <= 0)) || !(2 <= E_M)) || !(1 <= m_pc)) || !(2 <= E_1)) || !(token == local)) || (((((0 <= \result && \result <= 0) && \old(t1_st) == t1_st) && m_st == \old(m_st)) && 0 <= __retres1) && __retres1 <= 0))) && (((((((((!(2 <= T1_E) || !(t1_pc == 1)) || \old(t1_st) == 0) || !(2 <= E_M)) || !(local < token)) || !(1 <= m_pc)) || !(\old(m_st) == 0)) || !(2 <= E_1)) || !(token <= local + 1)) || (((((0 <= \result && \result <= 0) && \old(t1_st) == t1_st) && m_st == \old(m_st)) && 0 <= __retres1) && __retres1 <= 0))) && (((((((!(2 <= \old(m_st)) || !(2 <= T1_E)) || !(t1_pc == 1)) || \old(t1_st) == 0) || !(2 <= E_M)) || !(1 <= m_pc)) || !(2 <= E_1)) || (((((0 <= \result && \result <= 0) && \old(t1_st) == t1_st) && m_st == \old(m_st)) && 0 <= __retres1) && __retres1 <= 0))) && (((((((!(2 <= \old(m_st)) || !(2 <= T1_E)) || !(t1_pc == 1)) || !(2 <= E_M)) || !(1 <= m_pc)) || !(2 <= E_1)) || !(token == local)) || (((((0 <= \result && \result <= 0) && \old(t1_st) == t1_st) && m_st == \old(m_st)) && 0 <= __retres1) && __retres1 <= 0))) && (((((((!(2 <= T1_E) || !(t1_pc == 1)) || !(m_pc == 0)) || \old(t1_st) == 0) || !(2 <= E_M)) || E_1 == 0) || !(token == local)) || (((((0 <= \result && \result <= 0) && \old(t1_st) == t1_st) && m_st == \old(m_st)) && 0 <= __retres1) && __retres1 <= 0))) && (((((((!(2 <= T1_E) || !(t1_pc == 1)) || \old(t1_st) == 0) || !(2 <= E_M)) || !(1 <= m_pc)) || E_1 == 0) || !(token == local)) || (((((0 <= \result && \result <= 0) && \old(t1_st) == t1_st) && m_st == \old(m_st)) && 0 <= __retres1) && __retres1 <= 0))) && (((((!(2 <= \old(m_st)) || !(2 <= T1_E)) || !(t1_pc == 1)) || !(m_pc == 0)) || !(2 <= E_1)) || (((((0 <= \result && \result <= 0) && \old(t1_st) == t1_st) && m_st == \old(m_st)) && 0 <= __retres1) && __retres1 <= 0))) && ((((((((!(2 <= \old(m_st)) || !(2 <= T1_E)) || (\old(t1_st) == t1_st && m_st == \old(m_st))) || !(t1_pc == 1)) || \old(t1_st) == 0) || !(local < token)) || !(1 <= m_pc)) || !(2 <= E_1)) || !(token <= local + 1))) && ((((((!(2 <= \old(m_st)) || !(2 <= T1_E)) || !(t1_pc <= 0)) || !(m_pc == 0)) || !(2 <= E_M)) || !(2 <= E_1)) || (((((0 <= \result && \result <= 0) && \old(t1_st) == t1_st) && m_st == \old(m_st)) && 0 <= __retres1) && __retres1 <= 0)) [2022-07-13 18:13:15,375 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((((((((((((((((((0 <= \result && \result <= 0) && \old(t1_st) == t1_st) && 0 < tmp + 1) && m_st == \old(m_st)) && 0 <= __retres1) && tmp <= 0) && __retres1 <= 0) && __retres1 <= 0) && 0 <= __retres1) || !(2 <= T1_E)) || !(t1_pc == 1)) || \old(t1_st) == 0) || !(2 <= E_M)) || !(local < token)) || !(1 <= m_pc)) || !(\old(m_st) == 0)) || !(2 <= E_1)) || !(token <= local + 1)) && (((((((!(2 <= T1_E) || !(t1_pc == 1)) || !(m_pc == 0)) || \old(t1_st) == 0) || !(2 <= E_M)) || E_1 == 0) || (((((((0 <= \result && \result <= 0) && \old(t1_st) == t1_st) && 0 < tmp + 1) && m_st == \old(m_st)) && 0 <= __retres1) && tmp <= 0) && __retres1 <= 0)) || !(token == local))) && ((((((((((((((((0 <= \result && \result <= 0) && \old(t1_st) == t1_st) && 0 < tmp + 1) && m_st == \old(m_st)) && 0 <= __retres1) && tmp <= 0) && __retres1 <= 0) && __retres1 <= 0) && 0 <= __retres1) || !(2 <= \old(m_st))) || !(2 <= T1_E)) || !(t1_pc <= 0)) || !(2 <= E_M)) || !(1 <= m_pc)) || !(2 <= E_1)) || !(token == local))) && (((((!(2 <= \old(m_st)) || !(2 <= T1_E)) || !(t1_pc == 1)) || !(m_pc == 0)) || ((((((0 <= \result && \result <= 0) && 0 < tmp + 1) && 2 <= m_st) && 0 <= __retres1) && tmp <= 0) && __retres1 <= 0)) || !(2 <= E_1))) && ((((((!(2 <= \old(m_st)) || !(2 <= T1_E)) || !(t1_pc <= 0)) || !(m_pc == 0)) || !(2 <= E_M)) || ((((((0 <= \result && \result <= 0) && 0 < tmp + 1) && 2 <= m_st) && 0 <= __retres1) && tmp <= 0) && __retres1 <= 0)) || !(2 <= E_1))) && ((((((((((((((\old(t1_st) == t1_st && 0 < tmp + 1) && m_st == \old(m_st)) && tmp <= 0) && __retres1 <= 0) && 0 <= __retres1) || !(2 <= \old(m_st))) || !(2 <= T1_E)) || !(t1_pc == 1)) || \old(t1_st) == 0) || !(local < token)) || !(1 <= m_pc)) || (((m_st == 0 && __retres1 <= 0) && !(t1_st == 0)) && 0 <= __retres1)) || !(2 <= E_1)) || !(token <= local + 1))) && ((((((((((((((((0 <= \result && \result <= 0) && \old(t1_st) == t1_st) && 0 < tmp + 1) && m_st == \old(m_st)) && 0 <= __retres1) && tmp <= 0) && __retres1 <= 0) && __retres1 <= 0) && 0 <= __retres1) || !(2 <= T1_E)) || !(t1_pc == 1)) || !(m_pc == 0)) || \old(t1_st) == 0) || !(2 <= E_M)) || !(\old(m_st) == 0)) || !(2 <= E_1))) && (((((((((((((((0 <= \result && \result <= 0) && \old(t1_st) == t1_st) && 0 < tmp + 1) && m_st == \old(m_st)) && 0 <= __retres1) && tmp <= 0) && __retres1 <= 0) && __retres1 <= 0) && 0 <= __retres1) || !(2 <= T1_E)) || !(t1_pc <= 0)) || !(m_pc == 0)) || !(2 <= E_M)) || E_1 == 0) || !(token == local))) && ((((((((((((((((0 <= \result && \result <= 0) && \old(t1_st) == t1_st) && 0 < tmp + 1) && m_st == \old(m_st)) && 0 <= __retres1) && tmp <= 0) && __retres1 <= 0) && __retres1 <= 0) && 0 <= __retres1) || !(2 <= \old(m_st))) || !(2 <= T1_E)) || !(t1_pc == 1)) || \old(t1_st) == 0) || !(2 <= E_M)) || !(1 <= m_pc)) || !(2 <= E_1))) && ((((((((((((((((0 <= \result && \result <= 0) && \old(t1_st) == t1_st) && 0 < tmp + 1) && m_st == \old(m_st)) && 0 <= __retres1) && tmp <= 0) && __retres1 <= 0) && __retres1 <= 0) && 0 <= __retres1) || !(2 <= \old(m_st))) || !(2 <= T1_E)) || !(t1_pc == 1)) || !(2 <= E_M)) || !(1 <= m_pc)) || !(2 <= E_1)) || !(token == local))) && (((((((!(2 <= T1_E) || !(t1_pc == 1)) || \old(t1_st) == 0) || !(2 <= E_M)) || !(1 <= m_pc)) || E_1 == 0) || (((((((0 <= \result && \result <= 0) && \old(t1_st) == t1_st) && 0 < tmp + 1) && m_st == \old(m_st)) && 0 <= __retres1) && tmp <= 0) && __retres1 <= 0)) || !(token == local)) [2022-07-13 18:13:15,376 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((((((((!(2 <= T1_E) || !(t1_pc == 1)) || !(m_pc == 0)) || \old(t1_st) == 0) || !(2 <= E_M)) || E_1 == 0) || (((((((0 <= \result && \result <= 0) && \old(t1_st) == t1_st) && 0 < tmp + 1) && m_st == \old(m_st)) && 0 <= __retres1) && tmp <= 0) && __retres1 <= 0)) || !(token == local)) && (((((!(2 <= \old(m_st)) || !(2 <= T1_E)) || !(t1_pc == 1)) || !(m_pc == 0)) || ((((((0 <= \result && \result <= 0) && 0 < tmp + 1) && 2 <= m_st) && 0 <= __retres1) && tmp <= 0) && __retres1 <= 0)) || !(2 <= E_1))) && ((((((!(2 <= \old(m_st)) || !(2 <= T1_E)) || !(t1_pc <= 0)) || !(m_pc == 0)) || !(2 <= E_M)) || ((((((0 <= \result && \result <= 0) && 0 < tmp + 1) && 2 <= m_st) && 0 <= __retres1) && tmp <= 0) && __retres1 <= 0)) || !(2 <= E_1))) && (((((((!(2 <= T1_E) || !(t1_pc == 1)) || !(m_pc == 0)) || \old(t1_st) == 0) || !(2 <= E_M)) || !(\old(m_st) == 0)) || (((((((((((0 <= \result && \result <= 0) && \old(t1_st) == t1_st) && 0 < tmp + 1) && m_st == \old(m_st)) && 0 <= __retres1) && \result <= 0) && tmp <= 0) && __retres1 <= 0) && __retres1 <= 0) && 0 <= \result) && 0 <= __retres1)) || !(2 <= E_1))) && (((((((((!(2 <= T1_E) || !(t1_pc == 1)) || \old(t1_st) == 0) || !(2 <= E_M)) || !(local < token)) || !(1 <= m_pc)) || !(\old(m_st) == 0)) || (((((((((((0 <= \result && \result <= 0) && \old(t1_st) == t1_st) && 0 < tmp + 1) && m_st == \old(m_st)) && 0 <= __retres1) && \result <= 0) && tmp <= 0) && __retres1 <= 0) && __retres1 <= 0) && 0 <= \result) && 0 <= __retres1)) || !(2 <= E_1)) || !(token <= local + 1))) && ((((((((((((((((\old(t1_st) == t1_st && 0 < tmp + 1) && m_st == \old(m_st)) && \result <= 0) && tmp <= 0) && __retres1 <= 0) && 0 <= \result) && 0 <= __retres1) || (((((m_st == 0 && \result <= 0) && __retres1 <= 0) && !(t1_st == 0)) && 0 <= \result) && 0 <= __retres1)) || !(2 <= \old(m_st))) || !(2 <= T1_E)) || !(t1_pc == 1)) || \old(t1_st) == 0) || !(local < token)) || !(1 <= m_pc)) || !(2 <= E_1)) || !(token <= local + 1))) && (((((((!(2 <= \old(m_st)) || !(2 <= T1_E)) || !(t1_pc <= 0)) || !(2 <= E_M)) || !(1 <= m_pc)) || (((((((((((0 <= \result && \result <= 0) && \old(t1_st) == t1_st) && 0 < tmp + 1) && m_st == \old(m_st)) && 0 <= __retres1) && \result <= 0) && tmp <= 0) && __retres1 <= 0) && __retres1 <= 0) && 0 <= \result) && 0 <= __retres1)) || !(2 <= E_1)) || !(token == local))) && (((((((!(2 <= \old(m_st)) || !(2 <= T1_E)) || !(t1_pc == 1)) || !(2 <= E_M)) || !(1 <= m_pc)) || (((((((((((0 <= \result && \result <= 0) && \old(t1_st) == t1_st) && 0 < tmp + 1) && m_st == \old(m_st)) && 0 <= __retres1) && \result <= 0) && tmp <= 0) && __retres1 <= 0) && __retres1 <= 0) && 0 <= \result) && 0 <= __retres1)) || !(2 <= E_1)) || !(token == local))) && (((((((!(2 <= \old(m_st)) || !(2 <= T1_E)) || !(t1_pc == 1)) || \old(t1_st) == 0) || !(2 <= E_M)) || !(1 <= m_pc)) || (((((((((((0 <= \result && \result <= 0) && \old(t1_st) == t1_st) && 0 < tmp + 1) && m_st == \old(m_st)) && 0 <= __retres1) && \result <= 0) && tmp <= 0) && __retres1 <= 0) && __retres1 <= 0) && 0 <= \result) && 0 <= __retres1)) || !(2 <= E_1))) && (((((((!(2 <= T1_E) || !(t1_pc == 1)) || \old(t1_st) == 0) || !(2 <= E_M)) || !(1 <= m_pc)) || E_1 == 0) || (((((((0 <= \result && \result <= 0) && \old(t1_st) == t1_st) && 0 < tmp + 1) && m_st == \old(m_st)) && 0 <= __retres1) && tmp <= 0) && __retres1 <= 0)) || !(token == local))) && ((((((!(2 <= T1_E) || !(t1_pc <= 0)) || !(m_pc == 0)) || !(2 <= E_M)) || (((((((((((0 <= \result && \result <= 0) && \old(t1_st) == t1_st) && 0 < tmp + 1) && m_st == \old(m_st)) && 0 <= __retres1) && \result <= 0) && tmp <= 0) && __retres1 <= 0) && __retres1 <= 0) && 0 <= \result) && 0 <= __retres1)) || E_1 == 0) || !(token == local)) [2022-07-13 18:13:15,398 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2022-07-13 18:13:15,398 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-07-13 18:13:15,399 INFO L158 Benchmark]: Toolchain (without parser) took 22455.76ms. Allocated memory was 117.4MB in the beginning and 625.0MB in the end (delta: 507.5MB). Free memory was 94.5MB in the beginning and 457.0MB in the end (delta: -362.5MB). Peak memory consumption was 145.6MB. Max. memory is 16.1GB. [2022-07-13 18:13:15,399 INFO L158 Benchmark]: CDTParser took 0.15ms. Allocated memory is still 88.1MB. Free memory was 60.4MB in the beginning and 60.4MB in the end (delta: 41.1kB). There was no memory consumed. Max. memory is 16.1GB. [2022-07-13 18:13:15,400 INFO L158 Benchmark]: CACSL2BoogieTranslator took 161.62ms. Allocated memory is still 117.4MB. Free memory was 94.3MB in the beginning and 82.0MB in the end (delta: 12.3MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2022-07-13 18:13:15,400 INFO L158 Benchmark]: Boogie Procedure Inliner took 23.36ms. Allocated memory is still 117.4MB. Free memory was 82.0MB in the beginning and 80.0MB in the end (delta: 2.0MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-07-13 18:13:15,400 INFO L158 Benchmark]: Boogie Preprocessor took 14.86ms. Allocated memory is still 117.4MB. Free memory was 80.0MB in the beginning and 78.5MB in the end (delta: 1.5MB). There was no memory consumed. Max. memory is 16.1GB. [2022-07-13 18:13:15,400 INFO L158 Benchmark]: RCFGBuilder took 337.35ms. Allocated memory is still 117.4MB. Free memory was 78.5MB in the beginning and 62.9MB in the end (delta: 15.6MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2022-07-13 18:13:15,401 INFO L158 Benchmark]: TraceAbstraction took 21856.51ms. Allocated memory was 117.4MB in the beginning and 625.0MB in the end (delta: 507.5MB). Free memory was 62.3MB in the beginning and 463.3MB in the end (delta: -400.9MB). Peak memory consumption was 362.0MB. Max. memory is 16.1GB. [2022-07-13 18:13:15,401 INFO L158 Benchmark]: Witness Printer took 51.75ms. Allocated memory is still 625.0MB. Free memory was 462.2MB in the beginning and 457.0MB in the end (delta: 5.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2022-07-13 18:13:15,404 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.15ms. Allocated memory is still 88.1MB. Free memory was 60.4MB in the beginning and 60.4MB in the end (delta: 41.1kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 161.62ms. Allocated memory is still 117.4MB. Free memory was 94.3MB in the beginning and 82.0MB in the end (delta: 12.3MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 23.36ms. Allocated memory is still 117.4MB. Free memory was 82.0MB in the beginning and 80.0MB in the end (delta: 2.0MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 14.86ms. Allocated memory is still 117.4MB. Free memory was 80.0MB in the beginning and 78.5MB in the end (delta: 1.5MB). There was no memory consumed. Max. memory is 16.1GB. * RCFGBuilder took 337.35ms. Allocated memory is still 117.4MB. Free memory was 78.5MB in the beginning and 62.9MB in the end (delta: 15.6MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * TraceAbstraction took 21856.51ms. Allocated memory was 117.4MB in the beginning and 625.0MB in the end (delta: 507.5MB). Free memory was 62.3MB in the beginning and 463.3MB in the end (delta: -400.9MB). Peak memory consumption was 362.0MB. Max. memory is 16.1GB. * Witness Printer took 51.75ms. Allocated memory is still 625.0MB. Free memory was 462.2MB in the beginning and 457.0MB in the end (delta: 5.2MB). Peak memory consumption was 4.2MB. 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 - PositiveResult [Line: 20]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 7 procedures, 107 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 21.7s, OverallIterations: 16, TraceHistogramMax: 4, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.1s, AutomataDifference: 4.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 11.7s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 3539 SdHoareTripleChecker+Valid, 2.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 3427 mSDsluCounter, 6603 SdHoareTripleChecker+Invalid, 1.7s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 3794 mSDsCounter, 653 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 3424 IncrementalHoareTripleChecker+Invalid, 4077 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 653 mSolverCounterUnsat, 2809 mSDtfsCounter, 3424 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 1601 GetRequests, 1451 SyntacticMatches, 4 SemanticMatches, 146 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 192 ImplicationChecksByTransitivity, 0.8s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=3350occurred in iteration=8, InterpolantAutomatonStates: 123, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 1.2s AutomataMinimizationTime, 16 MinimizatonAttempts, 2416 StatesRemovedByMinimization, 14 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 43 LocationsWithAnnotation, 5313 PreInvPairs, 6028 NumberOfFragments, 6978 HoareAnnotationTreeSize, 5313 FomulaSimplifications, 13474 FormulaSimplificationTreeSizeReduction, 2.9s HoareSimplificationTime, 43 FomulaSimplificationsInter, 159673 FormulaSimplificationTreeSizeReductionInter, 8.6s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.2s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 1.6s InterpolantComputationTime, 2887 NumberOfCodeBlocks, 2887 NumberOfCodeBlocksAsserted, 25 NumberOfCheckSat, 2862 ConstructedInterpolants, 0 QuantifiedInterpolants, 4660 SizeOfPredicates, 6 NumberOfNonLiveVariables, 3527 ConjunctsInSsa, 38 ConjunctsInUnsatCore, 25 InterpolantComputations, 16 PerfectInterpolantSequences, 1398/1568 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 - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 120]: Loop Invariant Derived loop invariant: (((((((((((((((!(2 <= T1_E) || !(t1_pc <= 0)) || !(m_pc == 0)) || !(2 <= E_M)) || E_1 == 0) || !(token == local)) || (((((0 <= \result && \result <= 0) && \old(t1_st) == t1_st) && m_st == \old(m_st)) && 0 <= __retres1) && __retres1 <= 0)) && (((((((!(2 <= T1_E) || !(t1_pc == 1)) || !(m_pc == 0)) || \old(t1_st) == 0) || !(2 <= E_M)) || !(\old(m_st) == 0)) || !(2 <= E_1)) || (((((0 <= \result && \result <= 0) && \old(t1_st) == t1_st) && m_st == \old(m_st)) && 0 <= __retres1) && __retres1 <= 0))) && (((((((!(2 <= \old(m_st)) || !(2 <= T1_E)) || !(t1_pc <= 0)) || !(2 <= E_M)) || !(1 <= m_pc)) || !(2 <= E_1)) || !(token == local)) || (((((0 <= \result && \result <= 0) && \old(t1_st) == t1_st) && m_st == \old(m_st)) && 0 <= __retres1) && __retres1 <= 0))) && (((((((((!(2 <= T1_E) || !(t1_pc == 1)) || \old(t1_st) == 0) || !(2 <= E_M)) || !(local < token)) || !(1 <= m_pc)) || !(\old(m_st) == 0)) || !(2 <= E_1)) || !(token <= local + 1)) || (((((0 <= \result && \result <= 0) && \old(t1_st) == t1_st) && m_st == \old(m_st)) && 0 <= __retres1) && __retres1 <= 0))) && (((((((!(2 <= \old(m_st)) || !(2 <= T1_E)) || !(t1_pc == 1)) || \old(t1_st) == 0) || !(2 <= E_M)) || !(1 <= m_pc)) || !(2 <= E_1)) || (((((0 <= \result && \result <= 0) && \old(t1_st) == t1_st) && m_st == \old(m_st)) && 0 <= __retres1) && __retres1 <= 0))) && (((((((!(2 <= \old(m_st)) || !(2 <= T1_E)) || !(t1_pc == 1)) || !(2 <= E_M)) || !(1 <= m_pc)) || !(2 <= E_1)) || !(token == local)) || (((((0 <= \result && \result <= 0) && \old(t1_st) == t1_st) && m_st == \old(m_st)) && 0 <= __retres1) && __retres1 <= 0))) && (((((((!(2 <= T1_E) || !(t1_pc == 1)) || !(m_pc == 0)) || \old(t1_st) == 0) || !(2 <= E_M)) || E_1 == 0) || !(token == local)) || (((((0 <= \result && \result <= 0) && \old(t1_st) == t1_st) && m_st == \old(m_st)) && 0 <= __retres1) && __retres1 <= 0))) && (((((((!(2 <= T1_E) || !(t1_pc == 1)) || \old(t1_st) == 0) || !(2 <= E_M)) || !(1 <= m_pc)) || E_1 == 0) || !(token == local)) || (((((0 <= \result && \result <= 0) && \old(t1_st) == t1_st) && m_st == \old(m_st)) && 0 <= __retres1) && __retres1 <= 0))) && (((((!(2 <= \old(m_st)) || !(2 <= T1_E)) || !(t1_pc == 1)) || !(m_pc == 0)) || !(2 <= E_1)) || (((((0 <= \result && \result <= 0) && \old(t1_st) == t1_st) && m_st == \old(m_st)) && 0 <= __retres1) && __retres1 <= 0))) && ((((((((!(2 <= \old(m_st)) || !(2 <= T1_E)) || (\old(t1_st) == t1_st && m_st == \old(m_st))) || !(t1_pc == 1)) || \old(t1_st) == 0) || !(local < token)) || !(1 <= m_pc)) || !(2 <= E_1)) || !(token <= local + 1))) && ((((((!(2 <= \old(m_st)) || !(2 <= T1_E)) || !(t1_pc <= 0)) || !(m_pc == 0)) || !(2 <= E_M)) || !(2 <= E_1)) || (((((0 <= \result && \result <= 0) && \old(t1_st) == t1_st) && m_st == \old(m_st)) && 0 <= __retres1) && __retres1 <= 0)) - InvariantResult [Line: 210]: Loop Invariant Derived loop invariant: ((((((((((((t1_pc == 1 && 2 <= E_1) && 2 <= E_M) && 2 <= m_st) && 1 <= m_pc) && 2 <= T1_E) && token == local) || (((((2 <= E_1 && 2 <= E_M) && 2 <= m_st) && t1_pc <= 0) && 2 <= T1_E) && m_pc == 0)) || ((((((2 <= E_1 && 2 <= E_M) && 2 <= m_st) && t1_pc <= 0) && 1 <= m_pc) && 2 <= T1_E) && token == local)) || ((((((t1_pc == 1 && 2 <= E_1) && 2 <= E_M) && m_st == 0) && 2 <= T1_E) && m_pc == 0) && !(t1_st == 0))) || ((((((2 <= E_1 && 2 <= E_M) && m_st == 0) && t1_pc <= 0) && 2 <= T1_E) && m_pc == 0) && token == local)) || ((((((((t1_pc == 1 && 2 <= E_1) && 2 <= E_M) && m_st == 0) && token <= local + 1) && 1 <= m_pc) && 2 <= T1_E) && !(t1_st == 0)) && local < token)) || (((((t1_pc == 1 && 2 <= E_1) && 2 <= E_M) && 2 <= m_st) && 2 <= T1_E) && m_pc == 0)) || ((((((t1_pc == 1 && 2 <= E_1) && 2 <= E_M) && 2 <= m_st) && 1 <= m_pc) && 2 <= T1_E) && !(t1_st == 0)) - InvariantResult [Line: 166]: Loop Invariant Derived loop invariant: ((((((T1_E == M_E && 2 <= E_1) && 2 <= m_st) && t1_pc <= 0) && m_pc == 0) && E_M == M_E) && M_E == 2) || (((((((T1_E == M_E && 2 <= E_1) && m_st == 0) && t1_pc <= 0) && m_pc == 0) && E_M == M_E) && token == local) && M_E == 2) - InvariantResult [Line: 204]: Loop Invariant Derived loop invariant: ((((((((((((t1_pc == 1 && 2 <= E_1) && 2 <= E_M) && 2 <= m_st) && 1 <= m_pc) && 2 <= T1_E) && token == local) || (((((2 <= E_1 && 2 <= E_M) && 2 <= m_st) && t1_pc <= 0) && 2 <= T1_E) && m_pc == 0)) || ((((((2 <= E_1 && 2 <= E_M) && 2 <= m_st) && t1_pc <= 0) && 1 <= m_pc) && 2 <= T1_E) && token == local)) || ((((((t1_pc == 1 && 2 <= E_1) && 2 <= E_M) && m_st == 0) && 2 <= T1_E) && m_pc == 0) && !(t1_st == 0))) || ((((((2 <= E_1 && 2 <= E_M) && m_st == 0) && t1_pc <= 0) && 2 <= T1_E) && m_pc == 0) && token == local)) || ((((((((t1_pc == 1 && 2 <= E_1) && 2 <= E_M) && m_st == 0) && token <= local + 1) && 1 <= m_pc) && 2 <= T1_E) && !(t1_st == 0)) && local < token)) || (((((t1_pc == 1 && 2 <= E_1) && 2 <= E_M) && 2 <= m_st) && 2 <= T1_E) && m_pc == 0)) || ((((((t1_pc == 1 && 2 <= E_1) && 2 <= E_M) && 2 <= m_st) && 1 <= m_pc) && 2 <= T1_E) && !(t1_st == 0)) - InvariantResult [Line: 142]: Loop Invariant Derived loop invariant: (((((((((((((((((((((((((((0 <= \result && \result <= 0) && \old(t1_st) == t1_st) && 0 < tmp + 1) && m_st == \old(m_st)) && 0 <= __retres1) && tmp <= 0) && __retres1 <= 0) && __retres1 <= 0) && 0 <= __retres1) || !(2 <= T1_E)) || !(t1_pc == 1)) || \old(t1_st) == 0) || !(2 <= E_M)) || !(local < token)) || !(1 <= m_pc)) || !(\old(m_st) == 0)) || !(2 <= E_1)) || !(token <= local + 1)) && (((((((!(2 <= T1_E) || !(t1_pc == 1)) || !(m_pc == 0)) || \old(t1_st) == 0) || !(2 <= E_M)) || E_1 == 0) || (((((((0 <= \result && \result <= 0) && \old(t1_st) == t1_st) && 0 < tmp + 1) && m_st == \old(m_st)) && 0 <= __retres1) && tmp <= 0) && __retres1 <= 0)) || !(token == local))) && ((((((((((((((((0 <= \result && \result <= 0) && \old(t1_st) == t1_st) && 0 < tmp + 1) && m_st == \old(m_st)) && 0 <= __retres1) && tmp <= 0) && __retres1 <= 0) && __retres1 <= 0) && 0 <= __retres1) || !(2 <= \old(m_st))) || !(2 <= T1_E)) || !(t1_pc <= 0)) || !(2 <= E_M)) || !(1 <= m_pc)) || !(2 <= E_1)) || !(token == local))) && (((((!(2 <= \old(m_st)) || !(2 <= T1_E)) || !(t1_pc == 1)) || !(m_pc == 0)) || ((((((0 <= \result && \result <= 0) && 0 < tmp + 1) && 2 <= m_st) && 0 <= __retres1) && tmp <= 0) && __retres1 <= 0)) || !(2 <= E_1))) && ((((((!(2 <= \old(m_st)) || !(2 <= T1_E)) || !(t1_pc <= 0)) || !(m_pc == 0)) || !(2 <= E_M)) || ((((((0 <= \result && \result <= 0) && 0 < tmp + 1) && 2 <= m_st) && 0 <= __retres1) && tmp <= 0) && __retres1 <= 0)) || !(2 <= E_1))) && ((((((((((((((\old(t1_st) == t1_st && 0 < tmp + 1) && m_st == \old(m_st)) && tmp <= 0) && __retres1 <= 0) && 0 <= __retres1) || !(2 <= \old(m_st))) || !(2 <= T1_E)) || !(t1_pc == 1)) || \old(t1_st) == 0) || !(local < token)) || !(1 <= m_pc)) || (((m_st == 0 && __retres1 <= 0) && !(t1_st == 0)) && 0 <= __retres1)) || !(2 <= E_1)) || !(token <= local + 1))) && ((((((((((((((((0 <= \result && \result <= 0) && \old(t1_st) == t1_st) && 0 < tmp + 1) && m_st == \old(m_st)) && 0 <= __retres1) && tmp <= 0) && __retres1 <= 0) && __retres1 <= 0) && 0 <= __retres1) || !(2 <= T1_E)) || !(t1_pc == 1)) || !(m_pc == 0)) || \old(t1_st) == 0) || !(2 <= E_M)) || !(\old(m_st) == 0)) || !(2 <= E_1))) && (((((((((((((((0 <= \result && \result <= 0) && \old(t1_st) == t1_st) && 0 < tmp + 1) && m_st == \old(m_st)) && 0 <= __retres1) && tmp <= 0) && __retres1 <= 0) && __retres1 <= 0) && 0 <= __retres1) || !(2 <= T1_E)) || !(t1_pc <= 0)) || !(m_pc == 0)) || !(2 <= E_M)) || E_1 == 0) || !(token == local))) && ((((((((((((((((0 <= \result && \result <= 0) && \old(t1_st) == t1_st) && 0 < tmp + 1) && m_st == \old(m_st)) && 0 <= __retres1) && tmp <= 0) && __retres1 <= 0) && __retres1 <= 0) && 0 <= __retres1) || !(2 <= \old(m_st))) || !(2 <= T1_E)) || !(t1_pc == 1)) || \old(t1_st) == 0) || !(2 <= E_M)) || !(1 <= m_pc)) || !(2 <= E_1))) && ((((((((((((((((0 <= \result && \result <= 0) && \old(t1_st) == t1_st) && 0 < tmp + 1) && m_st == \old(m_st)) && 0 <= __retres1) && tmp <= 0) && __retres1 <= 0) && __retres1 <= 0) && 0 <= __retres1) || !(2 <= \old(m_st))) || !(2 <= T1_E)) || !(t1_pc == 1)) || !(2 <= E_M)) || !(1 <= m_pc)) || !(2 <= E_1)) || !(token == local))) && (((((((!(2 <= T1_E) || !(t1_pc == 1)) || \old(t1_st) == 0) || !(2 <= E_M)) || !(1 <= m_pc)) || E_1 == 0) || (((((((0 <= \result && \result <= 0) && \old(t1_st) == t1_st) && 0 < tmp + 1) && m_st == \old(m_st)) && 0 <= __retres1) && tmp <= 0) && __retres1 <= 0)) || !(token == local)) - InvariantResult [Line: 425]: Loop Invariant Derived loop invariant: ((((((((((((t1_pc == 1 && 2 <= E_1) && 2 <= E_M) && 2 <= m_st) && 1 <= m_pc) && 2 <= T1_E) && token == local) || (((((2 <= E_1 && 2 <= E_M) && 2 <= m_st) && t1_pc <= 0) && 2 <= T1_E) && m_pc == 0)) || ((((((2 <= E_1 && 2 <= E_M) && 2 <= m_st) && t1_pc <= 0) && 1 <= m_pc) && 2 <= T1_E) && token == local)) || ((((((t1_pc == 1 && 2 <= E_1) && 2 <= E_M) && m_st == 0) && 2 <= T1_E) && m_pc == 0) && !(t1_st == 0))) || ((((((2 <= E_1 && 2 <= E_M) && m_st == 0) && t1_pc <= 0) && 2 <= T1_E) && m_pc == 0) && token == local)) || ((((((((t1_pc == 1 && 2 <= E_1) && 2 <= E_M) && m_st == 0) && token <= local + 1) && 1 <= m_pc) && 2 <= T1_E) && !(t1_st == 0)) && local < token)) || (((((t1_pc == 1 && 2 <= E_1) && 2 <= E_M) && 2 <= m_st) && 2 <= T1_E) && m_pc == 0)) || ((((((t1_pc == 1 && 2 <= E_1) && 2 <= E_M) && 2 <= m_st) && 1 <= m_pc) && 2 <= T1_E) && !(t1_st == 0)) - InvariantResult [Line: 398]: Loop Invariant Derived loop invariant: ((((((((((((t1_pc == 1 && 2 <= E_1) && 2 <= E_M) && 2 <= m_st) && 1 <= m_pc) && 2 <= T1_E) && token == local) || (((((2 <= E_1 && 2 <= E_M) && 2 <= m_st) && t1_pc <= 0) && 2 <= T1_E) && m_pc == 0)) || ((((((2 <= E_1 && 2 <= E_M) && 2 <= m_st) && t1_pc <= 0) && 1 <= m_pc) && 2 <= T1_E) && token == local)) || ((((((t1_pc == 1 && 2 <= E_1) && 2 <= E_M) && m_st == 0) && 2 <= T1_E) && m_pc == 0) && !(t1_st == 0))) || ((((((2 <= E_1 && 2 <= E_M) && m_st == 0) && t1_pc <= 0) && 2 <= T1_E) && m_pc == 0) && token == local)) || ((((((((t1_pc == 1 && 2 <= E_1) && 2 <= E_M) && m_st == 0) && token <= local + 1) && 1 <= m_pc) && 2 <= T1_E) && !(t1_st == 0)) && local < token)) || (((((t1_pc == 1 && 2 <= E_1) && 2 <= E_M) && 2 <= m_st) && 2 <= T1_E) && m_pc == 0)) || ((((((t1_pc == 1 && 2 <= E_1) && 2 <= E_M) && 2 <= m_st) && 1 <= m_pc) && 2 <= T1_E) && !(t1_st == 0)) - InvariantResult [Line: 472]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 40]: Loop Invariant Derived loop invariant: ((((((t1_pc == 1 && 2 <= E_1) && 2 <= E_M) && 2 <= m_st) && 1 <= m_pc) && 2 <= T1_E) && token == local) || ((((((2 <= E_1 && 2 <= E_M) && 2 <= m_st) && t1_pc <= 0) && 1 <= m_pc) && 2 <= T1_E) && token == local) - InvariantResult [Line: 139]: Loop Invariant Derived loop invariant: ((((((((((((((((!(2 <= T1_E) || !(t1_pc == 1)) || !(m_pc == 0)) || \old(t1_st) == 0) || !(2 <= E_M)) || E_1 == 0) || (((((((0 <= \result && \result <= 0) && \old(t1_st) == t1_st) && 0 < tmp + 1) && m_st == \old(m_st)) && 0 <= __retres1) && tmp <= 0) && __retres1 <= 0)) || !(token == local)) && (((((!(2 <= \old(m_st)) || !(2 <= T1_E)) || !(t1_pc == 1)) || !(m_pc == 0)) || ((((((0 <= \result && \result <= 0) && 0 < tmp + 1) && 2 <= m_st) && 0 <= __retres1) && tmp <= 0) && __retres1 <= 0)) || !(2 <= E_1))) && ((((((!(2 <= \old(m_st)) || !(2 <= T1_E)) || !(t1_pc <= 0)) || !(m_pc == 0)) || !(2 <= E_M)) || ((((((0 <= \result && \result <= 0) && 0 < tmp + 1) && 2 <= m_st) && 0 <= __retres1) && tmp <= 0) && __retres1 <= 0)) || !(2 <= E_1))) && (((((((!(2 <= T1_E) || !(t1_pc == 1)) || !(m_pc == 0)) || \old(t1_st) == 0) || !(2 <= E_M)) || !(\old(m_st) == 0)) || (((((((((((0 <= \result && \result <= 0) && \old(t1_st) == t1_st) && 0 < tmp + 1) && m_st == \old(m_st)) && 0 <= __retres1) && \result <= 0) && tmp <= 0) && __retres1 <= 0) && __retres1 <= 0) && 0 <= \result) && 0 <= __retres1)) || !(2 <= E_1))) && (((((((((!(2 <= T1_E) || !(t1_pc == 1)) || \old(t1_st) == 0) || !(2 <= E_M)) || !(local < token)) || !(1 <= m_pc)) || !(\old(m_st) == 0)) || (((((((((((0 <= \result && \result <= 0) && \old(t1_st) == t1_st) && 0 < tmp + 1) && m_st == \old(m_st)) && 0 <= __retres1) && \result <= 0) && tmp <= 0) && __retres1 <= 0) && __retres1 <= 0) && 0 <= \result) && 0 <= __retres1)) || !(2 <= E_1)) || !(token <= local + 1))) && ((((((((((((((((\old(t1_st) == t1_st && 0 < tmp + 1) && m_st == \old(m_st)) && \result <= 0) && tmp <= 0) && __retres1 <= 0) && 0 <= \result) && 0 <= __retres1) || (((((m_st == 0 && \result <= 0) && __retres1 <= 0) && !(t1_st == 0)) && 0 <= \result) && 0 <= __retres1)) || !(2 <= \old(m_st))) || !(2 <= T1_E)) || !(t1_pc == 1)) || \old(t1_st) == 0) || !(local < token)) || !(1 <= m_pc)) || !(2 <= E_1)) || !(token <= local + 1))) && (((((((!(2 <= \old(m_st)) || !(2 <= T1_E)) || !(t1_pc <= 0)) || !(2 <= E_M)) || !(1 <= m_pc)) || (((((((((((0 <= \result && \result <= 0) && \old(t1_st) == t1_st) && 0 < tmp + 1) && m_st == \old(m_st)) && 0 <= __retres1) && \result <= 0) && tmp <= 0) && __retres1 <= 0) && __retres1 <= 0) && 0 <= \result) && 0 <= __retres1)) || !(2 <= E_1)) || !(token == local))) && (((((((!(2 <= \old(m_st)) || !(2 <= T1_E)) || !(t1_pc == 1)) || !(2 <= E_M)) || !(1 <= m_pc)) || (((((((((((0 <= \result && \result <= 0) && \old(t1_st) == t1_st) && 0 < tmp + 1) && m_st == \old(m_st)) && 0 <= __retres1) && \result <= 0) && tmp <= 0) && __retres1 <= 0) && __retres1 <= 0) && 0 <= \result) && 0 <= __retres1)) || !(2 <= E_1)) || !(token == local))) && (((((((!(2 <= \old(m_st)) || !(2 <= T1_E)) || !(t1_pc == 1)) || \old(t1_st) == 0) || !(2 <= E_M)) || !(1 <= m_pc)) || (((((((((((0 <= \result && \result <= 0) && \old(t1_st) == t1_st) && 0 < tmp + 1) && m_st == \old(m_st)) && 0 <= __retres1) && \result <= 0) && tmp <= 0) && __retres1 <= 0) && __retres1 <= 0) && 0 <= \result) && 0 <= __retres1)) || !(2 <= E_1))) && (((((((!(2 <= T1_E) || !(t1_pc == 1)) || \old(t1_st) == 0) || !(2 <= E_M)) || !(1 <= m_pc)) || E_1 == 0) || (((((((0 <= \result && \result <= 0) && \old(t1_st) == t1_st) && 0 < tmp + 1) && m_st == \old(m_st)) && 0 <= __retres1) && tmp <= 0) && __retres1 <= 0)) || !(token == local))) && ((((((!(2 <= T1_E) || !(t1_pc <= 0)) || !(m_pc == 0)) || !(2 <= E_M)) || (((((((((((0 <= \result && \result <= 0) && \old(t1_st) == t1_st) && 0 < tmp + 1) && m_st == \old(m_st)) && 0 <= __retres1) && \result <= 0) && tmp <= 0) && __retres1 <= 0) && __retres1 <= 0) && 0 <= \result) && 0 <= __retres1)) || E_1 == 0) || !(token == local)) - InvariantResult [Line: 43]: Loop Invariant Derived loop invariant: ((((((2 <= E_1 && 2 <= E_M) && t1_pc <= 0) && 2 <= T1_E) && m_pc == 0) && token == local) || (((((t1_pc == 1 && 2 <= E_1) && 2 <= E_M) && 1 <= m_pc) && 2 <= T1_E) && !(t1_st == 0))) || (((((t1_pc == 1 && 2 <= E_1) && 2 <= E_M) && 2 <= T1_E) && m_pc == 0) && !(t1_st == 0)) - InvariantResult [Line: 87]: Loop Invariant Derived loop invariant: (((((t1_pc == 1 && 2 <= E_1) && 2 <= E_M) && 2 <= m_st) && 2 <= T1_E) && m_pc == 0) || (((((((t1_pc == 1 && 2 <= E_1) && 2 <= E_M) && 2 <= m_st) && 1 <= m_pc) && 2 <= T1_E) && !(t1_st == 0)) && token == local) - InvariantResult [Line: 84]: Loop Invariant Derived loop invariant: ((((((((t1_pc == 1 && 2 <= E_1) && 2 <= E_M) && m_st == 0) && 2 <= T1_E) && m_pc == 0) && !(t1_st == 0)) || ((((((((t1_pc == 1 && 2 <= E_1) && 2 <= E_M) && m_st == 0) && token <= local + 1) && 1 <= m_pc) && 2 <= T1_E) && !(t1_st == 0)) && local < token)) || (((((t1_pc == 1 && 2 <= E_1) && 2 <= E_M) && 2 <= m_st) && 2 <= T1_E) && m_pc == 0)) || ((((((t1_pc == 1 && 2 <= E_1) && 2 <= E_M) && 2 <= m_st) && 1 <= m_pc) && 2 <= T1_E) && !(t1_st == 0)) - InvariantResult [Line: 347]: Loop Invariant Derived loop invariant: ((((((((((((t1_pc == 1 && 2 <= E_1) && 2 <= E_M) && 2 <= m_st) && 1 <= m_pc) && 2 <= T1_E) && token == local) || (((((2 <= E_1 && 2 <= E_M) && 2 <= m_st) && t1_pc <= 0) && 2 <= T1_E) && m_pc == 0)) || ((((((2 <= E_1 && 2 <= E_M) && 2 <= m_st) && t1_pc <= 0) && 1 <= m_pc) && 2 <= T1_E) && token == local)) || ((((((t1_pc == 1 && 2 <= E_1) && 2 <= E_M) && m_st == 0) && 2 <= T1_E) && m_pc == 0) && !(t1_st == 0))) || ((((((2 <= E_1 && 2 <= E_M) && m_st == 0) && t1_pc <= 0) && 2 <= T1_E) && m_pc == 0) && token == local)) || ((((((((t1_pc == 1 && 2 <= E_1) && 2 <= E_M) && m_st == 0) && token <= local + 1) && 1 <= m_pc) && 2 <= T1_E) && !(t1_st == 0)) && local < token)) || (((((t1_pc == 1 && 2 <= E_1) && 2 <= E_M) && 2 <= m_st) && 2 <= T1_E) && m_pc == 0)) || ((((((t1_pc == 1 && 2 <= E_1) && 2 <= E_M) && 2 <= m_st) && 1 <= m_pc) && 2 <= T1_E) && !(t1_st == 0)) - InvariantResult [Line: 187]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 413]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 16]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 87]: Loop Invariant Derived loop invariant: (((((((2 <= E_1 && 2 <= E_M) && 2 <= m_st) && 1 <= m_pc) && 2 <= T1_E) && !(t1_st == 0)) || ((((2 <= E_1 && 2 <= E_M) && 2 <= m_st) && 2 <= T1_E) && m_pc == 0)) || (((((2 <= E_1 && 2 <= E_M) && m_st == 0) && 2 <= T1_E) && m_pc == 0) && !(t1_st == 0))) || (((((((2 <= E_1 && 2 <= E_M) && m_st == 0) && token <= local + 1) && 1 <= m_pc) && 2 <= T1_E) && !(t1_st == 0)) && local < token) - InvariantResult [Line: 394]: Loop Invariant Derived loop invariant: ((((((((((((t1_pc == 1 && 2 <= E_1) && 2 <= E_M) && 2 <= m_st) && 1 <= m_pc) && 2 <= T1_E) && token == local) || (((((2 <= E_1 && 2 <= E_M) && 2 <= m_st) && t1_pc <= 0) && 2 <= T1_E) && m_pc == 0)) || ((((((2 <= E_1 && 2 <= E_M) && 2 <= m_st) && t1_pc <= 0) && 1 <= m_pc) && 2 <= T1_E) && token == local)) || ((((((t1_pc == 1 && 2 <= E_1) && 2 <= E_M) && m_st == 0) && 2 <= T1_E) && m_pc == 0) && !(t1_st == 0))) || ((((((2 <= E_1 && 2 <= E_M) && m_st == 0) && t1_pc <= 0) && 2 <= T1_E) && m_pc == 0) && token == local)) || ((((((((t1_pc == 1 && 2 <= E_1) && 2 <= E_M) && m_st == 0) && token <= local + 1) && 1 <= m_pc) && 2 <= T1_E) && !(t1_st == 0)) && local < token)) || (((((t1_pc == 1 && 2 <= E_1) && 2 <= E_M) && 2 <= m_st) && 2 <= T1_E) && m_pc == 0)) || ((((((t1_pc == 1 && 2 <= E_1) && 2 <= E_M) && 2 <= m_st) && 1 <= m_pc) && 2 <= T1_E) && !(t1_st == 0)) - InvariantResult [Line: 123]: Loop Invariant Derived loop invariant: (((((((((((((((!(2 <= \old(m_st)) || !(2 <= T1_E)) || !(t1_pc <= 0)) || !(m_pc == 0)) || !(2 <= E_M)) || (((\old(t1_st) == t1_st && m_st == \old(m_st)) && 0 <= __retres1) && __retres1 <= 0)) || !(2 <= E_1)) && (((((((!(2 <= T1_E) || !(t1_pc == 1)) || !(m_pc == 0)) || \old(t1_st) == 0) || !(2 <= E_M)) || (((\old(t1_st) == t1_st && m_st == \old(m_st)) && 0 <= __retres1) && __retres1 <= 0)) || !(\old(m_st) == 0)) || !(2 <= E_1))) && (((((((!(2 <= \old(m_st)) || !(2 <= T1_E)) || !(t1_pc == 1)) || !(2 <= E_M)) || (((\old(t1_st) == t1_st && m_st == \old(m_st)) && 0 <= __retres1) && __retres1 <= 0)) || !(1 <= m_pc)) || !(2 <= E_1)) || !(token == local))) && (((((((!(2 <= \old(m_st)) || !(2 <= T1_E)) || !(t1_pc <= 0)) || !(2 <= E_M)) || (((\old(t1_st) == t1_st && m_st == \old(m_st)) && 0 <= __retres1) && __retres1 <= 0)) || !(1 <= m_pc)) || !(2 <= E_1)) || !(token == local))) && (((((((((!(2 <= T1_E) || !(t1_pc == 1)) || \old(t1_st) == 0) || !(2 <= E_M)) || !(local < token)) || (((\old(t1_st) == t1_st && m_st == \old(m_st)) && 0 <= __retres1) && __retres1 <= 0)) || !(1 <= m_pc)) || !(\old(m_st) == 0)) || !(2 <= E_1)) || !(token <= local + 1))) && (((((((!(2 <= T1_E) || !(t1_pc == 1)) || \old(t1_st) == 0) || !(2 <= E_M)) || (((\old(t1_st) == t1_st && m_st == \old(m_st)) && 0 <= __retres1) && __retres1 <= 0)) || !(1 <= m_pc)) || E_1 == 0) || !(token == local))) && ((((((!(2 <= T1_E) || !(t1_pc <= 0)) || !(m_pc == 0)) || !(2 <= E_M)) || (((\old(t1_st) == t1_st && m_st == \old(m_st)) && 0 <= __retres1) && __retres1 <= 0)) || E_1 == 0) || !(token == local))) && (((((((!(2 <= T1_E) || !(t1_pc == 1)) || !(m_pc == 0)) || \old(t1_st) == 0) || !(2 <= E_M)) || (((\old(t1_st) == t1_st && m_st == \old(m_st)) && 0 <= __retres1) && __retres1 <= 0)) || E_1 == 0) || !(token == local))) && (((((((!(2 <= \old(m_st)) || !(2 <= T1_E)) || !(t1_pc == 1)) || \old(t1_st) == 0) || !(2 <= E_M)) || (((\old(t1_st) == t1_st && m_st == \old(m_st)) && 0 <= __retres1) && __retres1 <= 0)) || !(1 <= m_pc)) || !(2 <= E_1))) && (((((!(2 <= \old(m_st)) || !(2 <= T1_E)) || !(t1_pc == 1)) || !(m_pc == 0)) || (((\old(t1_st) == t1_st && m_st == \old(m_st)) && 0 <= __retres1) && __retres1 <= 0)) || !(2 <= E_1))) && ((((((((!(2 <= \old(m_st)) || !(2 <= T1_E)) || (\old(t1_st) == t1_st && m_st == \old(m_st))) || !(t1_pc == 1)) || \old(t1_st) == 0) || !(local < token)) || !(1 <= m_pc)) || !(2 <= E_1)) || !(token <= local + 1)) - InvariantResult [Line: 356]: Loop Invariant Derived loop invariant: ((((((((((((t1_pc == 1 && 2 <= E_1) && 2 <= E_M) && 2 <= m_st) && 1 <= m_pc) && 2 <= T1_E) && token == local) || (((((2 <= E_1 && 2 <= E_M) && 2 <= m_st) && t1_pc <= 0) && 2 <= T1_E) && m_pc == 0)) || ((((((2 <= E_1 && 2 <= E_M) && 2 <= m_st) && t1_pc <= 0) && 1 <= m_pc) && 2 <= T1_E) && token == local)) || ((((((t1_pc == 1 && 2 <= E_1) && 2 <= E_M) && m_st == 0) && 2 <= T1_E) && m_pc == 0) && !(t1_st == 0))) || ((((((2 <= E_1 && 2 <= E_M) && m_st == 0) && t1_pc <= 0) && 2 <= T1_E) && m_pc == 0) && token == local)) || ((((((((t1_pc == 1 && 2 <= E_1) && 2 <= E_M) && m_st == 0) && token <= local + 1) && 1 <= m_pc) && 2 <= T1_E) && !(t1_st == 0)) && local < token)) || (((((t1_pc == 1 && 2 <= E_1) && 2 <= E_M) && 2 <= m_st) && 2 <= T1_E) && m_pc == 0)) || ((((((t1_pc == 1 && 2 <= E_1) && 2 <= E_M) && 2 <= m_st) && 1 <= m_pc) && 2 <= T1_E) && !(t1_st == 0)) - InvariantResult [Line: 43]: Loop Invariant Derived loop invariant: ((((((t1_pc == 1 && 2 <= E_1) && 2 <= E_M) && token <= local + 1) && 1 <= m_pc) && 2 <= T1_E) && !(t1_st == 0)) && local < token - InvariantResult [Line: 384]: Loop Invariant Derived loop invariant: ((((((T1_E == M_E && 2 <= E_1) && m_st == 0) && t1_pc <= 0) && m_pc == 0) && E_M == M_E) && token == local) && M_E == 2 RESULT: Ultimate proved your program to be correct! [2022-07-13 18:13:15,449 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE