./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 ae007674 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-dev-ae00767 [2021-12-28 01:03:25,628 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-12-28 01:03:25,630 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-12-28 01:03:25,660 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-12-28 01:03:25,661 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-12-28 01:03:25,663 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-12-28 01:03:25,664 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-12-28 01:03:25,668 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-12-28 01:03:25,670 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-12-28 01:03:25,673 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-12-28 01:03:25,674 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-12-28 01:03:25,677 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-12-28 01:03:25,677 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-12-28 01:03:25,679 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-12-28 01:03:25,680 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-12-28 01:03:25,682 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-12-28 01:03:25,682 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-12-28 01:03:25,683 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-12-28 01:03:25,684 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-12-28 01:03:25,688 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-12-28 01:03:25,689 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-12-28 01:03:25,690 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-12-28 01:03:25,691 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-12-28 01:03:25,692 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-12-28 01:03:25,697 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-12-28 01:03:25,697 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-12-28 01:03:25,697 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-12-28 01:03:25,698 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-12-28 01:03:25,699 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-12-28 01:03:25,699 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-12-28 01:03:25,699 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-12-28 01:03:25,700 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-12-28 01:03:25,701 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-12-28 01:03:25,701 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-12-28 01:03:25,702 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-12-28 01:03:25,702 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-12-28 01:03:25,703 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-12-28 01:03:25,703 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-12-28 01:03:25,703 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-12-28 01:03:25,704 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-12-28 01:03:25,705 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-12-28 01:03:25,706 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2021-12-28 01:03:25,741 INFO L113 SettingsManager]: Loading preferences was successful [2021-12-28 01:03:25,742 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-12-28 01:03:25,742 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2021-12-28 01:03:25,742 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2021-12-28 01:03:25,743 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2021-12-28 01:03:25,743 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2021-12-28 01:03:25,745 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-12-28 01:03:25,746 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-12-28 01:03:25,746 INFO L138 SettingsManager]: * Use SBE=true [2021-12-28 01:03:25,746 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-12-28 01:03:25,747 INFO L138 SettingsManager]: * sizeof long=4 [2021-12-28 01:03:25,747 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-12-28 01:03:25,747 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-12-28 01:03:25,747 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-12-28 01:03:25,747 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-12-28 01:03:25,748 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-12-28 01:03:25,748 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-12-28 01:03:25,748 INFO L138 SettingsManager]: * sizeof long double=12 [2021-12-28 01:03:25,748 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-12-28 01:03:25,748 INFO L138 SettingsManager]: * Use constant arrays=true [2021-12-28 01:03:25,749 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-12-28 01:03:25,749 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-12-28 01:03:25,749 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-12-28 01:03:25,749 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-12-28 01:03:25,749 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-12-28 01:03:25,749 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-12-28 01:03:25,750 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-12-28 01:03:25,750 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-12-28 01:03:25,750 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-12-28 01:03:25,750 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-12-28 01:03:25,750 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2021-12-28 01:03:25,750 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2021-12-28 01:03:25,751 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2021-12-28 01:03:25,751 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 [2021-12-28 01:03:26,031 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-12-28 01:03:26,052 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-12-28 01:03:26,054 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-12-28 01:03:26,054 INFO L271 PluginConnector]: Initializing CDTParser... [2021-12-28 01:03:26,055 INFO L275 PluginConnector]: CDTParser initialized [2021-12-28 01:03:26,056 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 [2021-12-28 01:03:26,101 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9ff559d57/72b65b0a62f94cbb81211807963c244d/FLAGe15934b14 [2021-12-28 01:03:26,416 INFO L306 CDTParser]: Found 1 translation units. [2021-12-28 01:03:26,416 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/systemc/token_ring.01.cil-2.c [2021-12-28 01:03:26,422 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9ff559d57/72b65b0a62f94cbb81211807963c244d/FLAGe15934b14 [2021-12-28 01:03:26,855 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9ff559d57/72b65b0a62f94cbb81211807963c244d [2021-12-28 01:03:26,857 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-12-28 01:03:26,858 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-12-28 01:03:26,858 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-12-28 01:03:26,858 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-12-28 01:03:26,861 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-12-28 01:03:26,861 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.12 01:03:26" (1/1) ... [2021-12-28 01:03:26,862 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@59cd3ee5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.12 01:03:26, skipping insertion in model container [2021-12-28 01:03:26,862 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.12 01:03:26" (1/1) ... [2021-12-28 01:03:26,867 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-12-28 01:03:26,890 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-12-28 01:03:27,015 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] [2021-12-28 01:03:27,072 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-12-28 01:03:27,085 INFO L203 MainTranslator]: Completed pre-run [2021-12-28 01:03:27,118 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] [2021-12-28 01:03:27,140 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-12-28 01:03:27,150 INFO L208 MainTranslator]: Completed translation [2021-12-28 01:03:27,150 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.12 01:03:27 WrapperNode [2021-12-28 01:03:27,150 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-12-28 01:03:27,151 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-12-28 01:03:27,151 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-12-28 01:03:27,152 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-12-28 01:03:27,156 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.12 01:03:27" (1/1) ... [2021-12-28 01:03:27,168 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.12 01:03:27" (1/1) ... [2021-12-28 01:03:27,193 INFO L137 Inliner]: procedures = 30, calls = 35, calls flagged for inlining = 13, calls inlined = 13, statements flattened = 220 [2021-12-28 01:03:27,193 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-12-28 01:03:27,194 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-12-28 01:03:27,194 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-12-28 01:03:27,194 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-12-28 01:03:27,200 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.12 01:03:27" (1/1) ... [2021-12-28 01:03:27,200 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.12 01:03:27" (1/1) ... [2021-12-28 01:03:27,209 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.12 01:03:27" (1/1) ... [2021-12-28 01:03:27,209 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.12 01:03:27" (1/1) ... [2021-12-28 01:03:27,219 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.12 01:03:27" (1/1) ... [2021-12-28 01:03:27,225 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.12 01:03:27" (1/1) ... [2021-12-28 01:03:27,227 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.12 01:03:27" (1/1) ... [2021-12-28 01:03:27,228 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-12-28 01:03:27,228 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-12-28 01:03:27,229 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-12-28 01:03:27,229 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-12-28 01:03:27,229 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.12 01:03:27" (1/1) ... [2021-12-28 01:03:27,243 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-12-28 01:03:27,250 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-28 01:03:27,259 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2021-12-28 01:03:27,264 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2021-12-28 01:03:27,282 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2021-12-28 01:03:27,282 INFO L130 BoogieDeclarations]: Found specification of procedure error [2021-12-28 01:03:27,282 INFO L138 BoogieDeclarations]: Found implementation of procedure error [2021-12-28 01:03:27,282 INFO L130 BoogieDeclarations]: Found specification of procedure fire_delta_events [2021-12-28 01:03:27,282 INFO L138 BoogieDeclarations]: Found implementation of procedure fire_delta_events [2021-12-28 01:03:27,282 INFO L130 BoogieDeclarations]: Found specification of procedure activate_threads [2021-12-28 01:03:27,282 INFO L138 BoogieDeclarations]: Found implementation of procedure activate_threads [2021-12-28 01:03:27,283 INFO L130 BoogieDeclarations]: Found specification of procedure immediate_notify [2021-12-28 01:03:27,283 INFO L138 BoogieDeclarations]: Found implementation of procedure immediate_notify [2021-12-28 01:03:27,283 INFO L130 BoogieDeclarations]: Found specification of procedure exists_runnable_thread [2021-12-28 01:03:27,284 INFO L138 BoogieDeclarations]: Found implementation of procedure exists_runnable_thread [2021-12-28 01:03:27,284 INFO L130 BoogieDeclarations]: Found specification of procedure reset_delta_events [2021-12-28 01:03:27,284 INFO L138 BoogieDeclarations]: Found implementation of procedure reset_delta_events [2021-12-28 01:03:27,284 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-12-28 01:03:27,284 INFO L130 BoogieDeclarations]: Found specification of procedure update_channels [2021-12-28 01:03:27,285 INFO L138 BoogieDeclarations]: Found implementation of procedure update_channels [2021-12-28 01:03:27,285 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-12-28 01:03:27,285 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-12-28 01:03:27,344 INFO L234 CfgBuilder]: Building ICFG [2021-12-28 01:03:27,345 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2021-12-28 01:03:27,639 INFO L275 CfgBuilder]: Performing block encoding [2021-12-28 01:03:27,645 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-12-28 01:03:27,645 INFO L299 CfgBuilder]: Removed 4 assume(true) statements. [2021-12-28 01:03:27,646 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.12 01:03:27 BoogieIcfgContainer [2021-12-28 01:03:27,646 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-12-28 01:03:27,647 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-12-28 01:03:27,647 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-12-28 01:03:27,649 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-12-28 01:03:27,649 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 28.12 01:03:26" (1/3) ... [2021-12-28 01:03:27,650 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4dc548be and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.12 01:03:27, skipping insertion in model container [2021-12-28 01:03:27,650 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.12 01:03:27" (2/3) ... [2021-12-28 01:03:27,650 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4dc548be and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.12 01:03:27, skipping insertion in model container [2021-12-28 01:03:27,650 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.12 01:03:27" (3/3) ... [2021-12-28 01:03:27,654 INFO L111 eAbstractionObserver]: Analyzing ICFG token_ring.01.cil-2.c [2021-12-28 01:03:27,658 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-12-28 01:03:27,658 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2021-12-28 01:03:27,700 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2021-12-28 01:03:27,706 INFO L339 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mLoopAccelerationTechnique=FAST_UPR [2021-12-28 01:03:27,707 INFO L340 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2021-12-28 01:03:27,722 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) [2021-12-28 01:03:27,730 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2021-12-28 01:03:27,730 INFO L506 BasicCegarLoop]: Found error trace [2021-12-28 01:03:27,731 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-28 01:03:27,732 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-28 01:03:27,737 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-28 01:03:27,738 INFO L85 PathProgramCache]: Analyzing trace with hash 1377578721, now seen corresponding path program 1 times [2021-12-28 01:03:27,744 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-28 01:03:27,745 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [362927931] [2021-12-28 01:03:27,745 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-28 01:03:27,745 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-28 01:03:27,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 01:03:27,920 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-28 01:03:27,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 01:03:27,934 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-12-28 01:03:27,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 01:03:27,962 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2021-12-28 01:03:27,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 01:03:27,991 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2021-12-28 01:03:28,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 01:03:28,004 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2021-12-28 01:03:28,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 01:03:28,008 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-28 01:03:28,009 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-28 01:03:28,009 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [362927931] [2021-12-28 01:03:28,009 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [362927931] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-28 01:03:28,009 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-28 01:03:28,009 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-12-28 01:03:28,010 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1221332869] [2021-12-28 01:03:28,011 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-28 01:03:28,013 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-12-28 01:03:28,013 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-28 01:03:28,030 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-12-28 01:03:28,030 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-12-28 01:03:28,032 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) [2021-12-28 01:03:28,543 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-28 01:03:28,543 INFO L93 Difference]: Finished difference Result 361 states and 553 transitions. [2021-12-28 01:03:28,545 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-12-28 01:03:28,547 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 [2021-12-28 01:03:28,547 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-28 01:03:28,556 INFO L225 Difference]: With dead ends: 361 [2021-12-28 01:03:28,556 INFO L226 Difference]: Without dead ends: 247 [2021-12-28 01:03:28,558 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=33, Invalid=77, Unknown=0, NotChecked=0, Total=110 [2021-12-28 01:03:28,560 INFO L933 BasicCegarLoop]: 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 [2021-12-28 01:03:28,561 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [317 Valid, 498 Invalid, 494 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [80 Valid, 414 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2021-12-28 01:03:28,573 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 247 states. [2021-12-28 01:03:28,602 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 247 to 204. [2021-12-28 01:03:28,604 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) [2021-12-28 01:03:28,605 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 204 states to 204 states and 294 transitions. [2021-12-28 01:03:28,606 INFO L78 Accepts]: Start accepts. Automaton has 204 states and 294 transitions. Word has length 57 [2021-12-28 01:03:28,606 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-28 01:03:28,606 INFO L470 AbstractCegarLoop]: Abstraction has 204 states and 294 transitions. [2021-12-28 01:03:28,607 INFO L471 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) [2021-12-28 01:03:28,607 INFO L276 IsEmpty]: Start isEmpty. Operand 204 states and 294 transitions. [2021-12-28 01:03:28,608 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2021-12-28 01:03:28,608 INFO L506 BasicCegarLoop]: Found error trace [2021-12-28 01:03:28,608 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-28 01:03:28,608 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-12-28 01:03:28,609 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-28 01:03:28,609 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-28 01:03:28,609 INFO L85 PathProgramCache]: Analyzing trace with hash -1123129379, now seen corresponding path program 1 times [2021-12-28 01:03:28,609 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-28 01:03:28,609 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [944605534] [2021-12-28 01:03:28,609 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-28 01:03:28,610 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-28 01:03:28,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 01:03:28,641 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-28 01:03:28,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 01:03:28,648 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-12-28 01:03:28,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 01:03:28,672 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2021-12-28 01:03:28,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 01:03:28,691 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2021-12-28 01:03:28,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 01:03:28,696 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2021-12-28 01:03:28,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 01:03:28,700 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-28 01:03:28,700 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-28 01:03:28,700 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [944605534] [2021-12-28 01:03:28,700 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [944605534] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-28 01:03:28,700 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-28 01:03:28,701 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-12-28 01:03:28,701 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [973085245] [2021-12-28 01:03:28,701 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-28 01:03:28,702 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2021-12-28 01:03:28,702 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-28 01:03:28,702 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-12-28 01:03:28,702 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2021-12-28 01:03:28,703 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) [2021-12-28 01:03:29,282 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-28 01:03:29,282 INFO L93 Difference]: Finished difference Result 555 states and 802 transitions. [2021-12-28 01:03:29,283 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2021-12-28 01:03:29,283 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 [2021-12-28 01:03:29,283 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-28 01:03:29,285 INFO L225 Difference]: With dead ends: 555 [2021-12-28 01:03:29,285 INFO L226 Difference]: Without dead ends: 360 [2021-12-28 01:03:29,287 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=66, Invalid=174, Unknown=0, NotChecked=0, Total=240 [2021-12-28 01:03:29,287 INFO L933 BasicCegarLoop]: 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.5s IncrementalHoareTripleChecker+Time [2021-12-28 01:03:29,288 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [296 Valid, 792 Invalid, 706 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [57 Valid, 649 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2021-12-28 01:03:29,288 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 360 states. [2021-12-28 01:03:29,307 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 360 to 294. [2021-12-28 01:03:29,308 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) [2021-12-28 01:03:29,309 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 294 states to 294 states and 421 transitions. [2021-12-28 01:03:29,309 INFO L78 Accepts]: Start accepts. Automaton has 294 states and 421 transitions. Word has length 57 [2021-12-28 01:03:29,309 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-28 01:03:29,309 INFO L470 AbstractCegarLoop]: Abstraction has 294 states and 421 transitions. [2021-12-28 01:03:29,309 INFO L471 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) [2021-12-28 01:03:29,309 INFO L276 IsEmpty]: Start isEmpty. Operand 294 states and 421 transitions. [2021-12-28 01:03:29,310 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2021-12-28 01:03:29,310 INFO L506 BasicCegarLoop]: Found error trace [2021-12-28 01:03:29,311 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-28 01:03:29,311 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2021-12-28 01:03:29,311 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-28 01:03:29,311 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-28 01:03:29,311 INFO L85 PathProgramCache]: Analyzing trace with hash -229643041, now seen corresponding path program 1 times [2021-12-28 01:03:29,311 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-28 01:03:29,311 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1905909550] [2021-12-28 01:03:29,311 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-28 01:03:29,312 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-28 01:03:29,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 01:03:29,350 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-28 01:03:29,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 01:03:29,359 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-12-28 01:03:29,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 01:03:29,392 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2021-12-28 01:03:29,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 01:03:29,402 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2021-12-28 01:03:29,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 01:03:29,405 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2021-12-28 01:03:29,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 01:03:29,407 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-28 01:03:29,407 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-28 01:03:29,408 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1905909550] [2021-12-28 01:03:29,408 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1905909550] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-28 01:03:29,408 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-28 01:03:29,408 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-12-28 01:03:29,408 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1907913738] [2021-12-28 01:03:29,408 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-28 01:03:29,409 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2021-12-28 01:03:29,409 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-28 01:03:29,409 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-12-28 01:03:29,409 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2021-12-28 01:03:29,410 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) [2021-12-28 01:03:29,901 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-28 01:03:29,901 INFO L93 Difference]: Finished difference Result 906 states and 1299 transitions. [2021-12-28 01:03:29,902 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2021-12-28 01:03:29,902 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 [2021-12-28 01:03:29,902 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-28 01:03:29,905 INFO L225 Difference]: With dead ends: 906 [2021-12-28 01:03:29,905 INFO L226 Difference]: Without dead ends: 621 [2021-12-28 01:03:29,907 INFO L932 BasicCegarLoop]: 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 [2021-12-28 01:03:29,907 INFO L933 BasicCegarLoop]: 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 [2021-12-28 01:03:29,909 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [352 Valid, 774 Invalid, 709 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [65 Valid, 644 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2021-12-28 01:03:29,909 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 621 states. [2021-12-28 01:03:29,945 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 621 to 469. [2021-12-28 01:03:29,946 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) [2021-12-28 01:03:29,948 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 469 states to 469 states and 672 transitions. [2021-12-28 01:03:29,948 INFO L78 Accepts]: Start accepts. Automaton has 469 states and 672 transitions. Word has length 57 [2021-12-28 01:03:29,949 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-28 01:03:29,949 INFO L470 AbstractCegarLoop]: Abstraction has 469 states and 672 transitions. [2021-12-28 01:03:29,949 INFO L471 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) [2021-12-28 01:03:29,949 INFO L276 IsEmpty]: Start isEmpty. Operand 469 states and 672 transitions. [2021-12-28 01:03:29,950 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2021-12-28 01:03:29,950 INFO L506 BasicCegarLoop]: Found error trace [2021-12-28 01:03:29,951 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-28 01:03:29,951 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2021-12-28 01:03:29,951 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-28 01:03:29,951 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-28 01:03:29,951 INFO L85 PathProgramCache]: Analyzing trace with hash 2015936413, now seen corresponding path program 1 times [2021-12-28 01:03:29,952 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-28 01:03:29,952 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1992053580] [2021-12-28 01:03:29,952 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-28 01:03:29,952 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-28 01:03:29,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 01:03:29,968 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-28 01:03:29,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 01:03:29,975 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-12-28 01:03:29,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 01:03:29,994 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2021-12-28 01:03:29,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 01:03:30,003 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2021-12-28 01:03:30,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 01:03:30,007 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2021-12-28 01:03:30,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 01:03:30,009 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-28 01:03:30,009 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-28 01:03:30,010 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1992053580] [2021-12-28 01:03:30,010 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1992053580] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-28 01:03:30,010 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-28 01:03:30,010 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-12-28 01:03:30,010 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [867018727] [2021-12-28 01:03:30,010 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-28 01:03:30,011 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2021-12-28 01:03:30,011 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-28 01:03:30,011 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-12-28 01:03:30,012 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2021-12-28 01:03:30,012 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) [2021-12-28 01:03:30,519 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-28 01:03:30,519 INFO L93 Difference]: Finished difference Result 1458 states and 2090 transitions. [2021-12-28 01:03:30,519 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2021-12-28 01:03:30,520 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 [2021-12-28 01:03:30,520 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-28 01:03:30,526 INFO L225 Difference]: With dead ends: 1458 [2021-12-28 01:03:30,526 INFO L226 Difference]: Without dead ends: 998 [2021-12-28 01:03:30,527 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 43 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=73, Invalid=199, Unknown=0, NotChecked=0, Total=272 [2021-12-28 01:03:30,535 INFO L933 BasicCegarLoop]: 233 mSDtfsCounter, 285 mSDsluCounter, 524 mSDsCounter, 0 mSdLazyCounter, 681 mSolverCounterSat, 65 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s 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, 0.4s IncrementalHoareTripleChecker+Time [2021-12-28 01:03:30,538 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [292 Valid, 757 Invalid, 746 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [65 Valid, 681 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2021-12-28 01:03:30,539 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 998 states. [2021-12-28 01:03:30,582 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 998 to 768. [2021-12-28 01:03:30,583 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) [2021-12-28 01:03:30,587 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 768 states to 768 states and 1094 transitions. [2021-12-28 01:03:30,587 INFO L78 Accepts]: Start accepts. Automaton has 768 states and 1094 transitions. Word has length 57 [2021-12-28 01:03:30,588 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-28 01:03:30,588 INFO L470 AbstractCegarLoop]: Abstraction has 768 states and 1094 transitions. [2021-12-28 01:03:30,589 INFO L471 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) [2021-12-28 01:03:30,593 INFO L276 IsEmpty]: Start isEmpty. Operand 768 states and 1094 transitions. [2021-12-28 01:03:30,599 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2021-12-28 01:03:30,599 INFO L506 BasicCegarLoop]: Found error trace [2021-12-28 01:03:30,599 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-28 01:03:30,600 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2021-12-28 01:03:30,600 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-28 01:03:30,600 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-28 01:03:30,600 INFO L85 PathProgramCache]: Analyzing trace with hash 1118543135, now seen corresponding path program 1 times [2021-12-28 01:03:30,600 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-28 01:03:30,600 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [750475916] [2021-12-28 01:03:30,600 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-28 01:03:30,600 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-28 01:03:30,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 01:03:30,626 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-28 01:03:30,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 01:03:30,634 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-12-28 01:03:30,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 01:03:30,650 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2021-12-28 01:03:30,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 01:03:30,668 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2021-12-28 01:03:30,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 01:03:30,674 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2021-12-28 01:03:30,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 01:03:30,678 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-28 01:03:30,678 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-28 01:03:30,678 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [750475916] [2021-12-28 01:03:30,678 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [750475916] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-28 01:03:30,678 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-28 01:03:30,679 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-12-28 01:03:30,679 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1333066101] [2021-12-28 01:03:30,679 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-28 01:03:30,680 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-12-28 01:03:30,680 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-28 01:03:30,680 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-12-28 01:03:30,680 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-12-28 01:03:30,680 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) [2021-12-28 01:03:31,018 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-28 01:03:31,019 INFO L93 Difference]: Finished difference Result 2132 states and 3040 transitions. [2021-12-28 01:03:31,019 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-12-28 01:03:31,019 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 [2021-12-28 01:03:31,019 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-28 01:03:31,024 INFO L225 Difference]: With dead ends: 2132 [2021-12-28 01:03:31,024 INFO L226 Difference]: Without dead ends: 1374 [2021-12-28 01:03:31,026 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=39, Invalid=93, Unknown=0, NotChecked=0, Total=132 [2021-12-28 01:03:31,027 INFO L933 BasicCegarLoop]: 267 mSDtfsCounter, 397 mSDsluCounter, 309 mSDsCounter, 0 mSdLazyCounter, 472 mSolverCounterSat, 83 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s 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.2s IncrementalHoareTripleChecker+Time [2021-12-28 01:03:31,027 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [420 Valid, 576 Invalid, 555 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [83 Valid, 472 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2021-12-28 01:03:31,028 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1374 states. [2021-12-28 01:03:31,063 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1374 to 1169. [2021-12-28 01:03:31,064 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) [2021-12-28 01:03:31,068 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1169 states to 1169 states and 1628 transitions. [2021-12-28 01:03:31,068 INFO L78 Accepts]: Start accepts. Automaton has 1169 states and 1628 transitions. Word has length 57 [2021-12-28 01:03:31,068 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-28 01:03:31,069 INFO L470 AbstractCegarLoop]: Abstraction has 1169 states and 1628 transitions. [2021-12-28 01:03:31,069 INFO L471 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) [2021-12-28 01:03:31,069 INFO L276 IsEmpty]: Start isEmpty. Operand 1169 states and 1628 transitions. [2021-12-28 01:03:31,071 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2021-12-28 01:03:31,071 INFO L506 BasicCegarLoop]: Found error trace [2021-12-28 01:03:31,071 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-28 01:03:31,071 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2021-12-28 01:03:31,071 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-28 01:03:31,072 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-28 01:03:31,072 INFO L85 PathProgramCache]: Analyzing trace with hash -712241775, now seen corresponding path program 1 times [2021-12-28 01:03:31,072 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-28 01:03:31,072 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1713981921] [2021-12-28 01:03:31,072 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-28 01:03:31,072 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-28 01:03:31,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 01:03:31,101 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-28 01:03:31,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 01:03:31,109 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-12-28 01:03:31,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 01:03:31,119 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2021-12-28 01:03:31,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 01:03:31,160 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2021-12-28 01:03:31,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 01:03:31,170 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2021-12-28 01:03:31,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 01:03:31,174 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2021-12-28 01:03:31,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 01:03:31,178 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-12-28 01:03:31,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 01:03:31,184 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2021-12-28 01:03:31,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 01:03:31,187 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2021-12-28 01:03:31,187 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-28 01:03:31,187 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1713981921] [2021-12-28 01:03:31,187 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1713981921] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-28 01:03:31,187 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1002808416] [2021-12-28 01:03:31,187 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-28 01:03:31,187 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-28 01:03:31,188 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-28 01:03:31,192 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-28 01:03:31,224 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2021-12-28 01:03:31,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 01:03:31,265 INFO L263 TraceCheckSpWp]: Trace formula consists of 300 conjuncts, 2 conjunts are in the unsatisfiable core [2021-12-28 01:03:31,269 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-28 01:03:31,479 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2021-12-28 01:03:31,479 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-28 01:03:31,480 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1002808416] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-28 01:03:31,480 INFO L186 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2021-12-28 01:03:31,480 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [7] total 8 [2021-12-28 01:03:31,480 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [11121588] [2021-12-28 01:03:31,480 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-28 01:03:31,481 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-12-28 01:03:31,481 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-28 01:03:31,481 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-12-28 01:03:31,481 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2021-12-28 01:03:31,481 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) [2021-12-28 01:03:31,548 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-28 01:03:31,548 INFO L93 Difference]: Finished difference Result 3375 states and 4754 transitions. [2021-12-28 01:03:31,549 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-12-28 01:03:31,549 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 [2021-12-28 01:03:31,549 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-28 01:03:31,558 INFO L225 Difference]: With dead ends: 3375 [2021-12-28 01:03:31,558 INFO L226 Difference]: Without dead ends: 2217 [2021-12-28 01:03:31,560 INFO L932 BasicCegarLoop]: 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 [2021-12-28 01:03:31,561 INFO L933 BasicCegarLoop]: 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 [2021-12-28 01:03:31,562 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [114 Valid, 421 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-28 01:03:31,566 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2217 states. [2021-12-28 01:03:31,645 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2217 to 2217. [2021-12-28 01:03:31,648 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) [2021-12-28 01:03:31,658 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2217 states to 2217 states and 3080 transitions. [2021-12-28 01:03:31,659 INFO L78 Accepts]: Start accepts. Automaton has 2217 states and 3080 transitions. Word has length 92 [2021-12-28 01:03:31,661 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-28 01:03:31,661 INFO L470 AbstractCegarLoop]: Abstraction has 2217 states and 3080 transitions. [2021-12-28 01:03:31,662 INFO L471 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) [2021-12-28 01:03:31,662 INFO L276 IsEmpty]: Start isEmpty. Operand 2217 states and 3080 transitions. [2021-12-28 01:03:31,670 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2021-12-28 01:03:31,670 INFO L506 BasicCegarLoop]: Found error trace [2021-12-28 01:03:31,670 INFO L514 BasicCegarLoop]: 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] [2021-12-28 01:03:31,689 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2021-12-28 01:03:31,885 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable5 [2021-12-28 01:03:31,885 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-28 01:03:31,886 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-28 01:03:31,886 INFO L85 PathProgramCache]: Analyzing trace with hash -2098539431, now seen corresponding path program 1 times [2021-12-28 01:03:31,886 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-28 01:03:31,886 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2011800035] [2021-12-28 01:03:31,886 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-28 01:03:31,886 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-28 01:03:31,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 01:03:31,911 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-28 01:03:31,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 01:03:31,916 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-12-28 01:03:31,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 01:03:31,921 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2021-12-28 01:03:31,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 01:03:31,947 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2021-12-28 01:03:31,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 01:03:31,950 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2021-12-28 01:03:31,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 01:03:31,953 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2021-12-28 01:03:31,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 01:03:31,957 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-12-28 01:03:31,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 01:03:31,963 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2021-12-28 01:03:31,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 01:03:31,966 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-12-28 01:03:31,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 01:03:31,969 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 103 [2021-12-28 01:03:31,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 01:03:31,971 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 22 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2021-12-28 01:03:31,971 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-28 01:03:31,971 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2011800035] [2021-12-28 01:03:31,971 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2011800035] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-28 01:03:31,971 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1008038432] [2021-12-28 01:03:31,971 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-28 01:03:31,971 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-28 01:03:31,971 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-28 01:03:31,972 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-28 01:03:31,973 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2021-12-28 01:03:32,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 01:03:32,035 INFO L263 TraceCheckSpWp]: Trace formula consists of 374 conjuncts, 2 conjunts are in the unsatisfiable core [2021-12-28 01:03:32,038 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-28 01:03:32,206 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 41 proven. 0 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2021-12-28 01:03:32,206 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-28 01:03:32,206 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1008038432] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-28 01:03:32,206 INFO L186 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2021-12-28 01:03:32,206 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [7] total 8 [2021-12-28 01:03:32,206 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1853944058] [2021-12-28 01:03:32,206 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-28 01:03:32,207 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-12-28 01:03:32,207 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-28 01:03:32,207 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-12-28 01:03:32,207 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2021-12-28 01:03:32,207 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) [2021-12-28 01:03:32,327 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-28 01:03:32,328 INFO L93 Difference]: Finished difference Result 6487 states and 9053 transitions. [2021-12-28 01:03:32,328 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-12-28 01:03:32,328 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 [2021-12-28 01:03:32,328 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-28 01:03:32,343 INFO L225 Difference]: With dead ends: 6487 [2021-12-28 01:03:32,344 INFO L226 Difference]: Without dead ends: 4284 [2021-12-28 01:03:32,349 INFO L932 BasicCegarLoop]: 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 [2021-12-28 01:03:32,349 INFO L933 BasicCegarLoop]: 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 [2021-12-28 01:03:32,350 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [81 Valid, 315 Invalid, 12 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-28 01:03:32,353 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4284 states. [2021-12-28 01:03:32,495 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4284 to 4224. [2021-12-28 01:03:32,499 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) [2021-12-28 01:03:32,514 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4224 states to 4224 states and 5810 transitions. [2021-12-28 01:03:32,515 INFO L78 Accepts]: Start accepts. Automaton has 4224 states and 5810 transitions. Word has length 118 [2021-12-28 01:03:32,515 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-28 01:03:32,515 INFO L470 AbstractCegarLoop]: Abstraction has 4224 states and 5810 transitions. [2021-12-28 01:03:32,516 INFO L471 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) [2021-12-28 01:03:32,516 INFO L276 IsEmpty]: Start isEmpty. Operand 4224 states and 5810 transitions. [2021-12-28 01:03:32,523 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2021-12-28 01:03:32,523 INFO L506 BasicCegarLoop]: Found error trace [2021-12-28 01:03:32,523 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2021-12-28 01:03:32,551 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2021-12-28 01:03:32,735 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable6 [2021-12-28 01:03:32,736 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-28 01:03:32,736 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-28 01:03:32,736 INFO L85 PathProgramCache]: Analyzing trace with hash -1491695225, now seen corresponding path program 1 times [2021-12-28 01:03:32,736 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-28 01:03:32,736 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1344638990] [2021-12-28 01:03:32,736 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-28 01:03:32,736 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-28 01:03:32,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 01:03:32,765 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-28 01:03:32,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 01:03:32,771 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-12-28 01:03:32,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 01:03:32,778 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2021-12-28 01:03:32,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 01:03:32,805 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2021-12-28 01:03:32,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 01:03:32,808 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2021-12-28 01:03:32,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 01:03:32,810 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2021-12-28 01:03:32,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 01:03:32,812 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2021-12-28 01:03:32,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 01:03:32,816 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-12-28 01:03:32,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 01:03:32,821 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2021-12-28 01:03:32,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 01:03:32,826 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-12-28 01:03:32,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 01:03:32,833 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2021-12-28 01:03:32,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 01:03:32,835 INFO L134 CoverageAnalysis]: Checked inductivity of 81 backedges. 0 proven. 22 refuted. 0 times theorem prover too weak. 59 trivial. 0 not checked. [2021-12-28 01:03:32,835 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-28 01:03:32,835 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1344638990] [2021-12-28 01:03:32,835 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1344638990] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-28 01:03:32,835 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2086332333] [2021-12-28 01:03:32,835 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-28 01:03:32,835 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-28 01:03:32,835 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-28 01:03:32,836 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-28 01:03:32,837 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2021-12-28 01:03:32,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 01:03:32,903 INFO L263 TraceCheckSpWp]: Trace formula consists of 411 conjuncts, 3 conjunts are in the unsatisfiable core [2021-12-28 01:03:32,905 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-28 01:03:33,050 INFO L134 CoverageAnalysis]: Checked inductivity of 81 backedges. 47 proven. 0 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2021-12-28 01:03:33,051 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-28 01:03:33,051 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2086332333] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-28 01:03:33,051 INFO L186 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2021-12-28 01:03:33,051 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [7] total 8 [2021-12-28 01:03:33,051 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [38051567] [2021-12-28 01:03:33,051 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-28 01:03:33,052 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-12-28 01:03:33,052 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-28 01:03:33,052 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-12-28 01:03:33,053 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2021-12-28 01:03:33,053 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) [2021-12-28 01:03:33,171 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-28 01:03:33,171 INFO L93 Difference]: Finished difference Result 7498 states and 10341 transitions. [2021-12-28 01:03:33,172 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-12-28 01:03:33,172 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 [2021-12-28 01:03:33,173 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-28 01:03:33,188 INFO L225 Difference]: With dead ends: 7498 [2021-12-28 01:03:33,188 INFO L226 Difference]: Without dead ends: 4552 [2021-12-28 01:03:33,194 INFO L932 BasicCegarLoop]: 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 [2021-12-28 01:03:33,195 INFO L933 BasicCegarLoop]: 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 [2021-12-28 01:03:33,195 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [101 Valid, 314 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-28 01:03:33,198 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4552 states. [2021-12-28 01:03:33,330 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4552 to 4514. [2021-12-28 01:03:33,337 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) [2021-12-28 01:03:33,349 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4514 states to 4514 states and 6102 transitions. [2021-12-28 01:03:33,350 INFO L78 Accepts]: Start accepts. Automaton has 4514 states and 6102 transitions. Word has length 134 [2021-12-28 01:03:33,351 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-28 01:03:33,351 INFO L470 AbstractCegarLoop]: Abstraction has 4514 states and 6102 transitions. [2021-12-28 01:03:33,351 INFO L471 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) [2021-12-28 01:03:33,351 INFO L276 IsEmpty]: Start isEmpty. Operand 4514 states and 6102 transitions. [2021-12-28 01:03:33,372 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 136 [2021-12-28 01:03:33,372 INFO L506 BasicCegarLoop]: Found error trace [2021-12-28 01:03:33,373 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2021-12-28 01:03:33,401 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2021-12-28 01:03:33,589 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-28 01:03:33,590 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-28 01:03:33,590 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-28 01:03:33,591 INFO L85 PathProgramCache]: Analyzing trace with hash 1657376431, now seen corresponding path program 1 times [2021-12-28 01:03:33,591 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-28 01:03:33,591 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1962642841] [2021-12-28 01:03:33,591 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-28 01:03:33,591 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-28 01:03:33,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 01:03:33,611 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-28 01:03:33,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 01:03:33,617 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-12-28 01:03:33,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 01:03:33,622 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2021-12-28 01:03:33,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 01:03:33,654 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2021-12-28 01:03:33,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 01:03:33,657 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2021-12-28 01:03:33,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 01:03:33,659 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2021-12-28 01:03:33,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 01:03:33,661 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2021-12-28 01:03:33,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 01:03:33,665 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-12-28 01:03:33,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 01:03:33,668 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2021-12-28 01:03:33,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 01:03:33,675 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-12-28 01:03:33,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 01:03:33,678 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 120 [2021-12-28 01:03:33,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 01:03:33,681 INFO L134 CoverageAnalysis]: Checked inductivity of 83 backedges. 0 proven. 22 refuted. 0 times theorem prover too weak. 61 trivial. 0 not checked. [2021-12-28 01:03:33,681 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-28 01:03:33,681 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1962642841] [2021-12-28 01:03:33,681 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1962642841] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-28 01:03:33,681 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2046034619] [2021-12-28 01:03:33,681 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-28 01:03:33,681 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-28 01:03:33,682 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-28 01:03:33,683 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-28 01:03:33,707 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2021-12-28 01:03:33,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 01:03:33,766 INFO L263 TraceCheckSpWp]: Trace formula consists of 418 conjuncts, 3 conjunts are in the unsatisfiable core [2021-12-28 01:03:33,770 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-28 01:03:33,926 INFO L134 CoverageAnalysis]: Checked inductivity of 83 backedges. 75 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2021-12-28 01:03:33,926 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-28 01:03:33,926 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2046034619] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-28 01:03:33,926 INFO L186 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2021-12-28 01:03:33,926 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [7] total 8 [2021-12-28 01:03:33,926 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [814193180] [2021-12-28 01:03:33,926 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-28 01:03:33,927 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-12-28 01:03:33,927 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-28 01:03:33,927 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-12-28 01:03:33,927 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2021-12-28 01:03:33,927 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) [2021-12-28 01:03:34,044 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-28 01:03:34,044 INFO L93 Difference]: Finished difference Result 6910 states and 9481 transitions. [2021-12-28 01:03:34,044 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-12-28 01:03:34,045 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 [2021-12-28 01:03:34,045 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-28 01:03:34,061 INFO L225 Difference]: With dead ends: 6910 [2021-12-28 01:03:34,062 INFO L226 Difference]: Without dead ends: 4550 [2021-12-28 01:03:34,068 INFO L932 BasicCegarLoop]: 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 [2021-12-28 01:03:34,070 INFO L933 BasicCegarLoop]: 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 [2021-12-28 01:03:34,070 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [111 Valid, 400 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-28 01:03:34,074 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4550 states. [2021-12-28 01:03:34,221 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4550 to 4490. [2021-12-28 01:03:34,227 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) [2021-12-28 01:03:34,237 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4490 states to 4490 states and 5984 transitions. [2021-12-28 01:03:34,238 INFO L78 Accepts]: Start accepts. Automaton has 4490 states and 5984 transitions. Word has length 135 [2021-12-28 01:03:34,239 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-28 01:03:34,240 INFO L470 AbstractCegarLoop]: Abstraction has 4490 states and 5984 transitions. [2021-12-28 01:03:34,240 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 35.333333333333336) internal successors, (106), 3 states have internal predecessors, (106), 3 states have call successors, (12), 3 states have call predecessors, (12), 3 states have return successors, (11), 3 states have call predecessors, (11), 3 states have call successors, (11) [2021-12-28 01:03:34,240 INFO L276 IsEmpty]: Start isEmpty. Operand 4490 states and 5984 transitions. [2021-12-28 01:03:34,252 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 136 [2021-12-28 01:03:34,252 INFO L506 BasicCegarLoop]: Found error trace [2021-12-28 01:03:34,252 INFO L514 BasicCegarLoop]: 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] [2021-12-28 01:03:34,271 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2021-12-28 01:03:34,467 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-28 01:03:34,467 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-28 01:03:34,468 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-28 01:03:34,468 INFO L85 PathProgramCache]: Analyzing trace with hash -1768717425, now seen corresponding path program 1 times [2021-12-28 01:03:34,468 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-28 01:03:34,468 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1427147368] [2021-12-28 01:03:34,468 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-28 01:03:34,468 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-28 01:03:34,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 01:03:34,481 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-28 01:03:34,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 01:03:34,487 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-12-28 01:03:34,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 01:03:34,492 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2021-12-28 01:03:34,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 01:03:34,518 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2021-12-28 01:03:34,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 01:03:34,521 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2021-12-28 01:03:34,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 01:03:34,532 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2021-12-28 01:03:34,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 01:03:34,534 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2021-12-28 01:03:34,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 01:03:34,542 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-12-28 01:03:34,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 01:03:34,545 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2021-12-28 01:03:34,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 01:03:34,548 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-12-28 01:03:34,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 01:03:34,550 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 120 [2021-12-28 01:03:34,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 01:03:34,554 INFO L134 CoverageAnalysis]: Checked inductivity of 81 backedges. 0 proven. 20 refuted. 0 times theorem prover too weak. 61 trivial. 0 not checked. [2021-12-28 01:03:34,554 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-28 01:03:34,554 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1427147368] [2021-12-28 01:03:34,554 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1427147368] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-28 01:03:34,554 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [100388513] [2021-12-28 01:03:34,554 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-28 01:03:34,555 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-28 01:03:34,555 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-28 01:03:34,572 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-28 01:03:34,607 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2021-12-28 01:03:34,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 01:03:34,635 INFO L263 TraceCheckSpWp]: Trace formula consists of 424 conjuncts, 2 conjunts are in the unsatisfiable core [2021-12-28 01:03:34,639 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-28 01:03:34,769 INFO L134 CoverageAnalysis]: Checked inductivity of 81 backedges. 57 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2021-12-28 01:03:34,769 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-28 01:03:34,769 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [100388513] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-28 01:03:34,769 INFO L186 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2021-12-28 01:03:34,770 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [7] total 8 [2021-12-28 01:03:34,770 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1129942961] [2021-12-28 01:03:34,770 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-28 01:03:34,770 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-12-28 01:03:34,770 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-28 01:03:34,771 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-12-28 01:03:34,771 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2021-12-28 01:03:34,771 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) [2021-12-28 01:03:34,887 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-28 01:03:34,887 INFO L93 Difference]: Finished difference Result 7814 states and 10540 transitions. [2021-12-28 01:03:34,887 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-12-28 01:03:34,888 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 [2021-12-28 01:03:34,888 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-28 01:03:34,902 INFO L225 Difference]: With dead ends: 7814 [2021-12-28 01:03:34,902 INFO L226 Difference]: Without dead ends: 3872 [2021-12-28 01:03:34,912 INFO L932 BasicCegarLoop]: 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 [2021-12-28 01:03:34,912 INFO L933 BasicCegarLoop]: 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 [2021-12-28 01:03:34,913 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [131 Valid, 178 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-28 01:03:34,916 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3872 states. [2021-12-28 01:03:35,064 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3872 to 3642. [2021-12-28 01:03:35,069 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) [2021-12-28 01:03:35,078 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3642 states to 3642 states and 4642 transitions. [2021-12-28 01:03:35,080 INFO L78 Accepts]: Start accepts. Automaton has 3642 states and 4642 transitions. Word has length 135 [2021-12-28 01:03:35,080 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-28 01:03:35,080 INFO L470 AbstractCegarLoop]: Abstraction has 3642 states and 4642 transitions. [2021-12-28 01:03:35,080 INFO L471 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) [2021-12-28 01:03:35,080 INFO L276 IsEmpty]: Start isEmpty. Operand 3642 states and 4642 transitions. [2021-12-28 01:03:35,085 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137 [2021-12-28 01:03:35,086 INFO L506 BasicCegarLoop]: Found error trace [2021-12-28 01:03:35,086 INFO L514 BasicCegarLoop]: 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] [2021-12-28 01:03:35,106 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2021-12-28 01:03:35,294 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2021-12-28 01:03:35,294 INFO L402 AbstractCegarLoop]: === Iteration 11 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-28 01:03:35,294 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-28 01:03:35,295 INFO L85 PathProgramCache]: Analyzing trace with hash -829055518, now seen corresponding path program 1 times [2021-12-28 01:03:35,295 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-28 01:03:35,295 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [131762559] [2021-12-28 01:03:35,295 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-28 01:03:35,295 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-28 01:03:35,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 01:03:35,307 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-28 01:03:35,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 01:03:35,313 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-12-28 01:03:35,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 01:03:35,318 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2021-12-28 01:03:35,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 01:03:35,345 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2021-12-28 01:03:35,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 01:03:35,347 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2021-12-28 01:03:35,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 01:03:35,349 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2021-12-28 01:03:35,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 01:03:35,350 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2021-12-28 01:03:35,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 01:03:35,354 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-12-28 01:03:35,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 01:03:35,356 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2021-12-28 01:03:35,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 01:03:35,359 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-12-28 01:03:35,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 01:03:35,361 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 121 [2021-12-28 01:03:35,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 01:03:35,363 INFO L134 CoverageAnalysis]: Checked inductivity of 82 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 61 trivial. 0 not checked. [2021-12-28 01:03:35,363 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-28 01:03:35,363 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [131762559] [2021-12-28 01:03:35,363 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [131762559] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-28 01:03:35,363 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [134951542] [2021-12-28 01:03:35,363 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-28 01:03:35,363 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-28 01:03:35,364 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-28 01:03:35,364 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-28 01:03:35,365 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2021-12-28 01:03:35,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 01:03:35,447 INFO L263 TraceCheckSpWp]: Trace formula consists of 420 conjuncts, 6 conjunts are in the unsatisfiable core [2021-12-28 01:03:35,449 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-28 01:03:35,617 INFO L134 CoverageAnalysis]: Checked inductivity of 82 backedges. 26 proven. 0 refuted. 0 times theorem prover too weak. 56 trivial. 0 not checked. [2021-12-28 01:03:35,617 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-28 01:03:35,617 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [134951542] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-28 01:03:35,617 INFO L186 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2021-12-28 01:03:35,617 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [7] total 10 [2021-12-28 01:03:35,617 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [356975829] [2021-12-28 01:03:35,617 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-28 01:03:35,617 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-12-28 01:03:35,618 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-28 01:03:35,618 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-12-28 01:03:35,618 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2021-12-28 01:03:35,618 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) [2021-12-28 01:03:35,789 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-28 01:03:35,789 INFO L93 Difference]: Finished difference Result 5070 states and 6521 transitions. [2021-12-28 01:03:35,790 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-12-28 01:03:35,795 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 [2021-12-28 01:03:35,795 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-28 01:03:35,811 INFO L225 Difference]: With dead ends: 5070 [2021-12-28 01:03:35,811 INFO L226 Difference]: Without dead ends: 2712 [2021-12-28 01:03:35,816 INFO L932 BasicCegarLoop]: 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 [2021-12-28 01:03:35,817 INFO L933 BasicCegarLoop]: 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 [2021-12-28 01:03:35,817 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [158 Valid, 287 Invalid, 124 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [24 Valid, 100 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-28 01:03:35,819 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2712 states. [2021-12-28 01:03:35,909 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2712 to 2700. [2021-12-28 01:03:35,912 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) [2021-12-28 01:03:35,916 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2700 states to 2700 states and 3356 transitions. [2021-12-28 01:03:35,917 INFO L78 Accepts]: Start accepts. Automaton has 2700 states and 3356 transitions. Word has length 136 [2021-12-28 01:03:35,917 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-28 01:03:35,917 INFO L470 AbstractCegarLoop]: Abstraction has 2700 states and 3356 transitions. [2021-12-28 01:03:35,917 INFO L471 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) [2021-12-28 01:03:35,917 INFO L276 IsEmpty]: Start isEmpty. Operand 2700 states and 3356 transitions. [2021-12-28 01:03:35,919 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137 [2021-12-28 01:03:35,920 INFO L506 BasicCegarLoop]: Found error trace [2021-12-28 01:03:35,920 INFO L514 BasicCegarLoop]: 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] [2021-12-28 01:03:35,939 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2021-12-28 01:03:36,135 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-28 01:03:36,136 INFO L402 AbstractCegarLoop]: === Iteration 12 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-28 01:03:36,136 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-28 01:03:36,137 INFO L85 PathProgramCache]: Analyzing trace with hash 1599203104, now seen corresponding path program 1 times [2021-12-28 01:03:36,137 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-28 01:03:36,137 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1333821609] [2021-12-28 01:03:36,137 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-28 01:03:36,137 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-28 01:03:36,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 01:03:36,153 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-28 01:03:36,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 01:03:36,160 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-12-28 01:03:36,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 01:03:36,165 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2021-12-28 01:03:36,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 01:03:36,191 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2021-12-28 01:03:36,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 01:03:36,194 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2021-12-28 01:03:36,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 01:03:36,196 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2021-12-28 01:03:36,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 01:03:36,197 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2021-12-28 01:03:36,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 01:03:36,200 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-12-28 01:03:36,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 01:03:36,202 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2021-12-28 01:03:36,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 01:03:36,206 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-12-28 01:03:36,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 01:03:36,210 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 121 [2021-12-28 01:03:36,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 01:03:36,212 INFO L134 CoverageAnalysis]: Checked inductivity of 82 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 61 trivial. 0 not checked. [2021-12-28 01:03:36,212 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-28 01:03:36,212 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1333821609] [2021-12-28 01:03:36,212 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1333821609] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-28 01:03:36,212 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1282826031] [2021-12-28 01:03:36,212 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-28 01:03:36,212 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-28 01:03:36,213 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-28 01:03:36,228 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-28 01:03:36,229 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2021-12-28 01:03:36,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 01:03:36,292 INFO L263 TraceCheckSpWp]: Trace formula consists of 417 conjuncts, 6 conjunts are in the unsatisfiable core [2021-12-28 01:03:36,294 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-28 01:03:36,469 INFO L134 CoverageAnalysis]: Checked inductivity of 82 backedges. 26 proven. 0 refuted. 0 times theorem prover too weak. 56 trivial. 0 not checked. [2021-12-28 01:03:36,469 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-28 01:03:36,470 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1282826031] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-28 01:03:36,470 INFO L186 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2021-12-28 01:03:36,470 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [7] total 10 [2021-12-28 01:03:36,470 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1504529977] [2021-12-28 01:03:36,470 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-28 01:03:36,471 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-12-28 01:03:36,471 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-28 01:03:36,471 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-12-28 01:03:36,471 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2021-12-28 01:03:36,471 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) [2021-12-28 01:03:36,649 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-28 01:03:36,649 INFO L93 Difference]: Finished difference Result 5041 states and 6343 transitions. [2021-12-28 01:03:36,650 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-12-28 01:03:36,650 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 [2021-12-28 01:03:36,650 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-28 01:03:36,657 INFO L225 Difference]: With dead ends: 5041 [2021-12-28 01:03:36,657 INFO L226 Difference]: Without dead ends: 2648 [2021-12-28 01:03:36,661 INFO L932 BasicCegarLoop]: 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 [2021-12-28 01:03:36,662 INFO L933 BasicCegarLoop]: 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 [2021-12-28 01:03:36,662 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [179 Valid, 294 Invalid, 179 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [29 Valid, 150 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-28 01:03:36,664 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2648 states. [2021-12-28 01:03:36,730 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2648 to 1674. [2021-12-28 01:03:36,731 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) [2021-12-28 01:03:36,734 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1674 states to 1674 states and 2009 transitions. [2021-12-28 01:03:36,735 INFO L78 Accepts]: Start accepts. Automaton has 1674 states and 2009 transitions. Word has length 136 [2021-12-28 01:03:36,735 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-28 01:03:36,735 INFO L470 AbstractCegarLoop]: Abstraction has 1674 states and 2009 transitions. [2021-12-28 01:03:36,735 INFO L471 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) [2021-12-28 01:03:36,735 INFO L276 IsEmpty]: Start isEmpty. Operand 1674 states and 2009 transitions. [2021-12-28 01:03:36,737 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137 [2021-12-28 01:03:36,737 INFO L506 BasicCegarLoop]: Found error trace [2021-12-28 01:03:36,737 INFO L514 BasicCegarLoop]: 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] [2021-12-28 01:03:36,756 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2021-12-28 01:03:36,956 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-28 01:03:36,956 INFO L402 AbstractCegarLoop]: === Iteration 13 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-28 01:03:36,956 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-28 01:03:36,957 INFO L85 PathProgramCache]: Analyzing trace with hash 292060706, now seen corresponding path program 1 times [2021-12-28 01:03:36,957 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-28 01:03:36,957 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [378429220] [2021-12-28 01:03:36,957 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-28 01:03:36,957 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-28 01:03:36,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 01:03:36,970 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-28 01:03:36,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 01:03:36,976 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-12-28 01:03:36,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 01:03:36,981 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2021-12-28 01:03:36,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 01:03:37,016 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2021-12-28 01:03:37,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 01:03:37,020 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2021-12-28 01:03:37,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 01:03:37,022 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2021-12-28 01:03:37,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 01:03:37,024 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2021-12-28 01:03:37,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 01:03:37,029 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-12-28 01:03:37,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 01:03:37,031 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2021-12-28 01:03:37,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 01:03:37,037 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-12-28 01:03:37,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 01:03:37,041 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 121 [2021-12-28 01:03:37,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 01:03:37,044 INFO L134 CoverageAnalysis]: Checked inductivity of 82 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 61 trivial. 0 not checked. [2021-12-28 01:03:37,045 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-28 01:03:37,045 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [378429220] [2021-12-28 01:03:37,045 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [378429220] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-28 01:03:37,045 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2091169694] [2021-12-28 01:03:37,045 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-28 01:03:37,045 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-28 01:03:37,045 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-28 01:03:37,046 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-28 01:03:37,047 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2021-12-28 01:03:37,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 01:03:37,109 INFO L263 TraceCheckSpWp]: Trace formula consists of 414 conjuncts, 7 conjunts are in the unsatisfiable core [2021-12-28 01:03:37,111 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-28 01:03:37,289 INFO L134 CoverageAnalysis]: Checked inductivity of 82 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 71 trivial. 0 not checked. [2021-12-28 01:03:37,289 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-28 01:03:37,289 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2091169694] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-28 01:03:37,289 INFO L186 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2021-12-28 01:03:37,289 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [7] total 7 [2021-12-28 01:03:37,290 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [932784445] [2021-12-28 01:03:37,290 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-28 01:03:37,290 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-12-28 01:03:37,290 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-28 01:03:37,290 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-12-28 01:03:37,290 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2021-12-28 01:03:37,290 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) [2021-12-28 01:03:37,387 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-28 01:03:37,388 INFO L93 Difference]: Finished difference Result 2813 states and 3395 transitions. [2021-12-28 01:03:37,388 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-12-28 01:03:37,388 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 [2021-12-28 01:03:37,388 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-28 01:03:37,391 INFO L225 Difference]: With dead ends: 2813 [2021-12-28 01:03:37,391 INFO L226 Difference]: Without dead ends: 1149 [2021-12-28 01:03:37,394 INFO L932 BasicCegarLoop]: 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 [2021-12-28 01:03:37,395 INFO L933 BasicCegarLoop]: 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 [2021-12-28 01:03:37,395 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [48 Valid, 585 Invalid, 14 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-28 01:03:37,396 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1149 states. [2021-12-28 01:03:37,447 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1149 to 1113. [2021-12-28 01:03:37,448 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) [2021-12-28 01:03:37,450 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1113 states to 1113 states and 1296 transitions. [2021-12-28 01:03:37,450 INFO L78 Accepts]: Start accepts. Automaton has 1113 states and 1296 transitions. Word has length 136 [2021-12-28 01:03:37,450 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-28 01:03:37,450 INFO L470 AbstractCegarLoop]: Abstraction has 1113 states and 1296 transitions. [2021-12-28 01:03:37,451 INFO L471 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) [2021-12-28 01:03:37,451 INFO L276 IsEmpty]: Start isEmpty. Operand 1113 states and 1296 transitions. [2021-12-28 01:03:37,452 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137 [2021-12-28 01:03:37,452 INFO L506 BasicCegarLoop]: Found error trace [2021-12-28 01:03:37,452 INFO L514 BasicCegarLoop]: 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] [2021-12-28 01:03:37,473 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2021-12-28 01:03:37,674 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2021-12-28 01:03:37,674 INFO L402 AbstractCegarLoop]: === Iteration 14 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-28 01:03:37,674 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-28 01:03:37,675 INFO L85 PathProgramCache]: Analyzing trace with hash -1014844378, now seen corresponding path program 1 times [2021-12-28 01:03:37,675 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-28 01:03:37,675 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [832836725] [2021-12-28 01:03:37,675 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-28 01:03:37,675 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-28 01:03:37,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 01:03:37,687 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-28 01:03:37,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 01:03:37,693 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-12-28 01:03:37,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 01:03:37,697 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2021-12-28 01:03:37,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 01:03:37,722 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2021-12-28 01:03:37,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 01:03:37,724 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2021-12-28 01:03:37,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 01:03:37,725 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2021-12-28 01:03:37,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 01:03:37,727 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2021-12-28 01:03:37,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 01:03:37,730 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-12-28 01:03:37,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 01:03:37,732 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2021-12-28 01:03:37,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 01:03:37,735 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-12-28 01:03:37,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 01:03:37,737 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 121 [2021-12-28 01:03:37,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 01:03:37,739 INFO L134 CoverageAnalysis]: Checked inductivity of 82 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 72 trivial. 0 not checked. [2021-12-28 01:03:37,739 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-28 01:03:37,739 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [832836725] [2021-12-28 01:03:37,739 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [832836725] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-28 01:03:37,739 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2123251654] [2021-12-28 01:03:37,739 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-28 01:03:37,739 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-28 01:03:37,739 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-28 01:03:37,740 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-28 01:03:37,741 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2021-12-28 01:03:37,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 01:03:37,805 INFO L263 TraceCheckSpWp]: Trace formula consists of 412 conjuncts, 7 conjunts are in the unsatisfiable core [2021-12-28 01:03:37,807 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-28 01:03:37,945 INFO L134 CoverageAnalysis]: Checked inductivity of 82 backedges. 22 proven. 0 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2021-12-28 01:03:37,945 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-28 01:03:37,946 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2123251654] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-28 01:03:37,946 INFO L186 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2021-12-28 01:03:37,946 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [7] total 7 [2021-12-28 01:03:37,946 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [194268957] [2021-12-28 01:03:37,946 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-28 01:03:37,946 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-12-28 01:03:37,947 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-28 01:03:37,947 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-12-28 01:03:37,947 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2021-12-28 01:03:37,947 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) [2021-12-28 01:03:38,027 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-28 01:03:38,027 INFO L93 Difference]: Finished difference Result 2244 states and 2657 transitions. [2021-12-28 01:03:38,028 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-12-28 01:03:38,028 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 [2021-12-28 01:03:38,028 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-28 01:03:38,031 INFO L225 Difference]: With dead ends: 2244 [2021-12-28 01:03:38,031 INFO L226 Difference]: Without dead ends: 1141 [2021-12-28 01:03:38,032 INFO L932 BasicCegarLoop]: 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 [2021-12-28 01:03:38,033 INFO L933 BasicCegarLoop]: 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 [2021-12-28 01:03:38,033 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [10 Valid, 571 Invalid, 14 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-28 01:03:38,034 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1141 states. [2021-12-28 01:03:38,100 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1141 to 1125. [2021-12-28 01:03:38,101 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) [2021-12-28 01:03:38,103 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1125 states to 1125 states and 1287 transitions. [2021-12-28 01:03:38,103 INFO L78 Accepts]: Start accepts. Automaton has 1125 states and 1287 transitions. Word has length 136 [2021-12-28 01:03:38,104 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-28 01:03:38,104 INFO L470 AbstractCegarLoop]: Abstraction has 1125 states and 1287 transitions. [2021-12-28 01:03:38,104 INFO L471 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) [2021-12-28 01:03:38,104 INFO L276 IsEmpty]: Start isEmpty. Operand 1125 states and 1287 transitions. [2021-12-28 01:03:38,105 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137 [2021-12-28 01:03:38,105 INFO L506 BasicCegarLoop]: Found error trace [2021-12-28 01:03:38,106 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-28 01:03:38,141 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2021-12-28 01:03:38,319 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13 [2021-12-28 01:03:38,320 INFO L402 AbstractCegarLoop]: === Iteration 15 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-28 01:03:38,320 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-28 01:03:38,320 INFO L85 PathProgramCache]: Analyzing trace with hash 1278811050, now seen corresponding path program 1 times [2021-12-28 01:03:38,320 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-28 01:03:38,320 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1672389483] [2021-12-28 01:03:38,320 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-28 01:03:38,320 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-28 01:03:38,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 01:03:38,359 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-28 01:03:38,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 01:03:38,366 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-12-28 01:03:38,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 01:03:38,372 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2021-12-28 01:03:38,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 01:03:38,376 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2021-12-28 01:03:38,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 01:03:38,378 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2021-12-28 01:03:38,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 01:03:38,379 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2021-12-28 01:03:38,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 01:03:38,381 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2021-12-28 01:03:38,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 01:03:38,385 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-12-28 01:03:38,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 01:03:38,388 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2021-12-28 01:03:38,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 01:03:38,393 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-12-28 01:03:38,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 01:03:38,399 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 121 [2021-12-28 01:03:38,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 01:03:38,407 INFO L134 CoverageAnalysis]: Checked inductivity of 82 backedges. 19 proven. 0 refuted. 0 times theorem prover too weak. 63 trivial. 0 not checked. [2021-12-28 01:03:38,408 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-28 01:03:38,408 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1672389483] [2021-12-28 01:03:38,408 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1672389483] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-28 01:03:38,408 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-28 01:03:38,408 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-12-28 01:03:38,408 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2036011560] [2021-12-28 01:03:38,408 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-28 01:03:38,409 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-12-28 01:03:38,409 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-28 01:03:38,410 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-12-28 01:03:38,410 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-12-28 01:03:38,410 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) [2021-12-28 01:03:38,848 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-28 01:03:38,848 INFO L93 Difference]: Finished difference Result 2085 states and 2361 transitions. [2021-12-28 01:03:38,848 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2021-12-28 01:03:38,848 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 [2021-12-28 01:03:38,849 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-28 01:03:38,854 INFO L225 Difference]: With dead ends: 2085 [2021-12-28 01:03:38,854 INFO L226 Difference]: Without dead ends: 2082 [2021-12-28 01:03:38,855 INFO L932 BasicCegarLoop]: 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 [2021-12-28 01:03:38,855 INFO L933 BasicCegarLoop]: 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.3s IncrementalHoareTripleChecker+Time [2021-12-28 01:03:38,855 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [509 Valid, 514 Invalid, 432 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [91 Valid, 341 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2021-12-28 01:03:38,857 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2082 states. [2021-12-28 01:03:38,953 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2082 to 1501. [2021-12-28 01:03:38,954 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) [2021-12-28 01:03:38,956 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1501 states to 1501 states and 1715 transitions. [2021-12-28 01:03:38,956 INFO L78 Accepts]: Start accepts. Automaton has 1501 states and 1715 transitions. Word has length 136 [2021-12-28 01:03:38,957 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-28 01:03:38,957 INFO L470 AbstractCegarLoop]: Abstraction has 1501 states and 1715 transitions. [2021-12-28 01:03:38,957 INFO L471 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) [2021-12-28 01:03:38,957 INFO L276 IsEmpty]: Start isEmpty. Operand 1501 states and 1715 transitions. [2021-12-28 01:03:38,958 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 141 [2021-12-28 01:03:38,958 INFO L506 BasicCegarLoop]: Found error trace [2021-12-28 01:03:38,958 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-28 01:03:38,959 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2021-12-28 01:03:38,959 INFO L402 AbstractCegarLoop]: === Iteration 16 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-28 01:03:38,959 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-28 01:03:38,959 INFO L85 PathProgramCache]: Analyzing trace with hash -1930463342, now seen corresponding path program 1 times [2021-12-28 01:03:38,959 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-28 01:03:38,959 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [366392339] [2021-12-28 01:03:38,959 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-28 01:03:38,959 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-28 01:03:38,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 01:03:38,980 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-28 01:03:38,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 01:03:38,986 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-12-28 01:03:38,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 01:03:38,990 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2021-12-28 01:03:38,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 01:03:38,992 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2021-12-28 01:03:38,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 01:03:38,996 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2021-12-28 01:03:38,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 01:03:38,997 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2021-12-28 01:03:38,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 01:03:38,998 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2021-12-28 01:03:38,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 01:03:39,006 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-12-28 01:03:39,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 01:03:39,010 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2021-12-28 01:03:39,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 01:03:39,013 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-12-28 01:03:39,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 01:03:39,016 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 121 [2021-12-28 01:03:39,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 01:03:39,018 INFO L134 CoverageAnalysis]: Checked inductivity of 82 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 82 trivial. 0 not checked. [2021-12-28 01:03:39,019 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-28 01:03:39,019 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [366392339] [2021-12-28 01:03:39,019 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [366392339] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-28 01:03:39,019 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-28 01:03:39,019 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-12-28 01:03:39,019 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [22379978] [2021-12-28 01:03:39,019 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-28 01:03:39,019 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-12-28 01:03:39,019 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-28 01:03:39,020 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-12-28 01:03:39,020 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-12-28 01:03:39,020 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) [2021-12-28 01:03:39,239 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-28 01:03:39,239 INFO L93 Difference]: Finished difference Result 2724 states and 3203 transitions. [2021-12-28 01:03:39,240 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-12-28 01:03:39,240 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 [2021-12-28 01:03:39,240 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-28 01:03:39,245 INFO L225 Difference]: With dead ends: 2724 [2021-12-28 01:03:39,245 INFO L226 Difference]: Without dead ends: 1864 [2021-12-28 01:03:39,247 INFO L932 BasicCegarLoop]: 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 [2021-12-28 01:03:39,247 INFO L933 BasicCegarLoop]: 192 mSDtfsCounter, 142 mSDsluCounter, 275 mSDsCounter, 0 mSdLazyCounter, 204 mSolverCounterSat, 34 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 155 SdHoareTripleChecker+Valid, 467 SdHoareTripleChecker+Invalid, 238 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 34 IncrementalHoareTripleChecker+Valid, 204 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-28 01:03:39,247 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [155 Valid, 467 Invalid, 238 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [34 Valid, 204 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-28 01:03:39,249 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1864 states. [2021-12-28 01:03:39,322 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1864 to 1503. [2021-12-28 01:03:39,323 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) [2021-12-28 01:03:39,325 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1503 states to 1503 states and 1717 transitions. [2021-12-28 01:03:39,326 INFO L78 Accepts]: Start accepts. Automaton has 1503 states and 1717 transitions. Word has length 140 [2021-12-28 01:03:39,326 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-28 01:03:39,326 INFO L470 AbstractCegarLoop]: Abstraction has 1503 states and 1717 transitions. [2021-12-28 01:03:39,326 INFO L471 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) [2021-12-28 01:03:39,326 INFO L276 IsEmpty]: Start isEmpty. Operand 1503 states and 1717 transitions. [2021-12-28 01:03:39,328 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 142 [2021-12-28 01:03:39,328 INFO L506 BasicCegarLoop]: Found error trace [2021-12-28 01:03:39,328 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-28 01:03:39,328 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2021-12-28 01:03:39,328 INFO L402 AbstractCegarLoop]: === Iteration 17 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-28 01:03:39,329 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-28 01:03:39,329 INFO L85 PathProgramCache]: Analyzing trace with hash 1514412424, now seen corresponding path program 1 times [2021-12-28 01:03:39,329 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-28 01:03:39,329 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1425683206] [2021-12-28 01:03:39,329 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-28 01:03:39,329 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-28 01:03:39,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-28 01:03:39,338 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-12-28 01:03:39,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-28 01:03:39,365 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-12-28 01:03:39,365 INFO L628 BasicCegarLoop]: Counterexample is feasible [2021-12-28 01:03:39,366 INFO L764 garLoopResultBuilder]: Registering result UNSAFE for location errorErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2021-12-28 01:03:39,367 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2021-12-28 01:03:39,369 INFO L732 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-28 01:03:39,371 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2021-12-28 01:03:39,438 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 28.12 01:03:39 BoogieIcfgContainer [2021-12-28 01:03:39,438 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2021-12-28 01:03:39,439 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2021-12-28 01:03:39,439 INFO L271 PluginConnector]: Initializing Witness Printer... [2021-12-28 01:03:39,439 INFO L275 PluginConnector]: Witness Printer initialized [2021-12-28 01:03:39,439 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.12 01:03:27" (3/4) ... [2021-12-28 01:03:39,440 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2021-12-28 01:03:39,500 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2021-12-28 01:03:39,500 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2021-12-28 01:03:39,501 INFO L158 Benchmark]: Toolchain (without parser) took 12643.22ms. Allocated memory was 54.5MB in the beginning and 434.1MB in the end (delta: 379.6MB). Free memory was 33.8MB in the beginning and 155.1MB in the end (delta: -121.3MB). Peak memory consumption was 257.5MB. Max. memory is 16.1GB. [2021-12-28 01:03:39,501 INFO L158 Benchmark]: CDTParser took 0.13ms. Allocated memory is still 54.5MB. Free memory was 36.7MB in the beginning and 36.7MB in the end (delta: 81.6kB). There was no memory consumed. Max. memory is 16.1GB. [2021-12-28 01:03:39,501 INFO L158 Benchmark]: CACSL2BoogieTranslator took 292.44ms. Allocated memory is still 54.5MB. Free memory was 33.7MB in the beginning and 36.8MB in the end (delta: -3.2MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2021-12-28 01:03:39,501 INFO L158 Benchmark]: Boogie Procedure Inliner took 42.18ms. Allocated memory is still 54.5MB. Free memory was 36.8MB in the beginning and 34.7MB in the end (delta: 2.1MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2021-12-28 01:03:39,501 INFO L158 Benchmark]: Boogie Preprocessor took 33.75ms. Allocated memory is still 54.5MB. Free memory was 34.7MB in the beginning and 33.3MB in the end (delta: 1.4MB). There was no memory consumed. Max. memory is 16.1GB. [2021-12-28 01:03:39,502 INFO L158 Benchmark]: RCFGBuilder took 417.78ms. Allocated memory was 54.5MB in the beginning and 67.1MB in the end (delta: 12.6MB). Free memory was 33.1MB in the beginning and 43.0MB in the end (delta: -9.9MB). Peak memory consumption was 12.5MB. Max. memory is 16.1GB. [2021-12-28 01:03:39,502 INFO L158 Benchmark]: TraceAbstraction took 11791.01ms. Allocated memory was 67.1MB in the beginning and 434.1MB in the end (delta: 367.0MB). Free memory was 42.4MB in the beginning and 168.8MB in the end (delta: -126.4MB). Peak memory consumption was 239.7MB. Max. memory is 16.1GB. [2021-12-28 01:03:39,502 INFO L158 Benchmark]: Witness Printer took 61.74ms. Allocated memory is still 434.1MB. Free memory was 168.8MB in the beginning and 155.1MB in the end (delta: 13.7MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. [2021-12-28 01:03:39,503 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.13ms. Allocated memory is still 54.5MB. Free memory was 36.7MB in the beginning and 36.7MB in the end (delta: 81.6kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 292.44ms. Allocated memory is still 54.5MB. Free memory was 33.7MB in the beginning and 36.8MB in the end (delta: -3.2MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 42.18ms. Allocated memory is still 54.5MB. Free memory was 36.8MB in the beginning and 34.7MB in the end (delta: 2.1MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 33.75ms. Allocated memory is still 54.5MB. Free memory was 34.7MB in the beginning and 33.3MB in the end (delta: 1.4MB). There was no memory consumed. Max. memory is 16.1GB. * RCFGBuilder took 417.78ms. Allocated memory was 54.5MB in the beginning and 67.1MB in the end (delta: 12.6MB). Free memory was 33.1MB in the beginning and 43.0MB in the end (delta: -9.9MB). Peak memory consumption was 12.5MB. Max. memory is 16.1GB. * TraceAbstraction took 11791.01ms. Allocated memory was 67.1MB in the beginning and 434.1MB in the end (delta: 367.0MB). Free memory was 42.4MB in the beginning and 168.8MB in the end (delta: -126.4MB). Peak memory consumption was 239.7MB. Max. memory is 16.1GB. * Witness Printer took 61.74ms. Allocated memory is still 434.1MB. Free memory was 168.8MB in the beginning and 155.1MB in the end (delta: 13.7MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - CounterExampleResult [Line: 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: 11.7s, OverallIterations: 17, TraceHistogramMax: 3, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.1s, AutomataDifference: 4.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, PartialOrderReductionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 3274 SdHoareTripleChecker+Valid, 2.4s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 3166 mSDsluCounter, 7743 SdHoareTripleChecker+Invalid, 1.9s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 4580 mSDsCounter, 543 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 3724 IncrementalHoareTripleChecker+Invalid, 4267 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 543 mSolverCounterUnsat, 3163 mSDtfsCounter, 3724 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, 0.8s 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.4s AutomataMinimizationTime, 16 MinimizatonAttempts, 3064 StatesRemovedByMinimization, 15 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 2.8s 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! [2021-12-28 01:03:39,549 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