./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/systemc/token_ring.01.cil-2.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-2.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 327bb4ad7f981d20a6e5212aac300a9249d1857b0280531d57d587d5a0195c5f --- Real Ultimate output --- This is Ultimate 0.2.2-?-f4b24e3 [2022-07-13 18:13:14,735 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-07-13 18:13:14,737 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-07-13 18:13:14,776 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-07-13 18:13:14,777 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-07-13 18:13:14,778 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-07-13 18:13:14,779 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-07-13 18:13:14,781 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-07-13 18:13:14,782 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-07-13 18:13:14,786 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-07-13 18:13:14,786 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-07-13 18:13:14,788 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-07-13 18:13:14,788 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-07-13 18:13:14,790 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-07-13 18:13:14,790 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-07-13 18:13:14,793 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-07-13 18:13:14,793 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-07-13 18:13:14,794 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-07-13 18:13:14,795 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-07-13 18:13:14,799 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-07-13 18:13:14,801 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-07-13 18:13:14,802 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-07-13 18:13:14,802 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-07-13 18:13:14,803 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-07-13 18:13:14,804 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-07-13 18:13:14,809 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-07-13 18:13:14,809 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-07-13 18:13:14,809 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-07-13 18:13:14,810 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-07-13 18:13:14,811 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-07-13 18:13:14,812 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-07-13 18:13:14,812 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-07-13 18:13:14,813 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-07-13 18:13:14,814 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-07-13 18:13:14,814 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-07-13 18:13:14,815 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-07-13 18:13:14,815 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-07-13 18:13:14,815 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-07-13 18:13:14,816 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-07-13 18:13:14,816 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-07-13 18:13:14,817 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-07-13 18:13:14,818 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-07-13 18:13:14,819 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:13:14,842 INFO L113 SettingsManager]: Loading preferences was successful [2022-07-13 18:13:14,842 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-07-13 18:13:14,842 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-07-13 18:13:14,842 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-07-13 18:13:14,843 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-07-13 18:13:14,843 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-07-13 18:13:14,844 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-07-13 18:13:14,844 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-07-13 18:13:14,844 INFO L138 SettingsManager]: * Use SBE=true [2022-07-13 18:13:14,845 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-07-13 18:13:14,845 INFO L138 SettingsManager]: * sizeof long=4 [2022-07-13 18:13:14,845 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-07-13 18:13:14,845 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-07-13 18:13:14,845 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-07-13 18:13:14,846 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-07-13 18:13:14,846 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-07-13 18:13:14,846 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-07-13 18:13:14,846 INFO L138 SettingsManager]: * sizeof long double=12 [2022-07-13 18:13:14,846 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-07-13 18:13:14,847 INFO L138 SettingsManager]: * Use constant arrays=true [2022-07-13 18:13:14,847 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-07-13 18:13:14,847 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-07-13 18:13:14,847 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-07-13 18:13:14,848 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-07-13 18:13:14,848 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-13 18:13:14,848 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-07-13 18:13:14,848 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-07-13 18:13:14,848 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-07-13 18:13:14,848 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-07-13 18:13:14,848 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-07-13 18:13:14,849 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-07-13 18:13:14,849 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-07-13 18:13:14,849 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-07-13 18:13:14,849 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 -> 327bb4ad7f981d20a6e5212aac300a9249d1857b0280531d57d587d5a0195c5f [2022-07-13 18:13:15,026 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-07-13 18:13:15,043 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-07-13 18:13:15,045 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-07-13 18:13:15,045 INFO L271 PluginConnector]: Initializing CDTParser... [2022-07-13 18:13:15,046 INFO L275 PluginConnector]: CDTParser initialized [2022-07-13 18:13:15,047 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/systemc/token_ring.01.cil-2.c [2022-07-13 18:13:15,086 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/232694730/d1125e2ca39c4e1faf707c30454bf1c3/FLAGfa536a5e6 [2022-07-13 18:13:15,486 INFO L306 CDTParser]: Found 1 translation units. [2022-07-13 18:13:15,488 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/systemc/token_ring.01.cil-2.c [2022-07-13 18:13:15,497 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/232694730/d1125e2ca39c4e1faf707c30454bf1c3/FLAGfa536a5e6 [2022-07-13 18:13:15,509 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/232694730/d1125e2ca39c4e1faf707c30454bf1c3 [2022-07-13 18:13:15,511 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-07-13 18:13:15,512 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-07-13 18:13:15,514 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-07-13 18:13:15,514 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-07-13 18:13:15,517 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-07-13 18:13:15,517 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.07 06:13:15" (1/1) ... [2022-07-13 18:13:15,518 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@61572cf4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 06:13:15, skipping insertion in model container [2022-07-13 18:13:15,518 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.07 06:13:15" (1/1) ... [2022-07-13 18:13:15,522 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-07-13 18:13:15,550 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-07-13 18:13:15,729 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-2.c[671,684] [2022-07-13 18:13:15,775 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-13 18:13:15,784 INFO L203 MainTranslator]: Completed pre-run [2022-07-13 18:13:15,793 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-2.c[671,684] [2022-07-13 18:13:15,809 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-13 18:13:15,818 INFO L208 MainTranslator]: Completed translation [2022-07-13 18:13:15,819 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 06:13:15 WrapperNode [2022-07-13 18:13:15,819 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-07-13 18:13:15,820 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-07-13 18:13:15,820 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-07-13 18:13:15,820 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-07-13 18:13:15,824 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:13:15" (1/1) ... [2022-07-13 18:13:15,829 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:13:15" (1/1) ... [2022-07-13 18:13:15,845 INFO L137 Inliner]: procedures = 30, calls = 35, calls flagged for inlining = 13, calls inlined = 13, statements flattened = 220 [2022-07-13 18:13:15,848 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-07-13 18:13:15,848 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-07-13 18:13:15,848 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-07-13 18:13:15,848 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-07-13 18:13:15,853 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 06:13:15" (1/1) ... [2022-07-13 18:13:15,853 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 06:13:15" (1/1) ... [2022-07-13 18:13:15,855 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 06:13:15" (1/1) ... [2022-07-13 18:13:15,855 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 06:13:15" (1/1) ... [2022-07-13 18:13:15,858 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 06:13:15" (1/1) ... [2022-07-13 18:13:15,861 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 06:13:15" (1/1) ... [2022-07-13 18:13:15,862 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 06:13:15" (1/1) ... [2022-07-13 18:13:15,864 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-07-13 18:13:15,864 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-07-13 18:13:15,864 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-07-13 18:13:15,864 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-07-13 18:13:15,868 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 06:13:15" (1/1) ... [2022-07-13 18:13:15,885 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-13 18:13:15,893 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 18:13:15,901 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:13:15,903 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:13:15,923 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-07-13 18:13:15,923 INFO L130 BoogieDeclarations]: Found specification of procedure error [2022-07-13 18:13:15,923 INFO L138 BoogieDeclarations]: Found implementation of procedure error [2022-07-13 18:13:15,924 INFO L130 BoogieDeclarations]: Found specification of procedure fire_delta_events [2022-07-13 18:13:15,924 INFO L138 BoogieDeclarations]: Found implementation of procedure fire_delta_events [2022-07-13 18:13:15,924 INFO L130 BoogieDeclarations]: Found specification of procedure activate_threads [2022-07-13 18:13:15,924 INFO L138 BoogieDeclarations]: Found implementation of procedure activate_threads [2022-07-13 18:13:15,924 INFO L130 BoogieDeclarations]: Found specification of procedure immediate_notify [2022-07-13 18:13:15,924 INFO L138 BoogieDeclarations]: Found implementation of procedure immediate_notify [2022-07-13 18:13:15,924 INFO L130 BoogieDeclarations]: Found specification of procedure exists_runnable_thread [2022-07-13 18:13:15,924 INFO L138 BoogieDeclarations]: Found implementation of procedure exists_runnable_thread [2022-07-13 18:13:15,924 INFO L130 BoogieDeclarations]: Found specification of procedure reset_delta_events [2022-07-13 18:13:15,925 INFO L138 BoogieDeclarations]: Found implementation of procedure reset_delta_events [2022-07-13 18:13:15,925 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-07-13 18:13:15,925 INFO L130 BoogieDeclarations]: Found specification of procedure update_channels [2022-07-13 18:13:15,925 INFO L138 BoogieDeclarations]: Found implementation of procedure update_channels [2022-07-13 18:13:15,925 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-07-13 18:13:15,925 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-07-13 18:13:16,014 INFO L234 CfgBuilder]: Building ICFG [2022-07-13 18:13:16,015 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-07-13 18:13:16,312 INFO L275 CfgBuilder]: Performing block encoding [2022-07-13 18:13:16,319 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-07-13 18:13:16,320 INFO L299 CfgBuilder]: Removed 4 assume(true) statements. [2022-07-13 18:13:16,321 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.07 06:13:16 BoogieIcfgContainer [2022-07-13 18:13:16,321 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-07-13 18:13:16,322 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-07-13 18:13:16,322 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-07-13 18:13:16,326 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-07-13 18:13:16,326 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.07 06:13:15" (1/3) ... [2022-07-13 18:13:16,327 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@34705ed0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.07 06:13:16, skipping insertion in model container [2022-07-13 18:13:16,327 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 06:13:15" (2/3) ... [2022-07-13 18:13:16,327 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@34705ed0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.07 06:13:16, skipping insertion in model container [2022-07-13 18:13:16,328 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.07 06:13:16" (3/3) ... [2022-07-13 18:13:16,329 INFO L111 eAbstractionObserver]: Analyzing ICFG token_ring.01.cil-2.c [2022-07-13 18:13:16,338 INFO L201 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-07-13 18:13:16,339 INFO L160 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-07-13 18:13:16,383 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-07-13 18:13:16,388 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@1e445414, mLbeIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@3063e520 [2022-07-13 18:13:16,389 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-07-13 18:13:16,392 INFO L276 IsEmpty]: Start isEmpty. Operand has 115 states, 89 states have (on average 1.550561797752809) internal successors, (138), 93 states have internal predecessors, (138), 17 states have call successors, (17), 7 states have call predecessors, (17), 7 states have return successors, (17), 16 states have call predecessors, (17), 17 states have call successors, (17) [2022-07-13 18:13:16,403 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2022-07-13 18:13:16,403 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 18:13:16,404 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 18:13:16,404 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 18:13:16,408 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 18:13:16,408 INFO L85 PathProgramCache]: Analyzing trace with hash 1377578721, now seen corresponding path program 1 times [2022-07-13 18:13:16,414 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 18:13:16,414 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [176829124] [2022-07-13 18:13:16,415 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 18:13:16,415 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 18:13:16,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:13:16,540 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-13 18:13:16,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:13:16,569 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-13 18:13:16,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:13:16,594 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-07-13 18:13:16,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:13:16,620 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2022-07-13 18:13:16,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:13:16,631 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2022-07-13 18:13:16,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:13:16,636 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:13:16,636 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 18:13:16,636 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [176829124] [2022-07-13 18:13:16,637 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [176829124] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 18:13:16,637 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 18:13:16,637 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-13 18:13:16,638 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [204265311] [2022-07-13 18:13:16,639 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 18:13:16,642 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-13 18:13:16,642 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 18:13:16,662 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-13 18:13:16,663 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-13 18:13:16,666 INFO L87 Difference]: Start difference. First operand has 115 states, 89 states have (on average 1.550561797752809) internal successors, (138), 93 states have internal predecessors, (138), 17 states have call successors, (17), 7 states have call predecessors, (17), 7 states have return successors, (17), 16 states have call predecessors, (17), 17 states have call successors, (17) Second operand has 6 states, 6 states have (on average 7.666666666666667) internal successors, (46), 4 states have internal predecessors, (46), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-07-13 18:13:17,162 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 18:13:17,163 INFO L93 Difference]: Finished difference Result 361 states and 553 transitions. [2022-07-13 18:13:17,164 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-07-13 18:13:17,165 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, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 57 [2022-07-13 18:13:17,166 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 18:13:17,173 INFO L225 Difference]: With dead ends: 361 [2022-07-13 18:13:17,173 INFO L226 Difference]: Without dead ends: 247 [2022-07-13 18:13:17,176 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:13:17,178 INFO L413 NwaCegarLoop]: 179 mSDtfsCounter, 309 mSDsluCounter, 319 mSDsCounter, 0 mSdLazyCounter, 414 mSolverCounterSat, 80 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 317 SdHoareTripleChecker+Valid, 498 SdHoareTripleChecker+Invalid, 494 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 80 IncrementalHoareTripleChecker+Valid, 414 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-07-13 18:13:17,179 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [317 Valid, 498 Invalid, 494 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [80 Valid, 414 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-07-13 18:13:17,190 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 247 states. [2022-07-13 18:13:17,222 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 247 to 204. [2022-07-13 18:13:17,223 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 204 states, 163 states have (on average 1.4662576687116564) internal successors, (239), 166 states have internal predecessors, (239), 27 states have call successors, (27), 13 states have call predecessors, (27), 13 states have return successors, (28), 25 states have call predecessors, (28), 25 states have call successors, (28) [2022-07-13 18:13:17,225 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 204 states to 204 states and 294 transitions. [2022-07-13 18:13:17,226 INFO L78 Accepts]: Start accepts. Automaton has 204 states and 294 transitions. Word has length 57 [2022-07-13 18:13:17,226 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 18:13:17,226 INFO L495 AbstractCegarLoop]: Abstraction has 204 states and 294 transitions. [2022-07-13 18:13:17,227 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, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-07-13 18:13:17,227 INFO L276 IsEmpty]: Start isEmpty. Operand 204 states and 294 transitions. [2022-07-13 18:13:17,228 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2022-07-13 18:13:17,229 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 18:13:17,229 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 18:13:17,229 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-07-13 18:13:17,229 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 18:13:17,230 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 18:13:17,230 INFO L85 PathProgramCache]: Analyzing trace with hash -1123129379, now seen corresponding path program 1 times [2022-07-13 18:13:17,230 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 18:13:17,230 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1671859791] [2022-07-13 18:13:17,230 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 18:13:17,231 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 18:13:17,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:13:17,274 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-13 18:13:17,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:13:17,283 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-13 18:13:17,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:13:17,315 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-07-13 18:13:17,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:13:17,323 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2022-07-13 18:13:17,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:13:17,327 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2022-07-13 18:13:17,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:13:17,330 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:13:17,330 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 18:13:17,330 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1671859791] [2022-07-13 18:13:17,330 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1671859791] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 18:13:17,330 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 18:13:17,331 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-07-13 18:13:17,331 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [215353119] [2022-07-13 18:13:17,331 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 18:13:17,332 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-07-13 18:13:17,332 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 18:13:17,333 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-07-13 18:13:17,333 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-07-13 18:13:17,333 INFO L87 Difference]: Start difference. First operand 204 states and 294 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, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-07-13 18:13:17,793 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 18:13:17,793 INFO L93 Difference]: Finished difference Result 555 states and 802 transitions. [2022-07-13 18:13:17,794 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-07-13 18:13:17,794 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, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 57 [2022-07-13 18:13:17,794 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 18:13:17,797 INFO L225 Difference]: With dead ends: 555 [2022-07-13 18:13:17,797 INFO L226 Difference]: Without dead ends: 360 [2022-07-13 18:13:17,798 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:13:17,799 INFO L413 NwaCegarLoop]: 242 mSDtfsCounter, 288 mSDsluCounter, 550 mSDsCounter, 0 mSdLazyCounter, 649 mSolverCounterSat, 57 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 296 SdHoareTripleChecker+Valid, 792 SdHoareTripleChecker+Invalid, 706 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 57 IncrementalHoareTripleChecker+Valid, 649 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-07-13 18:13:17,799 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [296 Valid, 792 Invalid, 706 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [57 Valid, 649 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-07-13 18:13:17,800 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 360 states. [2022-07-13 18:13:17,817 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 360 to 294. [2022-07-13 18:13:17,818 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 294 states, 236 states have (on average 1.4576271186440677) internal successors, (344), 240 states have internal predecessors, (344), 37 states have call successors, (37), 19 states have call predecessors, (37), 20 states have return successors, (40), 36 states have call predecessors, (40), 35 states have call successors, (40) [2022-07-13 18:13:17,820 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 294 states to 294 states and 421 transitions. [2022-07-13 18:13:17,820 INFO L78 Accepts]: Start accepts. Automaton has 294 states and 421 transitions. Word has length 57 [2022-07-13 18:13:17,820 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 18:13:17,820 INFO L495 AbstractCegarLoop]: Abstraction has 294 states and 421 transitions. [2022-07-13 18:13:17,821 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, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-07-13 18:13:17,821 INFO L276 IsEmpty]: Start isEmpty. Operand 294 states and 421 transitions. [2022-07-13 18:13:17,822 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2022-07-13 18:13:17,822 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 18:13:17,822 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 18:13:17,822 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-07-13 18:13:17,823 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 18:13:17,823 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 18:13:17,823 INFO L85 PathProgramCache]: Analyzing trace with hash -229643041, now seen corresponding path program 1 times [2022-07-13 18:13:17,823 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 18:13:17,824 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [428230217] [2022-07-13 18:13:17,824 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 18:13:17,824 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 18:13:17,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:13:17,844 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-13 18:13:17,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:13:17,852 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-13 18:13:17,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:13:17,873 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-07-13 18:13:17,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:13:17,884 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2022-07-13 18:13:17,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:13:17,887 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2022-07-13 18:13:17,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:13:17,890 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:13:17,890 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 18:13:17,890 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [428230217] [2022-07-13 18:13:17,890 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [428230217] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 18:13:17,891 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 18:13:17,891 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-07-13 18:13:17,891 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [803837900] [2022-07-13 18:13:17,891 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 18:13:17,892 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-07-13 18:13:17,892 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 18:13:17,892 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-07-13 18:13:17,892 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-07-13 18:13:17,892 INFO L87 Difference]: Start difference. First operand 294 states and 421 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, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-07-13 18:13:18,392 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 18:13:18,392 INFO L93 Difference]: Finished difference Result 906 states and 1299 transitions. [2022-07-13 18:13:18,393 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-07-13 18:13:18,393 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, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 57 [2022-07-13 18:13:18,393 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 18:13:18,396 INFO L225 Difference]: With dead ends: 906 [2022-07-13 18:13:18,396 INFO L226 Difference]: Without dead ends: 621 [2022-07-13 18:13:18,398 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:13:18,398 INFO L413 NwaCegarLoop]: 232 mSDtfsCounter, 342 mSDsluCounter, 542 mSDsCounter, 0 mSdLazyCounter, 644 mSolverCounterSat, 65 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 352 SdHoareTripleChecker+Valid, 774 SdHoareTripleChecker+Invalid, 709 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 65 IncrementalHoareTripleChecker+Valid, 644 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-07-13 18:13:18,399 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [352 Valid, 774 Invalid, 709 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [65 Valid, 644 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-07-13 18:13:18,400 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 621 states. [2022-07-13 18:13:18,441 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 621 to 469. [2022-07-13 18:13:18,443 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 469 states, 379 states have (on average 1.4538258575197889) internal successors, (551), 385 states have internal predecessors, (551), 55 states have call successors, (55), 31 states have call predecessors, (55), 34 states have return successors, (66), 56 states have call predecessors, (66), 53 states have call successors, (66) [2022-07-13 18:13:18,445 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 469 states to 469 states and 672 transitions. [2022-07-13 18:13:18,445 INFO L78 Accepts]: Start accepts. Automaton has 469 states and 672 transitions. Word has length 57 [2022-07-13 18:13:18,445 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 18:13:18,445 INFO L495 AbstractCegarLoop]: Abstraction has 469 states and 672 transitions. [2022-07-13 18:13:18,446 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, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-07-13 18:13:18,446 INFO L276 IsEmpty]: Start isEmpty. Operand 469 states and 672 transitions. [2022-07-13 18:13:18,447 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2022-07-13 18:13:18,447 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 18:13:18,447 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 18:13:18,448 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-07-13 18:13:18,448 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 18:13:18,448 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 18:13:18,448 INFO L85 PathProgramCache]: Analyzing trace with hash 2015936413, now seen corresponding path program 1 times [2022-07-13 18:13:18,448 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 18:13:18,448 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [539700604] [2022-07-13 18:13:18,448 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 18:13:18,448 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 18:13:18,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:13:18,472 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-13 18:13:18,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:13:18,479 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-13 18:13:18,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:13:18,498 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-07-13 18:13:18,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:13:18,504 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2022-07-13 18:13:18,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:13:18,507 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2022-07-13 18:13:18,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:13:18,509 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:13:18,509 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 18:13:18,509 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [539700604] [2022-07-13 18:13:18,510 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [539700604] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 18:13:18,510 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 18:13:18,510 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-07-13 18:13:18,510 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [109566804] [2022-07-13 18:13:18,510 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 18:13:18,511 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-07-13 18:13:18,511 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 18:13:18,511 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-07-13 18:13:18,511 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-07-13 18:13:18,512 INFO L87 Difference]: Start difference. First operand 469 states and 672 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, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-07-13 18:13:22,186 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 18:13:22,186 INFO L93 Difference]: Finished difference Result 1458 states and 2090 transitions. [2022-07-13 18:13:22,187 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-07-13 18:13:22,187 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, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 57 [2022-07-13 18:13:22,188 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 18:13:22,191 INFO L225 Difference]: With dead ends: 1458 [2022-07-13 18:13:22,191 INFO L226 Difference]: Without dead ends: 998 [2022-07-13 18:13:22,192 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 43 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=73, Invalid=199, Unknown=0, NotChecked=0, Total=272 [2022-07-13 18:13:22,193 INFO L413 NwaCegarLoop]: 233 mSDtfsCounter, 285 mSDsluCounter, 524 mSDsCounter, 0 mSdLazyCounter, 681 mSolverCounterSat, 65 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 292 SdHoareTripleChecker+Valid, 757 SdHoareTripleChecker+Invalid, 746 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 65 IncrementalHoareTripleChecker+Valid, 681 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.1s IncrementalHoareTripleChecker+Time [2022-07-13 18:13:22,194 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [292 Valid, 757 Invalid, 746 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [65 Valid, 681 Invalid, 0 Unknown, 0 Unchecked, 3.1s Time] [2022-07-13 18:13:22,194 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 998 states. [2022-07-13 18:13:22,279 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 998 to 768. [2022-07-13 18:13:22,281 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 768 states, 620 states have (on average 1.4306451612903226) internal successors, (887), 630 states have internal predecessors, (887), 87 states have call successors, (87), 53 states have call predecessors, (87), 60 states have return successors, (120), 92 states have call predecessors, (120), 85 states have call successors, (120) [2022-07-13 18:13:22,297 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 768 states to 768 states and 1094 transitions. [2022-07-13 18:13:22,298 INFO L78 Accepts]: Start accepts. Automaton has 768 states and 1094 transitions. Word has length 57 [2022-07-13 18:13:22,299 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 18:13:22,299 INFO L495 AbstractCegarLoop]: Abstraction has 768 states and 1094 transitions. [2022-07-13 18:13:22,304 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, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-07-13 18:13:22,305 INFO L276 IsEmpty]: Start isEmpty. Operand 768 states and 1094 transitions. [2022-07-13 18:13:22,320 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2022-07-13 18:13:22,321 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 18:13:22,321 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 18:13:22,321 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-07-13 18:13:22,321 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 18:13:22,322 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 18:13:22,322 INFO L85 PathProgramCache]: Analyzing trace with hash 1118543135, now seen corresponding path program 1 times [2022-07-13 18:13:22,322 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 18:13:22,322 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2097587399] [2022-07-13 18:13:22,322 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 18:13:22,322 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 18:13:22,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:13:22,338 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-13 18:13:22,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:13:22,345 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-13 18:13:22,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:13:22,355 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-07-13 18:13:22,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:13:22,387 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2022-07-13 18:13:22,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:13:22,390 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2022-07-13 18:13:22,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:13:22,408 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:13:22,410 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 18:13:22,410 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2097587399] [2022-07-13 18:13:22,410 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2097587399] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 18:13:22,410 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 18:13:22,410 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-13 18:13:22,410 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [893599532] [2022-07-13 18:13:22,411 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 18:13:22,412 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-13 18:13:22,413 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 18:13:22,413 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-13 18:13:22,413 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-13 18:13:22,413 INFO L87 Difference]: Start difference. First operand 768 states and 1094 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, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-07-13 18:13:22,914 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 18:13:22,915 INFO L93 Difference]: Finished difference Result 2132 states and 3040 transitions. [2022-07-13 18:13:22,915 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-07-13 18:13:22,915 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, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 57 [2022-07-13 18:13:22,916 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 18:13:22,932 INFO L225 Difference]: With dead ends: 2132 [2022-07-13 18:13:22,932 INFO L226 Difference]: Without dead ends: 1374 [2022-07-13 18:13:22,934 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=39, Invalid=93, Unknown=0, NotChecked=0, Total=132 [2022-07-13 18:13:22,934 INFO L413 NwaCegarLoop]: 267 mSDtfsCounter, 397 mSDsluCounter, 309 mSDsCounter, 0 mSdLazyCounter, 472 mSolverCounterSat, 83 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 420 SdHoareTripleChecker+Valid, 576 SdHoareTripleChecker+Invalid, 555 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 83 IncrementalHoareTripleChecker+Valid, 472 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-07-13 18:13:22,935 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [420 Valid, 576 Invalid, 555 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [83 Valid, 472 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-07-13 18:13:22,936 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1374 states. [2022-07-13 18:13:22,972 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1374 to 1169. [2022-07-13 18:13:22,973 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1169 states, 938 states have (on average 1.3997867803837953) internal successors, (1313), 957 states have internal predecessors, (1313), 136 states have call successors, (136), 83 states have call predecessors, (136), 94 states have return successors, (179), 136 states have call predecessors, (179), 134 states have call successors, (179) [2022-07-13 18:13:22,977 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1169 states to 1169 states and 1628 transitions. [2022-07-13 18:13:22,978 INFO L78 Accepts]: Start accepts. Automaton has 1169 states and 1628 transitions. Word has length 57 [2022-07-13 18:13:22,978 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 18:13:22,978 INFO L495 AbstractCegarLoop]: Abstraction has 1169 states and 1628 transitions. [2022-07-13 18:13:22,978 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, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-07-13 18:13:22,978 INFO L276 IsEmpty]: Start isEmpty. Operand 1169 states and 1628 transitions. [2022-07-13 18:13:22,981 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2022-07-13 18:13:22,981 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 18:13:22,981 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 18:13:22,981 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-07-13 18:13:22,981 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 18:13:22,982 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 18:13:22,982 INFO L85 PathProgramCache]: Analyzing trace with hash -712241775, now seen corresponding path program 1 times [2022-07-13 18:13:22,982 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 18:13:22,982 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [411052201] [2022-07-13 18:13:22,982 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 18:13:22,982 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 18:13:22,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:13:22,997 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-13 18:13:22,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:13:23,003 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-13 18:13:23,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:13:23,008 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-07-13 18:13:23,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:13:23,037 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2022-07-13 18:13:23,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:13:23,040 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2022-07-13 18:13:23,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:13:23,042 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2022-07-13 18:13:23,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:13:23,045 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-07-13 18:13:23,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:13:23,048 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2022-07-13 18:13:23,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:13:23,050 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:13:23,050 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 18:13:23,050 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [411052201] [2022-07-13 18:13:23,050 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [411052201] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-13 18:13:23,050 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1891331089] [2022-07-13 18:13:23,050 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 18:13:23,051 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-13 18:13:23,051 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 18:13:23,052 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:13:23,084 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:13:23,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:13:23,115 INFO L263 TraceCheckSpWp]: Trace formula consists of 300 conjuncts, 2 conjunts are in the unsatisfiable core [2022-07-13 18:13:23,119 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 18:13:23,164 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:13:23,164 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-13 18:13:23,164 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1891331089] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 18:13:23,165 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-07-13 18:13:23,165 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [7] total 8 [2022-07-13 18:13:23,165 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [838195886] [2022-07-13 18:13:23,165 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 18:13:23,165 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-13 18:13:23,166 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 18:13:23,166 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-13 18:13:23,166 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2022-07-13 18:13:23,166 INFO L87 Difference]: Start difference. First operand 1169 states and 1628 transitions. Second operand has 3 states, 3 states have (on average 20.666666666666668) internal successors, (62), 3 states have internal predecessors, (62), 3 states have call successors, (9), 3 states have call predecessors, (9), 2 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2022-07-13 18:13:23,270 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 18:13:23,270 INFO L93 Difference]: Finished difference Result 3375 states and 4754 transitions. [2022-07-13 18:13:23,271 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-13 18:13:23,271 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), 3 states have call successors, (9), 3 states have call predecessors, (9), 2 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) Word has length 92 [2022-07-13 18:13:23,271 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 18:13:23,278 INFO L225 Difference]: With dead ends: 3375 [2022-07-13 18:13:23,279 INFO L226 Difference]: Without dead ends: 2217 [2022-07-13 18:13:23,281 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 113 GetRequests, 107 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:13:23,281 INFO L413 NwaCegarLoop]: 271 mSDtfsCounter, 114 mSDsluCounter, 150 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 114 SdHoareTripleChecker+Valid, 421 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:13:23,281 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [114 Valid, 421 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-13 18:13:23,283 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2217 states. [2022-07-13 18:13:23,380 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2217 to 2217. [2022-07-13 18:13:23,383 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2217 states, 1777 states have (on average 1.37816544738323) internal successors, (2449), 1809 states have internal predecessors, (2449), 255 states have call successors, (255), 161 states have call predecessors, (255), 184 states have return successors, (376), 262 states have call predecessors, (376), 253 states have call successors, (376) [2022-07-13 18:13:23,389 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2217 states to 2217 states and 3080 transitions. [2022-07-13 18:13:23,390 INFO L78 Accepts]: Start accepts. Automaton has 2217 states and 3080 transitions. Word has length 92 [2022-07-13 18:13:23,392 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 18:13:23,392 INFO L495 AbstractCegarLoop]: Abstraction has 2217 states and 3080 transitions. [2022-07-13 18:13:23,392 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), 3 states have call successors, (9), 3 states have call predecessors, (9), 2 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2022-07-13 18:13:23,393 INFO L276 IsEmpty]: Start isEmpty. Operand 2217 states and 3080 transitions. [2022-07-13 18:13:23,399 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2022-07-13 18:13:23,399 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 18:13:23,399 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 18:13:23,419 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:13:23,616 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:13:23,616 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 18:13:23,616 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 18:13:23,617 INFO L85 PathProgramCache]: Analyzing trace with hash -2098539431, now seen corresponding path program 1 times [2022-07-13 18:13:23,617 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 18:13:23,617 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [362064890] [2022-07-13 18:13:23,617 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 18:13:23,617 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 18:13:23,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:13:23,645 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-13 18:13:23,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:13:23,652 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-13 18:13:23,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:13:23,659 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-07-13 18:13:23,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:13:23,690 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2022-07-13 18:13:23,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:13:23,692 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2022-07-13 18:13:23,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:13:23,693 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2022-07-13 18:13:23,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:13:23,696 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-07-13 18:13:23,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:13:23,699 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2022-07-13 18:13:23,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:13:23,702 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-07-13 18:13:23,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:13:23,716 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 103 [2022-07-13 18:13:23,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:13:23,718 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:13:23,718 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 18:13:23,718 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [362064890] [2022-07-13 18:13:23,718 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [362064890] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-13 18:13:23,718 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1514374386] [2022-07-13 18:13:23,718 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 18:13:23,719 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-13 18:13:23,719 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 18:13:23,720 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:13:23,721 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:13:23,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:13:23,813 INFO L263 TraceCheckSpWp]: Trace formula consists of 374 conjuncts, 2 conjunts are in the unsatisfiable core [2022-07-13 18:13:23,820 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 18:13:23,926 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:13:23,927 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-13 18:13:23,927 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1514374386] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 18:13:23,927 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-07-13 18:13:23,927 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [7] total 8 [2022-07-13 18:13:23,927 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [729568098] [2022-07-13 18:13:23,927 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 18:13:23,927 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-13 18:13:23,927 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 18:13:23,928 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-13 18:13:23,928 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2022-07-13 18:13:23,928 INFO L87 Difference]: Start difference. First operand 2217 states and 3080 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, (11), 2 states have call predecessors, (11), 2 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) [2022-07-13 18:13:24,073 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 18:13:24,073 INFO L93 Difference]: Finished difference Result 6487 states and 9053 transitions. [2022-07-13 18:13:24,074 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-13 18:13:24,074 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, (11), 2 states have call predecessors, (11), 2 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) Word has length 118 [2022-07-13 18:13:24,074 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 18:13:24,088 INFO L225 Difference]: With dead ends: 6487 [2022-07-13 18:13:24,088 INFO L226 Difference]: Without dead ends: 4284 [2022-07-13 18:13:24,092 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 143 GetRequests, 137 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:13:24,092 INFO L413 NwaCegarLoop]: 183 mSDtfsCounter, 81 mSDsluCounter, 132 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 81 SdHoareTripleChecker+Valid, 315 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:13:24,096 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [81 Valid, 315 Invalid, 12 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-13 18:13:24,099 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4284 states. [2022-07-13 18:13:24,241 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4284 to 4224. [2022-07-13 18:13:24,246 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4224 states, 3390 states have (on average 1.370796460176991) internal successors, (4647), 3451 states have internal predecessors, (4647), 475 states have call successors, (475), 311 states have call predecessors, (475), 358 states have return successors, (688), 477 states have call predecessors, (688), 473 states have call successors, (688) [2022-07-13 18:13:24,259 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4224 states to 4224 states and 5810 transitions. [2022-07-13 18:13:24,260 INFO L78 Accepts]: Start accepts. Automaton has 4224 states and 5810 transitions. Word has length 118 [2022-07-13 18:13:24,260 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 18:13:24,260 INFO L495 AbstractCegarLoop]: Abstraction has 4224 states and 5810 transitions. [2022-07-13 18:13:24,260 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, (11), 2 states have call predecessors, (11), 2 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) [2022-07-13 18:13:24,261 INFO L276 IsEmpty]: Start isEmpty. Operand 4224 states and 5810 transitions. [2022-07-13 18:13:24,268 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2022-07-13 18:13:24,268 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 18:13:24,268 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 18:13:24,285 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:13:24,484 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:13:24,485 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 18:13:24,485 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 18:13:24,485 INFO L85 PathProgramCache]: Analyzing trace with hash -1491695225, now seen corresponding path program 1 times [2022-07-13 18:13:24,485 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 18:13:24,485 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [485138992] [2022-07-13 18:13:24,486 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 18:13:24,486 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 18:13:24,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:13:24,506 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-13 18:13:24,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:13:24,519 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-13 18:13:24,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:13:24,524 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-07-13 18:13:24,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:13:24,553 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2022-07-13 18:13:24,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:13:24,556 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2022-07-13 18:13:24,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:13:24,559 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2022-07-13 18:13:24,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:13:24,561 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2022-07-13 18:13:24,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:13:24,564 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-07-13 18:13:24,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:13:24,566 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2022-07-13 18:13:24,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:13:24,568 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-07-13 18:13:24,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:13:24,571 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2022-07-13 18:13:24,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:13:24,573 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:13:24,573 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 18:13:24,573 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [485138992] [2022-07-13 18:13:24,574 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [485138992] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-13 18:13:24,574 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [74690437] [2022-07-13 18:13:24,574 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 18:13:24,574 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-13 18:13:24,574 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 18:13:24,575 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:13:24,577 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:13:24,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:13:24,645 INFO L263 TraceCheckSpWp]: Trace formula consists of 411 conjuncts, 3 conjunts are in the unsatisfiable core [2022-07-13 18:13:24,654 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 18:13:24,688 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:13:24,688 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-13 18:13:24,689 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [74690437] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 18:13:24,689 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-07-13 18:13:24,689 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [7] total 8 [2022-07-13 18:13:24,689 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [201212572] [2022-07-13 18:13:24,689 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 18:13:24,690 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-13 18:13:24,690 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 18:13:24,690 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-13 18:13:24,691 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2022-07-13 18:13:24,691 INFO L87 Difference]: Start difference. First operand 4224 states and 5810 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, (10), 3 states have call predecessors, (10), 3 states have return successors, (9), 3 states have call predecessors, (9), 3 states have call successors, (9) [2022-07-13 18:13:24,833 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 18:13:24,833 INFO L93 Difference]: Finished difference Result 7498 states and 10341 transitions. [2022-07-13 18:13:24,833 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-13 18:13:24,834 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, (10), 3 states have call predecessors, (10), 3 states have return successors, (9), 3 states have call predecessors, (9), 3 states have call successors, (9) Word has length 134 [2022-07-13 18:13:24,835 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 18:13:24,849 INFO L225 Difference]: With dead ends: 7498 [2022-07-13 18:13:24,849 INFO L226 Difference]: Without dead ends: 4552 [2022-07-13 18:13:24,855 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:13:24,857 INFO L413 NwaCegarLoop]: 174 mSDtfsCounter, 101 mSDsluCounter, 140 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 101 SdHoareTripleChecker+Valid, 314 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:13:24,858 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [101 Valid, 314 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-13 18:13:24,861 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4552 states. [2022-07-13 18:13:25,019 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4552 to 4514. [2022-07-13 18:13:25,026 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4514 states, 3648 states have (on average 1.3434758771929824) internal successors, (4901), 3709 states have internal predecessors, (4901), 481 states have call successors, (481), 337 states have call predecessors, (481), 384 states have return successors, (720), 483 states have call predecessors, (720), 479 states have call successors, (720) [2022-07-13 18:13:25,037 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4514 states to 4514 states and 6102 transitions. [2022-07-13 18:13:25,038 INFO L78 Accepts]: Start accepts. Automaton has 4514 states and 6102 transitions. Word has length 134 [2022-07-13 18:13:25,038 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 18:13:25,038 INFO L495 AbstractCegarLoop]: Abstraction has 4514 states and 6102 transitions. [2022-07-13 18:13:25,038 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, (10), 3 states have call predecessors, (10), 3 states have return successors, (9), 3 states have call predecessors, (9), 3 states have call successors, (9) [2022-07-13 18:13:25,039 INFO L276 IsEmpty]: Start isEmpty. Operand 4514 states and 6102 transitions. [2022-07-13 18:13:25,046 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 136 [2022-07-13 18:13:25,046 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 18:13:25,047 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 18:13:25,079 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:13:25,282 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:13:25,283 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 18:13:25,283 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 18:13:25,283 INFO L85 PathProgramCache]: Analyzing trace with hash 1657376431, now seen corresponding path program 1 times [2022-07-13 18:13:25,284 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 18:13:25,285 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [15443972] [2022-07-13 18:13:25,285 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 18:13:25,285 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 18:13:25,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:13:25,307 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-13 18:13:25,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:13:25,313 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-13 18:13:25,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:13:25,319 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-07-13 18:13:25,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:13:25,356 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2022-07-13 18:13:25,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:13:25,359 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2022-07-13 18:13:25,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:13:25,360 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2022-07-13 18:13:25,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:13:25,361 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2022-07-13 18:13:25,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:13:25,364 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-07-13 18:13:25,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:13:25,366 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2022-07-13 18:13:25,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:13:25,370 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-07-13 18:13:25,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:13:25,373 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 120 [2022-07-13 18:13:25,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:13:25,392 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:13:25,392 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 18:13:25,392 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [15443972] [2022-07-13 18:13:25,392 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [15443972] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-13 18:13:25,393 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [456847620] [2022-07-13 18:13:25,393 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 18:13:25,393 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-13 18:13:25,393 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 18:13:25,394 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:13:25,396 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:13:25,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:13:25,457 INFO L263 TraceCheckSpWp]: Trace formula consists of 418 conjuncts, 3 conjunts are in the unsatisfiable core [2022-07-13 18:13:25,461 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 18:13:25,491 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:13:25,491 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-13 18:13:25,492 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [456847620] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 18:13:25,492 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-07-13 18:13:25,492 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [7] total 8 [2022-07-13 18:13:25,492 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1974333780] [2022-07-13 18:13:25,492 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 18:13:25,492 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-13 18:13:25,493 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 18:13:25,493 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-13 18:13:25,493 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2022-07-13 18:13:25,494 INFO L87 Difference]: Start difference. First operand 4514 states and 6102 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, (12), 3 states have call predecessors, (12), 3 states have return successors, (11), 3 states have call predecessors, (11), 3 states have call successors, (11) [2022-07-13 18:13:25,616 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 18:13:25,617 INFO L93 Difference]: Finished difference Result 6910 states and 9481 transitions. [2022-07-13 18:13:25,617 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-13 18:13:25,617 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, (12), 3 states have call predecessors, (12), 3 states have return successors, (11), 3 states have call predecessors, (11), 3 states have call successors, (11) Word has length 135 [2022-07-13 18:13:25,618 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 18:13:25,632 INFO L225 Difference]: With dead ends: 6910 [2022-07-13 18:13:25,632 INFO L226 Difference]: Without dead ends: 4550 [2022-07-13 18:13:25,636 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 162 GetRequests, 156 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2022-07-13 18:13:25,638 INFO L413 NwaCegarLoop]: 259 mSDtfsCounter, 111 mSDsluCounter, 141 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 111 SdHoareTripleChecker+Valid, 400 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:13:25,638 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [111 Valid, 400 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-13 18:13:25,641 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4550 states. [2022-07-13 18:13:25,775 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4550 to 4490. [2022-07-13 18:13:25,781 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4490 states, 3624 states have (on average 1.319812362030905) internal successors, (4783), 3685 states have internal predecessors, (4783), 481 states have call successors, (481), 337 states have call predecessors, (481), 384 states have return successors, (720), 483 states have call predecessors, (720), 479 states have call successors, (720) [2022-07-13 18:13:25,789 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4490 states to 4490 states and 5984 transitions. [2022-07-13 18:13:25,790 INFO L78 Accepts]: Start accepts. Automaton has 4490 states and 5984 transitions. Word has length 135 [2022-07-13 18:13:25,791 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 18:13:25,791 INFO L495 AbstractCegarLoop]: Abstraction has 4490 states and 5984 transitions. [2022-07-13 18:13:25,792 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, (12), 3 states have call predecessors, (12), 3 states have return successors, (11), 3 states have call predecessors, (11), 3 states have call successors, (11) [2022-07-13 18:13:25,792 INFO L276 IsEmpty]: Start isEmpty. Operand 4490 states and 5984 transitions. [2022-07-13 18:13:25,799 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 136 [2022-07-13 18:13:25,799 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 18:13:25,799 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:25,821 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:13:26,015 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:13:26,016 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 18:13:26,016 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 18:13:26,016 INFO L85 PathProgramCache]: Analyzing trace with hash -1768717425, now seen corresponding path program 1 times [2022-07-13 18:13:26,016 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 18:13:26,016 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1083882622] [2022-07-13 18:13:26,016 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 18:13:26,017 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 18:13:26,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:13:26,028 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-13 18:13:26,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:13:26,033 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-13 18:13:26,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:13:26,038 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-07-13 18:13:26,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:13:26,062 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2022-07-13 18:13:26,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:13:26,064 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2022-07-13 18:13:26,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:13:26,065 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2022-07-13 18:13:26,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:13:26,066 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2022-07-13 18:13:26,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:13:26,068 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-07-13 18:13:26,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:13:26,070 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2022-07-13 18:13:26,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:13:26,072 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-07-13 18:13:26,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:13:26,074 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 120 [2022-07-13 18:13:26,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:13:26,075 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:13:26,075 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 18:13:26,075 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1083882622] [2022-07-13 18:13:26,076 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1083882622] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-13 18:13:26,076 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1698797207] [2022-07-13 18:13:26,076 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 18:13:26,076 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-13 18:13:26,076 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 18:13:26,077 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:13:26,078 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:13:26,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:13:26,151 INFO L263 TraceCheckSpWp]: Trace formula consists of 424 conjuncts, 2 conjunts are in the unsatisfiable core [2022-07-13 18:13:26,153 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 18:13:26,173 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:13:26,173 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-13 18:13:26,173 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1698797207] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 18:13:26,173 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-07-13 18:13:26,173 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [7] total 8 [2022-07-13 18:13:26,173 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [508176483] [2022-07-13 18:13:26,173 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 18:13:26,174 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-13 18:13:26,174 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 18:13:26,174 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-13 18:13:26,174 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2022-07-13 18:13:26,174 INFO L87 Difference]: Start difference. First operand 4490 states and 5984 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, (11), 3 states have call predecessors, (11), 2 states have return successors, (10), 2 states have call predecessors, (10), 3 states have call successors, (10) [2022-07-13 18:13:26,323 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 18:13:26,323 INFO L93 Difference]: Finished difference Result 7814 states and 10540 transitions. [2022-07-13 18:13:26,323 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-13 18:13:26,324 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, (11), 3 states have call predecessors, (11), 2 states have return successors, (10), 2 states have call predecessors, (10), 3 states have call successors, (10) Word has length 135 [2022-07-13 18:13:26,324 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 18:13:26,337 INFO L225 Difference]: With dead ends: 7814 [2022-07-13 18:13:26,337 INFO L226 Difference]: Without dead ends: 3872 [2022-07-13 18:13:26,345 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 162 GetRequests, 156 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2022-07-13 18:13:26,345 INFO L413 NwaCegarLoop]: 154 mSDtfsCounter, 131 mSDsluCounter, 24 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 131 SdHoareTripleChecker+Valid, 178 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-13 18:13:26,345 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [131 Valid, 178 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-13 18:13:26,348 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3872 states. [2022-07-13 18:13:26,482 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3872 to 3642. [2022-07-13 18:13:26,487 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3642 states, 2942 states have (on average 1.270904146838885) internal successors, (3739), 2987 states have internal predecessors, (3739), 393 states have call successors, (393), 275 states have call predecessors, (393), 306 states have return successors, (510), 387 states have call predecessors, (510), 391 states have call successors, (510) [2022-07-13 18:13:26,495 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3642 states to 3642 states and 4642 transitions. [2022-07-13 18:13:26,496 INFO L78 Accepts]: Start accepts. Automaton has 3642 states and 4642 transitions. Word has length 135 [2022-07-13 18:13:26,496 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 18:13:26,496 INFO L495 AbstractCegarLoop]: Abstraction has 3642 states and 4642 transitions. [2022-07-13 18:13:26,496 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, (11), 3 states have call predecessors, (11), 2 states have return successors, (10), 2 states have call predecessors, (10), 3 states have call successors, (10) [2022-07-13 18:13:26,497 INFO L276 IsEmpty]: Start isEmpty. Operand 3642 states and 4642 transitions. [2022-07-13 18:13:26,502 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137 [2022-07-13 18:13:26,502 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 18:13:26,502 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 18:13:26,522 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:13:26,720 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:13:26,720 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 18:13:26,720 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 18:13:26,720 INFO L85 PathProgramCache]: Analyzing trace with hash -829055518, now seen corresponding path program 1 times [2022-07-13 18:13:26,720 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 18:13:26,721 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1831000174] [2022-07-13 18:13:26,721 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 18:13:26,721 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 18:13:26,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:13:26,732 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-13 18:13:26,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:13:26,738 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-13 18:13:26,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:13:26,743 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-07-13 18:13:26,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:13:26,767 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2022-07-13 18:13:26,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:13:26,769 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2022-07-13 18:13:26,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:13:26,770 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2022-07-13 18:13:26,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:13:26,771 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2022-07-13 18:13:26,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:13:26,774 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-07-13 18:13:26,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:13:26,776 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2022-07-13 18:13:26,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:13:26,778 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-07-13 18:13:26,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:13:26,780 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 121 [2022-07-13 18:13:26,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:13:26,781 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:26,781 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 18:13:26,781 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1831000174] [2022-07-13 18:13:26,781 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1831000174] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-13 18:13:26,781 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1693345440] [2022-07-13 18:13:26,781 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 18:13:26,782 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-13 18:13:26,782 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 18:13:26,799 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:13:26,870 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:13:26,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:13:26,907 INFO L263 TraceCheckSpWp]: Trace formula consists of 420 conjuncts, 6 conjunts are in the unsatisfiable core [2022-07-13 18:13:26,908 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 18:13:26,979 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:26,980 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-13 18:13:26,980 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1693345440] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 18:13:26,980 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-07-13 18:13:26,980 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [7] total 10 [2022-07-13 18:13:26,981 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1362177266] [2022-07-13 18:13:26,982 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 18:13:26,982 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-07-13 18:13:26,982 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 18:13:26,982 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-13 18:13:26,982 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2022-07-13 18:13:26,983 INFO L87 Difference]: Start difference. First operand 3642 states and 4642 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, (9), 3 states have call predecessors, (9), 4 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2022-07-13 18:13:27,207 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 18:13:27,208 INFO L93 Difference]: Finished difference Result 5070 states and 6521 transitions. [2022-07-13 18:13:27,208 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-13 18:13:27,208 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, (9), 3 states have call predecessors, (9), 4 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) Word has length 136 [2022-07-13 18:13:27,208 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 18:13:27,218 INFO L225 Difference]: With dead ends: 5070 [2022-07-13 18:13:27,218 INFO L226 Difference]: Without dead ends: 2712 [2022-07-13 18:13:27,226 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 164 GetRequests, 155 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=88, Unknown=0, NotChecked=0, Total=110 [2022-07-13 18:13:27,239 INFO L413 NwaCegarLoop]: 132 mSDtfsCounter, 150 mSDsluCounter, 155 mSDsCounter, 0 mSdLazyCounter, 100 mSolverCounterSat, 24 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 158 SdHoareTripleChecker+Valid, 287 SdHoareTripleChecker+Invalid, 124 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 24 IncrementalHoareTripleChecker+Valid, 100 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-13 18:13:27,240 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [158 Valid, 287 Invalid, 124 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [24 Valid, 100 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-13 18:13:27,242 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2712 states. [2022-07-13 18:13:27,395 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2712 to 2700. [2022-07-13 18:13:27,399 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2700 states, 2182 states have (on average 1.2396883593033914) internal successors, (2705), 2209 states have internal predecessors, (2705), 297 states have call successors, (297), 205 states have call predecessors, (297), 220 states have return successors, (354), 289 states have call predecessors, (354), 295 states have call successors, (354) [2022-07-13 18:13:27,405 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2700 states to 2700 states and 3356 transitions. [2022-07-13 18:13:27,406 INFO L78 Accepts]: Start accepts. Automaton has 2700 states and 3356 transitions. Word has length 136 [2022-07-13 18:13:27,406 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 18:13:27,406 INFO L495 AbstractCegarLoop]: Abstraction has 2700 states and 3356 transitions. [2022-07-13 18:13:27,407 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, (9), 3 states have call predecessors, (9), 4 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2022-07-13 18:13:27,407 INFO L276 IsEmpty]: Start isEmpty. Operand 2700 states and 3356 transitions. [2022-07-13 18:13:27,410 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137 [2022-07-13 18:13:27,410 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 18:13:27,410 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 18:13:27,443 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:27,644 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:27,645 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 18:13:27,645 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 18:13:27,645 INFO L85 PathProgramCache]: Analyzing trace with hash 1599203104, now seen corresponding path program 1 times [2022-07-13 18:13:27,646 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 18:13:27,646 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [971083215] [2022-07-13 18:13:27,646 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 18:13:27,646 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 18:13:27,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:13:27,658 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-13 18:13:27,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:13:27,664 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-13 18:13:27,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:13:27,669 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-07-13 18:13:27,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:13:27,693 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2022-07-13 18:13:27,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:13:27,695 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2022-07-13 18:13:27,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:13:27,697 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2022-07-13 18:13:27,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:13:27,698 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2022-07-13 18:13:27,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:13:27,700 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-07-13 18:13:27,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:13:27,703 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2022-07-13 18:13:27,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:13:27,705 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-07-13 18:13:27,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:13:27,707 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 121 [2022-07-13 18:13:27,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:13:27,708 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:27,709 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 18:13:27,709 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [971083215] [2022-07-13 18:13:27,709 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [971083215] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-13 18:13:27,709 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1310274877] [2022-07-13 18:13:27,709 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 18:13:27,709 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-13 18:13:27,709 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 18:13:27,711 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:27,712 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:27,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:13:27,777 INFO L263 TraceCheckSpWp]: Trace formula consists of 417 conjuncts, 6 conjunts are in the unsatisfiable core [2022-07-13 18:13:27,779 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 18:13:27,831 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:27,831 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-13 18:13:27,831 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1310274877] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 18:13:27,831 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-07-13 18:13:27,832 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [7] total 10 [2022-07-13 18:13:27,832 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [341925555] [2022-07-13 18:13:27,832 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 18:13:27,832 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-07-13 18:13:27,832 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 18:13:27,833 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-13 18:13:27,833 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2022-07-13 18:13:27,833 INFO L87 Difference]: Start difference. First operand 2700 states and 3356 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, (9), 3 states have call predecessors, (9), 4 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2022-07-13 18:13:28,036 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 18:13:28,036 INFO L93 Difference]: Finished difference Result 5041 states and 6343 transitions. [2022-07-13 18:13:28,037 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-07-13 18:13:28,037 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, (9), 3 states have call predecessors, (9), 4 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) Word has length 136 [2022-07-13 18:13:28,037 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 18:13:28,046 INFO L225 Difference]: With dead ends: 5041 [2022-07-13 18:13:28,046 INFO L226 Difference]: Without dead ends: 2648 [2022-07-13 18:13:28,051 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 165 GetRequests, 155 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:28,052 INFO L413 NwaCegarLoop]: 144 mSDtfsCounter, 171 mSDsluCounter, 150 mSDsCounter, 0 mSdLazyCounter, 150 mSolverCounterSat, 29 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 179 SdHoareTripleChecker+Valid, 294 SdHoareTripleChecker+Invalid, 179 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 29 IncrementalHoareTripleChecker+Valid, 150 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-13 18:13:28,052 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [179 Valid, 294 Invalid, 179 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [29 Valid, 150 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-13 18:13:28,054 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2648 states. [2022-07-13 18:13:28,159 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2648 to 1674. [2022-07-13 18:13:28,161 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1674 states, 1368 states have (on average 1.192251461988304) internal successors, (1631), 1383 states have internal predecessors, (1631), 175 states have call successors, (175), 123 states have call predecessors, (175), 130 states have return successors, (203), 169 states have call predecessors, (203), 173 states have call successors, (203) [2022-07-13 18:13:28,164 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1674 states to 1674 states and 2009 transitions. [2022-07-13 18:13:28,165 INFO L78 Accepts]: Start accepts. Automaton has 1674 states and 2009 transitions. Word has length 136 [2022-07-13 18:13:28,165 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 18:13:28,166 INFO L495 AbstractCegarLoop]: Abstraction has 1674 states and 2009 transitions. [2022-07-13 18:13:28,166 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, (9), 3 states have call predecessors, (9), 4 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2022-07-13 18:13:28,166 INFO L276 IsEmpty]: Start isEmpty. Operand 1674 states and 2009 transitions. [2022-07-13 18:13:28,168 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137 [2022-07-13 18:13:28,168 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 18:13:28,168 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 18:13:28,201 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:28,385 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:28,386 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 18:13:28,386 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 18:13:28,386 INFO L85 PathProgramCache]: Analyzing trace with hash 292060706, now seen corresponding path program 1 times [2022-07-13 18:13:28,386 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 18:13:28,386 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1412223413] [2022-07-13 18:13:28,386 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 18:13:28,387 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 18:13:28,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:13:28,398 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-13 18:13:28,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:13:28,403 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-13 18:13:28,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:13:28,408 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-07-13 18:13:28,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:13:28,431 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2022-07-13 18:13:28,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:13:28,433 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2022-07-13 18:13:28,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:13:28,435 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2022-07-13 18:13:28,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:13:28,436 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2022-07-13 18:13:28,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:13:28,438 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-07-13 18:13:28,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:13:28,440 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2022-07-13 18:13:28,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:13:28,442 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-07-13 18:13:28,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:13:28,449 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 121 [2022-07-13 18:13:28,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:13:28,451 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:28,451 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 18:13:28,451 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1412223413] [2022-07-13 18:13:28,451 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1412223413] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-13 18:13:28,451 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [340726849] [2022-07-13 18:13:28,451 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 18:13:28,451 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-13 18:13:28,451 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 18:13:28,452 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:28,454 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:28,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:13:28,515 INFO L263 TraceCheckSpWp]: Trace formula consists of 414 conjuncts, 7 conjunts are in the unsatisfiable core [2022-07-13 18:13:28,518 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 18:13:28,544 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:28,544 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-13 18:13:28,544 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [340726849] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 18:13:28,544 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-07-13 18:13:28,545 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [7] total 7 [2022-07-13 18:13:28,545 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [974867238] [2022-07-13 18:13:28,545 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 18:13:28,545 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-07-13 18:13:28,545 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 18:13:28,545 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-13 18:13:28,545 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-07-13 18:13:28,545 INFO L87 Difference]: Start difference. First operand 1674 states and 2009 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, (9), 2 states have call predecessors, (9), 2 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2022-07-13 18:13:28,636 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 18:13:28,636 INFO L93 Difference]: Finished difference Result 2813 states and 3395 transitions. [2022-07-13 18:13:28,636 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-07-13 18:13:28,636 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, (9), 2 states have call predecessors, (9), 2 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) Word has length 136 [2022-07-13 18:13:28,636 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 18:13:28,643 INFO L225 Difference]: With dead ends: 2813 [2022-07-13 18:13:28,643 INFO L226 Difference]: Without dead ends: 1149 [2022-07-13 18:13:28,646 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 165 GetRequests, 156 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:28,646 INFO L413 NwaCegarLoop]: 144 mSDtfsCounter, 48 mSDsluCounter, 441 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 48 SdHoareTripleChecker+Valid, 585 SdHoareTripleChecker+Invalid, 14 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-13 18:13:28,647 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [48 Valid, 585 Invalid, 14 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-13 18:13:28,648 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1149 states. [2022-07-13 18:13:28,712 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1149 to 1113. [2022-07-13 18:13:28,714 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1113 states, 914 states have (on average 1.163019693654267) internal successors, (1063), 925 states have internal predecessors, (1063), 112 states have call successors, (112), 80 states have call predecessors, (112), 86 states have return successors, (121), 108 states have call predecessors, (121), 110 states have call successors, (121) [2022-07-13 18:13:28,715 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1113 states to 1113 states and 1296 transitions. [2022-07-13 18:13:28,716 INFO L78 Accepts]: Start accepts. Automaton has 1113 states and 1296 transitions. Word has length 136 [2022-07-13 18:13:28,716 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 18:13:28,716 INFO L495 AbstractCegarLoop]: Abstraction has 1113 states and 1296 transitions. [2022-07-13 18:13:28,716 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, (9), 2 states have call predecessors, (9), 2 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2022-07-13 18:13:28,716 INFO L276 IsEmpty]: Start isEmpty. Operand 1113 states and 1296 transitions. [2022-07-13 18:13:28,718 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137 [2022-07-13 18:13:28,718 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 18:13:28,718 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 18:13:28,737 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0 [2022-07-13 18:13:28,931 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:28,931 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 18:13:28,932 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 18:13:28,932 INFO L85 PathProgramCache]: Analyzing trace with hash -1014844378, now seen corresponding path program 1 times [2022-07-13 18:13:28,932 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 18:13:28,932 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1569522228] [2022-07-13 18:13:28,932 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 18:13:28,932 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 18:13:28,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:13:28,943 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-13 18:13:28,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:13:28,948 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-13 18:13:28,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:13:28,953 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-07-13 18:13:28,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:13:28,976 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2022-07-13 18:13:28,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:13:28,978 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2022-07-13 18:13:28,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:13:28,979 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2022-07-13 18:13:28,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:13:28,980 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2022-07-13 18:13:28,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:13:28,983 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-07-13 18:13:28,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:13:28,984 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2022-07-13 18:13:28,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:13:28,986 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-07-13 18:13:28,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:13:28,988 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 121 [2022-07-13 18:13:28,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:13:28,989 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:28,989 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 18:13:28,990 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1569522228] [2022-07-13 18:13:28,990 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1569522228] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-13 18:13:28,990 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [546177735] [2022-07-13 18:13:28,990 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 18:13:28,990 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-13 18:13:28,990 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 18:13:29,000 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:29,001 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:29,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:13:29,066 INFO L263 TraceCheckSpWp]: Trace formula consists of 412 conjuncts, 7 conjunts are in the unsatisfiable core [2022-07-13 18:13:29,068 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 18:13:29,085 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:29,086 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-13 18:13:29,086 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [546177735] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 18:13:29,086 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-07-13 18:13:29,086 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [7] total 7 [2022-07-13 18:13:29,086 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1256494303] [2022-07-13 18:13:29,087 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 18:13:29,087 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-07-13 18:13:29,087 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 18:13:29,087 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-13 18:13:29,087 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-07-13 18:13:29,088 INFO L87 Difference]: Start difference. First operand 1113 states and 1296 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, (9), 2 states have call predecessors, (9), 2 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2022-07-13 18:13:29,158 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 18:13:29,159 INFO L93 Difference]: Finished difference Result 2244 states and 2657 transitions. [2022-07-13 18:13:29,159 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-07-13 18:13:29,159 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, (9), 2 states have call predecessors, (9), 2 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) Word has length 136 [2022-07-13 18:13:29,159 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 18:13:29,163 INFO L225 Difference]: With dead ends: 2244 [2022-07-13 18:13:29,163 INFO L226 Difference]: Without dead ends: 1141 [2022-07-13 18:13:29,165 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 165 GetRequests, 156 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:29,165 INFO L413 NwaCegarLoop]: 143 mSDtfsCounter, 10 mSDsluCounter, 428 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 571 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:29,165 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [10 Valid, 571 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:29,166 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1141 states. [2022-07-13 18:13:29,216 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1141 to 1125. [2022-07-13 18:13:29,218 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1125 states, 926 states have (on average 1.1382289416846652) internal successors, (1054), 937 states have internal predecessors, (1054), 112 states have call successors, (112), 80 states have call predecessors, (112), 86 states have return successors, (121), 108 states have call predecessors, (121), 110 states have call successors, (121) [2022-07-13 18:13:29,220 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1125 states to 1125 states and 1287 transitions. [2022-07-13 18:13:29,220 INFO L78 Accepts]: Start accepts. Automaton has 1125 states and 1287 transitions. Word has length 136 [2022-07-13 18:13:29,220 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 18:13:29,220 INFO L495 AbstractCegarLoop]: Abstraction has 1125 states and 1287 transitions. [2022-07-13 18:13:29,221 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, (9), 2 states have call predecessors, (9), 2 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2022-07-13 18:13:29,221 INFO L276 IsEmpty]: Start isEmpty. Operand 1125 states and 1287 transitions. [2022-07-13 18:13:29,222 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137 [2022-07-13 18:13:29,222 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 18:13:29,222 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 18:13:29,254 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:29,435 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:29,436 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 18:13:29,436 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 18:13:29,436 INFO L85 PathProgramCache]: Analyzing trace with hash 1278811050, now seen corresponding path program 1 times [2022-07-13 18:13:29,436 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 18:13:29,437 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [480050290] [2022-07-13 18:13:29,437 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 18:13:29,437 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 18:13:29,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:13:29,486 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-13 18:13:29,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:13:29,493 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-13 18:13:29,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:13:29,500 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-07-13 18:13:29,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:13:29,502 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2022-07-13 18:13:29,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:13:29,504 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2022-07-13 18:13:29,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:13:29,505 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2022-07-13 18:13:29,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:13:29,506 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2022-07-13 18:13:29,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:13:29,509 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-07-13 18:13:29,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:13:29,511 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2022-07-13 18:13:29,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:13:29,514 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-07-13 18:13:29,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:13:29,516 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 121 [2022-07-13 18:13:29,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:13:29,517 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:29,518 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 18:13:29,518 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [480050290] [2022-07-13 18:13:29,518 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [480050290] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 18:13:29,518 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 18:13:29,518 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-13 18:13:29,518 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [595413142] [2022-07-13 18:13:29,518 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 18:13:29,519 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-13 18:13:29,519 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 18:13:29,519 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-13 18:13:29,519 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-13 18:13:29,519 INFO L87 Difference]: Start difference. First operand 1125 states and 1287 transitions. Second operand has 6 states, 6 states have (on average 13.333333333333334) internal successors, (80), 4 states have internal predecessors, (80), 5 states have call successors, (10), 4 states have call predecessors, (10), 1 states have return successors, (9), 3 states have call predecessors, (9), 4 states have call successors, (9) [2022-07-13 18:13:29,938 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 18:13:29,939 INFO L93 Difference]: Finished difference Result 2085 states and 2361 transitions. [2022-07-13 18:13:29,939 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-07-13 18:13:29,939 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), 5 states have call successors, (10), 4 states have call predecessors, (10), 1 states have return successors, (9), 3 states have call predecessors, (9), 4 states have call successors, (9) Word has length 136 [2022-07-13 18:13:29,940 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 18:13:29,945 INFO L225 Difference]: With dead ends: 2085 [2022-07-13 18:13:29,945 INFO L226 Difference]: Without dead ends: 2082 [2022-07-13 18:13:29,946 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:29,947 INFO L413 NwaCegarLoop]: 214 mSDtfsCounter, 486 mSDsluCounter, 300 mSDsCounter, 0 mSdLazyCounter, 341 mSolverCounterSat, 91 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 509 SdHoareTripleChecker+Valid, 514 SdHoareTripleChecker+Invalid, 432 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 91 IncrementalHoareTripleChecker+Valid, 341 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-07-13 18:13:29,947 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [509 Valid, 514 Invalid, 432 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [91 Valid, 341 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-07-13 18:13:29,948 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2082 states. [2022-07-13 18:13:30,048 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2082 to 1501. [2022-07-13 18:13:30,050 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1501 states, 1236 states have (on average 1.1375404530744337) internal successors, (1406), 1251 states have internal predecessors, (1406), 146 states have call successors, (146), 104 states have call predecessors, (146), 118 states have return successors, (163), 146 states have call predecessors, (163), 144 states have call successors, (163) [2022-07-13 18:13:30,053 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1501 states to 1501 states and 1715 transitions. [2022-07-13 18:13:30,053 INFO L78 Accepts]: Start accepts. Automaton has 1501 states and 1715 transitions. Word has length 136 [2022-07-13 18:13:30,054 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 18:13:30,054 INFO L495 AbstractCegarLoop]: Abstraction has 1501 states and 1715 transitions. [2022-07-13 18:13:30,054 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), 5 states have call successors, (10), 4 states have call predecessors, (10), 1 states have return successors, (9), 3 states have call predecessors, (9), 4 states have call successors, (9) [2022-07-13 18:13:30,054 INFO L276 IsEmpty]: Start isEmpty. Operand 1501 states and 1715 transitions. [2022-07-13 18:13:30,056 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 141 [2022-07-13 18:13:30,056 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 18:13:30,056 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 18:13:30,056 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2022-07-13 18:13:30,056 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 18:13:30,057 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 18:13:30,057 INFO L85 PathProgramCache]: Analyzing trace with hash -1930463342, now seen corresponding path program 1 times [2022-07-13 18:13:30,057 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 18:13:30,057 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [556747432] [2022-07-13 18:13:30,057 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 18:13:30,057 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 18:13:30,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:13:30,077 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-13 18:13:30,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:13:30,082 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-13 18:13:30,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:13:30,087 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-07-13 18:13:30,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:13:30,089 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2022-07-13 18:13:30,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:13:30,090 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2022-07-13 18:13:30,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:13:30,092 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2022-07-13 18:13:30,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:13:30,093 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2022-07-13 18:13:30,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:13:30,095 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-07-13 18:13:30,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:13:30,097 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2022-07-13 18:13:30,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:13:30,098 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-07-13 18:13:30,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:13:30,100 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 121 [2022-07-13 18:13:30,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:13:30,101 INFO L134 CoverageAnalysis]: Checked inductivity of 82 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 82 trivial. 0 not checked. [2022-07-13 18:13:30,102 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 18:13:30,102 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [556747432] [2022-07-13 18:13:30,102 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [556747432] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 18:13:30,102 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 18:13:30,102 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-07-13 18:13:30,102 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [330008877] [2022-07-13 18:13:30,102 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 18:13:30,103 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-07-13 18:13:30,103 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 18:13:30,103 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-13 18:13:30,103 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-07-13 18:13:30,104 INFO L87 Difference]: Start difference. First operand 1501 states and 1715 transitions. Second operand has 5 states, 5 states have (on average 14.8) internal successors, (74), 3 states have internal predecessors, (74), 3 states have call successors, (9), 4 states have call predecessors, (9), 1 states have return successors, (8), 1 states have call predecessors, (8), 2 states have call successors, (8) [2022-07-13 18:13:30,314 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 18:13:30,315 INFO L93 Difference]: Finished difference Result 2724 states and 3203 transitions. [2022-07-13 18:13:30,315 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-07-13 18:13:30,315 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 14.8) internal successors, (74), 3 states have internal predecessors, (74), 3 states have call successors, (9), 4 states have call predecessors, (9), 1 states have return successors, (8), 1 states have call predecessors, (8), 2 states have call successors, (8) Word has length 140 [2022-07-13 18:13:30,315 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 18:13:30,320 INFO L225 Difference]: With dead ends: 2724 [2022-07-13 18:13:30,320 INFO L226 Difference]: Without dead ends: 1864 [2022-07-13 18:13:30,322 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-07-13 18:13:30,322 INFO L413 NwaCegarLoop]: 193 mSDtfsCounter, 142 mSDsluCounter, 275 mSDsCounter, 0 mSdLazyCounter, 206 mSolverCounterSat, 34 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 154 SdHoareTripleChecker+Valid, 468 SdHoareTripleChecker+Invalid, 240 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 34 IncrementalHoareTripleChecker+Valid, 206 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-13 18:13:30,322 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [154 Valid, 468 Invalid, 240 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [34 Valid, 206 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-13 18:13:30,324 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1864 states. [2022-07-13 18:13:30,420 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1864 to 1503. [2022-07-13 18:13:30,422 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1503 states, 1238 states have (on average 1.137318255250404) internal successors, (1408), 1253 states have internal predecessors, (1408), 146 states have call successors, (146), 104 states have call predecessors, (146), 118 states have return successors, (163), 146 states have call predecessors, (163), 144 states have call successors, (163) [2022-07-13 18:13:30,425 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1503 states to 1503 states and 1717 transitions. [2022-07-13 18:13:30,425 INFO L78 Accepts]: Start accepts. Automaton has 1503 states and 1717 transitions. Word has length 140 [2022-07-13 18:13:30,426 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 18:13:30,426 INFO L495 AbstractCegarLoop]: Abstraction has 1503 states and 1717 transitions. [2022-07-13 18:13:30,426 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 14.8) internal successors, (74), 3 states have internal predecessors, (74), 3 states have call successors, (9), 4 states have call predecessors, (9), 1 states have return successors, (8), 1 states have call predecessors, (8), 2 states have call successors, (8) [2022-07-13 18:13:30,426 INFO L276 IsEmpty]: Start isEmpty. Operand 1503 states and 1717 transitions. [2022-07-13 18:13:30,428 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 142 [2022-07-13 18:13:30,428 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 18:13:30,428 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 18:13:30,428 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2022-07-13 18:13:30,428 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 18:13:30,429 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 18:13:30,429 INFO L85 PathProgramCache]: Analyzing trace with hash 1514412424, now seen corresponding path program 1 times [2022-07-13 18:13:30,429 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 18:13:30,429 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1479471323] [2022-07-13 18:13:30,429 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 18:13:30,429 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 18:13:30,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-13 18:13:30,439 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-13 18:13:30,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-13 18:13:30,466 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-13 18:13:30,467 INFO L271 BasicCegarLoop]: Counterexample is feasible [2022-07-13 18:13:30,467 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location errorErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2022-07-13 18:13:30,469 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2022-07-13 18:13:30,470 INFO L356 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 18:13:30,473 INFO L176 ceAbstractionStarter]: Computing trace abstraction results [2022-07-13 18:13:30,532 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 13.07 06:13:30 BoogieIcfgContainer [2022-07-13 18:13:30,532 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-07-13 18:13:30,533 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-07-13 18:13:30,533 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-07-13 18:13:30,533 INFO L275 PluginConnector]: Witness Printer initialized [2022-07-13 18:13:30,533 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.07 06:13:16" (3/4) ... [2022-07-13 18:13:30,534 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2022-07-13 18:13:30,585 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2022-07-13 18:13:30,585 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-07-13 18:13:30,586 INFO L158 Benchmark]: Toolchain (without parser) took 15073.72ms. Allocated memory was 94.4MB in the beginning and 530.6MB in the end (delta: 436.2MB). Free memory was 57.8MB in the beginning and 366.0MB in the end (delta: -308.2MB). Peak memory consumption was 128.1MB. Max. memory is 16.1GB. [2022-07-13 18:13:30,586 INFO L158 Benchmark]: CDTParser took 0.17ms. Allocated memory is still 94.4MB. Free memory was 74.1MB in the beginning and 74.0MB in the end (delta: 92.4kB). There was no memory consumed. Max. memory is 16.1GB. [2022-07-13 18:13:30,586 INFO L158 Benchmark]: CACSL2BoogieTranslator took 304.93ms. Allocated memory is still 94.4MB. Free memory was 57.6MB in the beginning and 68.1MB in the end (delta: -10.5MB). Peak memory consumption was 9.8MB. Max. memory is 16.1GB. [2022-07-13 18:13:30,587 INFO L158 Benchmark]: Boogie Procedure Inliner took 27.96ms. Allocated memory is still 94.4MB. Free memory was 68.1MB in the beginning and 66.2MB in the end (delta: 2.0MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-07-13 18:13:30,587 INFO L158 Benchmark]: Boogie Preprocessor took 15.52ms. Allocated memory is still 94.4MB. Free memory was 66.2MB in the beginning and 64.5MB in the end (delta: 1.7MB). There was no memory consumed. Max. memory is 16.1GB. [2022-07-13 18:13:30,587 INFO L158 Benchmark]: RCFGBuilder took 456.95ms. Allocated memory is still 94.4MB. Free memory was 64.5MB in the beginning and 69.7MB in the end (delta: -5.2MB). Peak memory consumption was 20.9MB. Max. memory is 16.1GB. [2022-07-13 18:13:30,587 INFO L158 Benchmark]: TraceAbstraction took 14210.08ms. Allocated memory was 94.4MB in the beginning and 530.6MB in the end (delta: 436.2MB). Free memory was 68.9MB in the beginning and 376.6MB in the end (delta: -307.7MB). Peak memory consumption was 128.6MB. Max. memory is 16.1GB. [2022-07-13 18:13:30,587 INFO L158 Benchmark]: Witness Printer took 53.01ms. Allocated memory is still 530.6MB. Free memory was 376.6MB in the beginning and 366.0MB in the end (delta: 10.6MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2022-07-13 18:13:30,588 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.17ms. Allocated memory is still 94.4MB. Free memory was 74.1MB in the beginning and 74.0MB in the end (delta: 92.4kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 304.93ms. Allocated memory is still 94.4MB. Free memory was 57.6MB in the beginning and 68.1MB in the end (delta: -10.5MB). Peak memory consumption was 9.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 27.96ms. Allocated memory is still 94.4MB. Free memory was 68.1MB in the beginning and 66.2MB in the end (delta: 2.0MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 15.52ms. Allocated memory is still 94.4MB. Free memory was 66.2MB in the beginning and 64.5MB in the end (delta: 1.7MB). There was no memory consumed. Max. memory is 16.1GB. * RCFGBuilder took 456.95ms. Allocated memory is still 94.4MB. Free memory was 64.5MB in the beginning and 69.7MB in the end (delta: -5.2MB). Peak memory consumption was 20.9MB. Max. memory is 16.1GB. * TraceAbstraction took 14210.08ms. Allocated memory was 94.4MB in the beginning and 530.6MB in the end (delta: 436.2MB). Free memory was 68.9MB in the beginning and 376.6MB in the end (delta: -307.7MB). Peak memory consumption was 128.6MB. Max. memory is 16.1GB. * Witness Printer took 53.01ms. Allocated memory is still 530.6MB. Free memory was 376.6MB in the beginning and 366.0MB in the end (delta: 10.6MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - CounterExampleResult [Line: 20]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L24] int m_pc = 0; [L25] int t1_pc = 0; [L26] int m_st ; [L27] int t1_st ; [L28] int m_i ; [L29] int t1_i ; [L30] int M_E = 2; [L31] int T1_E = 2; [L32] int E_M = 2; [L33] int E_1 = 2; [L37] int token ; [L39] int local ; VAL [E_1=2, E_M=2, local=0, M_E=2, m_i=0, m_pc=0, m_st=0, T1_E=2, t1_i=0, t1_pc=0, t1_st=0, token=0] [L485] int __retres1 ; [L489] CALL init_model() [L400] m_i = 1 [L401] t1_i = 1 VAL [E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, token=0] [L489] RET init_model() [L490] CALL start_simulation() [L426] int kernel_st ; [L427] int tmp ; [L428] int tmp___0 ; [L432] kernel_st = 0 VAL [E_1=2, E_M=2, kernel_st=0, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, token=0] [L433] FCALL update_channels() VAL [E_1=2, E_M=2, kernel_st=0, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, token=0] [L434] CALL init_threads() [L182] COND TRUE m_i == 1 [L183] m_st = 0 VAL [E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, token=0] [L187] COND TRUE t1_i == 1 [L188] t1_st = 0 VAL [E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, token=0] [L434] RET init_threads() [L435] CALL fire_delta_events() VAL [\old(E_1)=2, \old(E_M)=2, \old(M_E)=2, \old(T1_E)=2, E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, token=0] [L271] COND FALSE !(M_E == 0) VAL [\old(E_1)=2, \old(E_M)=2, \old(M_E)=2, \old(T1_E)=2, E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, token=0] [L276] COND FALSE !(T1_E == 0) VAL [\old(E_1)=2, \old(E_M)=2, \old(M_E)=2, \old(T1_E)=2, E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, token=0] [L281] COND FALSE !(E_M == 0) VAL [\old(E_1)=2, \old(E_M)=2, \old(M_E)=2, \old(T1_E)=2, E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, token=0] [L286] COND FALSE !(E_1 == 0) VAL [\old(E_1)=2, \old(E_M)=2, \old(M_E)=2, \old(T1_E)=2, E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, token=0] [L435] RET fire_delta_events() VAL [E_1=2, E_M=2, kernel_st=0, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, token=0] [L436] CALL activate_threads() VAL [\old(m_st)=0, \old(t1_st)=0, E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, token=0] [L324] int tmp ; [L325] int tmp___0 ; [L329] CALL, EXPR is_master_triggered() [L133] int __retres1 ; VAL [\old(m_st)=0, \old(t1_st)=0, E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, token=0] [L136] COND FALSE !(m_pc == 1) VAL [\old(m_st)=0, \old(t1_st)=0, E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, token=0] [L146] __retres1 = 0 VAL [\old(m_st)=0, \old(t1_st)=0, __retres1=0, E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, token=0] [L148] return (__retres1); VAL [\old(m_st)=0, \old(t1_st)=0, \result=0, __retres1=0, E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, token=0] [L329] RET, EXPR is_master_triggered() [L329] tmp = is_master_triggered() [L331] COND FALSE !(\read(tmp)) VAL [\old(m_st)=0, \old(t1_st)=0, E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, tmp=0, token=0] [L337] CALL, EXPR is_transmit1_triggered() [L152] int __retres1 ; VAL [\old(m_st)=0, \old(t1_st)=0, E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, token=0] [L155] COND FALSE !(t1_pc == 1) VAL [\old(m_st)=0, \old(t1_st)=0, E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, token=0] [L165] __retres1 = 0 VAL [\old(m_st)=0, \old(t1_st)=0, __retres1=0, E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, token=0] [L167] return (__retres1); VAL [\old(m_st)=0, \old(t1_st)=0, \result=0, __retres1=0, E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, token=0] [L337] RET, EXPR is_transmit1_triggered() [L337] tmp___0 = is_transmit1_triggered() [L339] COND FALSE !(\read(tmp___0)) VAL [\old(m_st)=0, \old(t1_st)=0, E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, tmp=0, tmp___0=0, token=0] [L436] RET activate_threads() VAL [E_1=2, E_M=2, kernel_st=0, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, token=0] [L437] CALL reset_delta_events() VAL [\old(E_1)=2, \old(E_M)=2, \old(M_E)=2, \old(T1_E)=2, E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, token=0] [L299] COND FALSE !(M_E == 1) VAL [\old(E_1)=2, \old(E_M)=2, \old(M_E)=2, \old(T1_E)=2, E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, token=0] [L304] COND FALSE !(T1_E == 1) VAL [\old(E_1)=2, \old(E_M)=2, \old(M_E)=2, \old(T1_E)=2, E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, token=0] [L309] COND FALSE !(E_M == 1) VAL [\old(E_1)=2, \old(E_M)=2, \old(M_E)=2, \old(T1_E)=2, E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, token=0] [L314] COND FALSE !(E_1 == 1) VAL [\old(E_1)=2, \old(E_M)=2, \old(M_E)=2, \old(T1_E)=2, E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, token=0] [L437] RET reset_delta_events() VAL [E_1=2, E_M=2, kernel_st=0, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, token=0] [L440] COND TRUE 1 VAL [E_1=2, E_M=2, kernel_st=0, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, token=0] [L443] kernel_st = 1 [L444] CALL eval() [L218] int tmp ; VAL [E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, token=0] [L222] COND TRUE 1 VAL [E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, token=0] [L225] CALL, EXPR exists_runnable_thread() VAL [E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, token=0] [L197] int __retres1 ; VAL [E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, token=0] [L200] COND TRUE m_st == 0 [L201] __retres1 = 1 VAL [__retres1=1, E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, token=0] [L213] return (__retres1); VAL [\result=1, __retres1=1, E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, token=0] [L225] RET, EXPR exists_runnable_thread() VAL [E_1=2, E_M=2, exists_runnable_thread()=1, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, token=0] [L225] tmp = exists_runnable_thread() [L227] COND TRUE \read(tmp) VAL [E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, tmp=1, token=0] [L232] COND TRUE m_st == 0 [L233] int tmp_ndt_1; [L234] tmp_ndt_1 = __VERIFIER_nondet_int() [L235] COND FALSE !(\read(tmp_ndt_1)) VAL [E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, tmp=1, tmp_ndt_1=0, token=0] [L246] COND TRUE t1_st == 0 [L247] int tmp_ndt_2; [L248] tmp_ndt_2 = __VERIFIER_nondet_int() [L249] COND TRUE \read(tmp_ndt_2) [L251] t1_st = 1 [L252] CALL transmit1() [L100] COND TRUE t1_pc == 0 VAL [E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=1, token=0] [L111] COND TRUE 1 VAL [E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=1, token=0] [L113] t1_pc = 1 [L114] t1_st = 2 VAL [E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, token=0] [L252] RET transmit1() [L222] COND TRUE 1 VAL [E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, tmp=1, tmp_ndt_1=0, tmp_ndt_2=-1, token=0] [L225] CALL, EXPR exists_runnable_thread() VAL [E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, token=0] [L197] int __retres1 ; VAL [E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, token=0] [L200] COND TRUE m_st == 0 [L201] __retres1 = 1 VAL [__retres1=1, E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, token=0] [L213] return (__retres1); VAL [\result=1, __retres1=1, E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, token=0] [L225] RET, EXPR exists_runnable_thread() VAL [E_1=2, E_M=2, exists_runnable_thread()=1, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, tmp=1, tmp_ndt_1=0, tmp_ndt_2=-1, token=0] [L225] tmp = exists_runnable_thread() [L227] COND TRUE \read(tmp) VAL [E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, tmp=1, tmp_ndt_1=0, tmp_ndt_2=-1, token=0] [L232] COND TRUE m_st == 0 [L233] int tmp_ndt_1; [L234] tmp_ndt_1 = __VERIFIER_nondet_int() [L235] COND TRUE \read(tmp_ndt_1) [L237] m_st = 1 [L238] CALL master() [L42] int tmp_var = __VERIFIER_nondet_int(); [L44] COND TRUE m_pc == 0 VAL [E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, tmp_var=0, token=0] [L55] COND TRUE 1 VAL [E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, tmp_var=0, token=0] [L58] token = __VERIFIER_nondet_int() [L59] local = token [L60] E_1 = 1 VAL [E_1=1, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, tmp_var=0, token=0] [L61] CALL immediate_notify() VAL [\old(m_st)=1, \old(t1_st)=2, E_1=1, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, token=0] [L353] CALL activate_threads() VAL [\old(m_st)=1, \old(t1_st)=2, E_1=1, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, token=0] [L324] int tmp ; [L325] int tmp___0 ; [L329] CALL, EXPR is_master_triggered() [L133] int __retres1 ; VAL [\old(m_st)=1, \old(t1_st)=2, E_1=1, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, token=0] [L136] COND FALSE !(m_pc == 1) VAL [\old(m_st)=1, \old(t1_st)=2, E_1=1, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, token=0] [L146] __retres1 = 0 VAL [\old(m_st)=1, \old(t1_st)=2, __retres1=0, E_1=1, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, token=0] [L148] return (__retres1); VAL [\old(m_st)=1, \old(t1_st)=2, \result=0, __retres1=0, E_1=1, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, token=0] [L329] RET, EXPR is_master_triggered() [L329] tmp = is_master_triggered() [L331] COND FALSE !(\read(tmp)) VAL [\old(m_st)=1, \old(t1_st)=2, E_1=1, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, tmp=0, token=0] [L337] CALL, EXPR is_transmit1_triggered() [L152] int __retres1 ; VAL [\old(m_st)=1, \old(t1_st)=2, E_1=1, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, token=0] [L155] COND TRUE t1_pc == 1 VAL [\old(m_st)=1, \old(t1_st)=2, E_1=1, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, token=0] [L156] COND TRUE E_1 == 1 [L157] __retres1 = 1 VAL [\old(m_st)=1, \old(t1_st)=2, __retres1=1, E_1=1, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, token=0] [L167] return (__retres1); VAL [\old(m_st)=1, \old(t1_st)=2, \result=1, __retres1=1, E_1=1, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, token=0] [L337] RET, EXPR is_transmit1_triggered() [L337] tmp___0 = is_transmit1_triggered() [L339] COND TRUE \read(tmp___0) [L340] t1_st = 0 VAL [\old(m_st)=1, \old(t1_st)=2, E_1=1, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=0, tmp=0, tmp___0=1, token=0] [L353] RET activate_threads() VAL [\old(m_st)=1, \old(t1_st)=2, E_1=1, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=0, token=0] [L61] RET immediate_notify() VAL [E_1=1, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=0, tmp_var=0, token=0] [L62] E_1 = 2 [L63] m_pc = 1 [L64] m_st = 2 VAL [E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=0, tmp_var=0, token=0] [L238] RET master() [L246] COND TRUE t1_st == 0 [L247] int tmp_ndt_2; [L248] tmp_ndt_2 = __VERIFIER_nondet_int() [L249] COND TRUE \read(tmp_ndt_2) [L251] t1_st = 1 [L252] CALL transmit1() [L100] COND FALSE !(t1_pc == 0) VAL [E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, token=0] [L103] COND TRUE t1_pc == 1 VAL [E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, token=0] [L119] token += 1 [L120] E_M = 1 VAL [E_1=2, E_M=1, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, token=1] [L121] CALL immediate_notify() VAL [\old(m_st)=2, \old(t1_st)=1, E_1=2, E_M=1, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, token=1] [L353] CALL activate_threads() VAL [\old(m_st)=2, \old(t1_st)=1, E_1=2, E_M=1, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, token=1] [L324] int tmp ; [L325] int tmp___0 ; [L329] CALL, EXPR is_master_triggered() [L133] int __retres1 ; VAL [\old(m_st)=2, \old(t1_st)=1, E_1=2, E_M=1, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, token=1] [L136] COND TRUE m_pc == 1 VAL [\old(m_st)=2, \old(t1_st)=1, E_1=2, E_M=1, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, token=1] [L137] COND TRUE E_M == 1 [L138] __retres1 = 1 VAL [\old(m_st)=2, \old(t1_st)=1, __retres1=1, E_1=2, E_M=1, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, token=1] [L148] return (__retres1); VAL [\old(m_st)=2, \old(t1_st)=1, \result=1, __retres1=1, E_1=2, E_M=1, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, token=1] [L329] RET, EXPR is_master_triggered() [L329] tmp = is_master_triggered() [L331] COND TRUE \read(tmp) [L332] m_st = 0 VAL [\old(m_st)=2, \old(t1_st)=1, E_1=2, E_M=1, local=0, M_E=2, m_i=1, m_pc=1, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, tmp=1, token=1] [L337] CALL, EXPR is_transmit1_triggered() [L152] int __retres1 ; VAL [\old(m_st)=2, \old(t1_st)=1, E_1=2, E_M=1, local=0, M_E=2, m_i=1, m_pc=1, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, token=1] [L155] COND TRUE t1_pc == 1 VAL [\old(m_st)=2, \old(t1_st)=1, E_1=2, E_M=1, local=0, M_E=2, m_i=1, m_pc=1, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, token=1] [L156] COND FALSE !(E_1 == 1) VAL [\old(m_st)=2, \old(t1_st)=1, E_1=2, E_M=1, local=0, M_E=2, m_i=1, m_pc=1, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, token=1] [L165] __retres1 = 0 VAL [\old(m_st)=2, \old(t1_st)=1, __retres1=0, E_1=2, E_M=1, local=0, M_E=2, m_i=1, m_pc=1, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, token=1] [L167] return (__retres1); VAL [\old(m_st)=2, \old(t1_st)=1, \result=0, __retres1=0, E_1=2, E_M=1, local=0, M_E=2, m_i=1, m_pc=1, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, token=1] [L337] RET, EXPR is_transmit1_triggered() [L337] tmp___0 = is_transmit1_triggered() [L339] COND FALSE !(\read(tmp___0)) VAL [\old(m_st)=2, \old(t1_st)=1, E_1=2, E_M=1, local=0, M_E=2, m_i=1, m_pc=1, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, tmp=1, tmp___0=0, token=1] [L353] RET activate_threads() VAL [\old(m_st)=2, \old(t1_st)=1, E_1=2, E_M=1, local=0, M_E=2, m_i=1, m_pc=1, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, token=1] [L121] RET immediate_notify() VAL [E_1=2, E_M=1, local=0, M_E=2, m_i=1, m_pc=1, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, token=1] [L122] E_M = 2 VAL [E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, token=1] [L111] COND TRUE 1 VAL [E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, token=1] [L113] t1_pc = 1 [L114] t1_st = 2 VAL [E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, token=1] [L252] RET transmit1() [L222] COND TRUE 1 VAL [E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, tmp=1, tmp_ndt_1=1, tmp_ndt_2=-2, token=1] [L225] CALL, EXPR exists_runnable_thread() VAL [E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, token=1] [L197] int __retres1 ; VAL [E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, token=1] [L200] COND TRUE m_st == 0 [L201] __retres1 = 1 VAL [__retres1=1, E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, token=1] [L213] return (__retres1); VAL [\result=1, __retres1=1, E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, token=1] [L225] RET, EXPR exists_runnable_thread() VAL [E_1=2, E_M=2, exists_runnable_thread()=1, local=0, M_E=2, m_i=1, m_pc=1, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, tmp=1, tmp_ndt_1=1, tmp_ndt_2=-2, token=1] [L225] tmp = exists_runnable_thread() [L227] COND TRUE \read(tmp) VAL [E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, tmp=1, tmp_ndt_1=1, tmp_ndt_2=-2, token=1] [L232] COND TRUE m_st == 0 [L233] int tmp_ndt_1; [L234] tmp_ndt_1 = __VERIFIER_nondet_int() [L235] COND TRUE \read(tmp_ndt_1) [L237] m_st = 1 [L238] CALL master() [L42] int tmp_var = __VERIFIER_nondet_int(); [L44] COND FALSE !(m_pc == 0) VAL [E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, tmp_var=5, token=1] [L47] COND TRUE m_pc == 1 VAL [E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, tmp_var=5, token=1] [L69] COND FALSE !(token != local + 1) VAL [E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, tmp_var=5, token=1] [L74] COND TRUE tmp_var <= 5 VAL [E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, tmp_var=5, token=1] [L75] COND TRUE tmp_var >= 5 VAL [E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, tmp_var=5, token=1] [L80] COND TRUE tmp_var <= 5 VAL [E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, tmp_var=5, token=1] [L81] COND TRUE tmp_var >= 5 VAL [E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, tmp_var=5, token=1] [L82] COND TRUE tmp_var == 5 VAL [E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, tmp_var=5, token=1] [L83] CALL error() VAL [E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, token=1] [L20] reach_error() VAL [E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, token=1] - StatisticsResult: Ultimate Automizer benchmark data CFG has 8 procedures, 115 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 14.1s, OverallIterations: 17, TraceHistogramMax: 3, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.1s, AutomataDifference: 7.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 3273 SdHoareTripleChecker+Valid, 5.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 3166 mSDsluCounter, 7744 SdHoareTripleChecker+Invalid, 4.6s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 4580 mSDsCounter, 543 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 3726 IncrementalHoareTripleChecker+Invalid, 4269 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 543 mSolverCounterUnsat, 3164 mSDtfsCounter, 3726 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 1596 GetRequests, 1451 SyntacticMatches, 4 SemanticMatches, 141 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 175 ImplicationChecksByTransitivity, 1.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=4514occurred in iteration=8, InterpolantAutomatonStates: 120, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 1.6s AutomataMinimizationTime, 16 MinimizatonAttempts, 3064 StatesRemovedByMinimization, 15 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 1.6s InterpolantComputationTime, 3018 NumberOfCodeBlocks, 3018 NumberOfCodeBlocksAsserted, 26 NumberOfCheckSat, 2852 ConstructedInterpolants, 0 QuantifiedInterpolants, 4610 SizeOfPredicates, 6 NumberOfNonLiveVariables, 3590 ConjunctsInSsa, 38 ConjunctsInUnsatCore, 25 InterpolantComputations, 16 PerfectInterpolantSequences, 1302/1472 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! [2022-07-13 18:13:30,636 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE