./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 20ed64ec 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 9a64ce668dc38bda3e5df5b168a4e471bb7128c4 ................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................. Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE --- Real Ultimate output --- This is Ultimate 0.2.1-dev-20ed64e [2021-08-26 09:06:40,596 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-08-26 09:06:40,597 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-08-26 09:06:40,632 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-08-26 09:06:40,632 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-08-26 09:06:40,633 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-08-26 09:06:40,634 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-08-26 09:06:40,635 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-08-26 09:06:40,636 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-08-26 09:06:40,637 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-08-26 09:06:40,638 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-08-26 09:06:40,638 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-08-26 09:06:40,639 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-08-26 09:06:40,639 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-08-26 09:06:40,640 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-08-26 09:06:40,641 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-08-26 09:06:40,641 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-08-26 09:06:40,642 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-08-26 09:06:40,643 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-08-26 09:06:40,644 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-08-26 09:06:40,645 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-08-26 09:06:40,648 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-08-26 09:06:40,649 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-08-26 09:06:40,649 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-08-26 09:06:40,651 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-08-26 09:06:40,651 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-08-26 09:06:40,651 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-08-26 09:06:40,652 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-08-26 09:06:40,652 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-08-26 09:06:40,653 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-08-26 09:06:40,653 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-08-26 09:06:40,654 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-08-26 09:06:40,654 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-08-26 09:06:40,654 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-08-26 09:06:40,655 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-08-26 09:06:40,655 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-08-26 09:06:40,656 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-08-26 09:06:40,656 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-08-26 09:06:40,656 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-08-26 09:06:40,657 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-08-26 09:06:40,657 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-08-26 09:06:40,658 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2021-08-26 09:06:40,673 INFO L113 SettingsManager]: Loading preferences was successful [2021-08-26 09:06:40,673 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-08-26 09:06:40,673 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2021-08-26 09:06:40,674 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2021-08-26 09:06:40,674 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-08-26 09:06:40,674 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-08-26 09:06:40,675 INFO L138 SettingsManager]: * Use SBE=true [2021-08-26 09:06:40,675 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-08-26 09:06:40,675 INFO L138 SettingsManager]: * sizeof long=4 [2021-08-26 09:06:40,675 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-08-26 09:06:40,675 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-08-26 09:06:40,675 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-08-26 09:06:40,675 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-08-26 09:06:40,675 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-08-26 09:06:40,675 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-08-26 09:06:40,676 INFO L138 SettingsManager]: * sizeof long double=12 [2021-08-26 09:06:40,676 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-08-26 09:06:40,676 INFO L138 SettingsManager]: * Use constant arrays=true [2021-08-26 09:06:40,676 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-08-26 09:06:40,676 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-08-26 09:06:40,676 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-08-26 09:06:40,676 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-08-26 09:06:40,676 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-08-26 09:06:40,676 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-08-26 09:06:40,676 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-08-26 09:06:40,677 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-08-26 09:06:40,677 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-08-26 09:06:40,677 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-08-26 09:06:40,677 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2021-08-26 09:06:40,677 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-08-26 09:06:40,677 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 -> 9a64ce668dc38bda3e5df5b168a4e471bb7128c4 [2021-08-26 09:06:40,911 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-08-26 09:06:40,924 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-08-26 09:06:40,926 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-08-26 09:06:40,926 INFO L271 PluginConnector]: Initializing CDTParser... [2021-08-26 09:06:40,927 INFO L275 PluginConnector]: CDTParser initialized [2021-08-26 09:06:40,928 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-08-26 09:06:40,965 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0f8c1841b/68b1ff2fa96040e78ca29c67bc902072/FLAG40f36ca4d [2021-08-26 09:06:41,350 INFO L306 CDTParser]: Found 1 translation units. [2021-08-26 09:06:41,350 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/systemc/token_ring.01.cil-2.c [2021-08-26 09:06:41,358 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0f8c1841b/68b1ff2fa96040e78ca29c67bc902072/FLAG40f36ca4d [2021-08-26 09:06:41,796 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0f8c1841b/68b1ff2fa96040e78ca29c67bc902072 [2021-08-26 09:06:41,797 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-08-26 09:06:41,798 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-08-26 09:06:41,799 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-08-26 09:06:41,799 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-08-26 09:06:41,807 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-08-26 09:06:41,807 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.08 09:06:41" (1/1) ... [2021-08-26 09:06:41,808 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7f0d982f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 09:06:41, skipping insertion in model container [2021-08-26 09:06:41,808 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.08 09:06:41" (1/1) ... [2021-08-26 09:06:41,811 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-08-26 09:06:41,835 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-08-26 09:06:41,907 WARN L228 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[366,379] [2021-08-26 09:06:41,937 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-08-26 09:06:41,942 INFO L203 MainTranslator]: Completed pre-run [2021-08-26 09:06:41,949 WARN L228 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[366,379] [2021-08-26 09:06:41,961 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-08-26 09:06:41,976 INFO L208 MainTranslator]: Completed translation [2021-08-26 09:06:41,977 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 09:06:41 WrapperNode [2021-08-26 09:06:41,977 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-08-26 09:06:41,977 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-08-26 09:06:41,977 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-08-26 09:06:41,978 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-08-26 09:06:41,982 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 09:06:41" (1/1) ... [2021-08-26 09:06:41,986 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 09:06:41" (1/1) ... [2021-08-26 09:06:42,019 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-08-26 09:06:42,020 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-08-26 09:06:42,020 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-08-26 09:06:42,020 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-08-26 09:06:42,030 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 09:06:41" (1/1) ... [2021-08-26 09:06:42,030 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 09:06:41" (1/1) ... [2021-08-26 09:06:42,047 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 09:06:41" (1/1) ... [2021-08-26 09:06:42,047 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 09:06:41" (1/1) ... [2021-08-26 09:06:42,051 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 09:06:41" (1/1) ... [2021-08-26 09:06:42,056 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 09:06:41" (1/1) ... [2021-08-26 09:06:42,057 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 09:06:41" (1/1) ... [2021-08-26 09:06:42,060 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-08-26 09:06:42,074 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-08-26 09:06:42,074 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-08-26 09:06:42,074 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-08-26 09:06:42,074 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 09:06:41" (1/1) ... [2021-08-26 09:06:42,081 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-08-26 09:06:42,085 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-26 09:06:42,095 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-08-26 09:06:42,106 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-08-26 09:06:42,129 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-08-26 09:06:42,130 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-08-26 09:06:42,130 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-08-26 09:06:42,130 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-08-26 09:06:42,486 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-08-26 09:06:42,486 INFO L299 CfgBuilder]: Removed 82 assume(true) statements. [2021-08-26 09:06:42,487 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.08 09:06:42 BoogieIcfgContainer [2021-08-26 09:06:42,488 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-08-26 09:06:42,489 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-08-26 09:06:42,489 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-08-26 09:06:42,491 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-08-26 09:06:42,491 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 26.08 09:06:41" (1/3) ... [2021-08-26 09:06:42,491 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@14318289 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 26.08 09:06:42, skipping insertion in model container [2021-08-26 09:06:42,492 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 09:06:41" (2/3) ... [2021-08-26 09:06:42,492 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@14318289 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 26.08 09:06:42, skipping insertion in model container [2021-08-26 09:06:42,492 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.08 09:06:42" (3/3) ... [2021-08-26 09:06:42,493 INFO L111 eAbstractionObserver]: Analyzing ICFG token_ring.01.cil-2.c [2021-08-26 09:06:42,496 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-08-26 09:06:42,496 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2021-08-26 09:06:42,534 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2021-08-26 09:06:42,545 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, mConcurrency=FINITE_AUTOMATA, 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-08-26 09:06:42,546 INFO L340 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2021-08-26 09:06:42,564 INFO L276 IsEmpty]: Start isEmpty. Operand has 148 states, 145 states have (on average 1.5931034482758621) internal successors, (231), 147 states have internal predecessors, (231), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-26 09:06:42,568 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2021-08-26 09:06:42,568 INFO L504 BasicCegarLoop]: Found error trace [2021-08-26 09:06:42,569 INFO L512 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] [2021-08-26 09:06:42,569 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2021-08-26 09:06:42,572 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-26 09:06:42,573 INFO L82 PathProgramCache]: Analyzing trace with hash 754195226, now seen corresponding path program 1 times [2021-08-26 09:06:42,578 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-26 09:06:42,578 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1042203506] [2021-08-26 09:06:42,579 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-26 09:06:42,579 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-26 09:06:42,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-26 09:06:42,684 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-26 09:06:42,685 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-26 09:06:42,685 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1042203506] [2021-08-26 09:06:42,686 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1042203506] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-26 09:06:42,686 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-26 09:06:42,686 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-08-26 09:06:42,687 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1961492515] [2021-08-26 09:06:42,690 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-08-26 09:06:42,690 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-26 09:06:42,697 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-08-26 09:06:42,697 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-08-26 09:06:42,699 INFO L87 Difference]: Start difference. First operand has 148 states, 145 states have (on average 1.5931034482758621) internal successors, (231), 147 states have internal predecessors, (231), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 3 states, 3 states have (on average 13.0) internal successors, (39), 3 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-26 09:06:42,732 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-26 09:06:42,732 INFO L93 Difference]: Finished difference Result 291 states and 455 transitions. [2021-08-26 09:06:42,732 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-08-26 09:06:42,733 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 13.0) internal successors, (39), 3 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 39 [2021-08-26 09:06:42,733 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-26 09:06:42,739 INFO L225 Difference]: With dead ends: 291 [2021-08-26 09:06:42,739 INFO L226 Difference]: Without dead ends: 144 [2021-08-26 09:06:42,741 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.3ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-08-26 09:06:42,750 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 144 states. [2021-08-26 09:06:42,765 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 144 to 144. [2021-08-26 09:06:42,766 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 144 states, 142 states have (on average 1.5211267605633803) internal successors, (216), 143 states have internal predecessors, (216), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-26 09:06:42,768 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 144 states to 144 states and 216 transitions. [2021-08-26 09:06:42,769 INFO L78 Accepts]: Start accepts. Automaton has 144 states and 216 transitions. Word has length 39 [2021-08-26 09:06:42,769 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-26 09:06:42,769 INFO L470 AbstractCegarLoop]: Abstraction has 144 states and 216 transitions. [2021-08-26 09:06:42,769 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 13.0) internal successors, (39), 3 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-26 09:06:42,770 INFO L276 IsEmpty]: Start isEmpty. Operand 144 states and 216 transitions. [2021-08-26 09:06:42,770 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2021-08-26 09:06:42,770 INFO L504 BasicCegarLoop]: Found error trace [2021-08-26 09:06:42,771 INFO L512 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] [2021-08-26 09:06:42,771 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-08-26 09:06:42,771 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2021-08-26 09:06:42,772 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-26 09:06:42,772 INFO L82 PathProgramCache]: Analyzing trace with hash 1598200728, now seen corresponding path program 1 times [2021-08-26 09:06:42,772 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-26 09:06:42,772 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1565854659] [2021-08-26 09:06:42,772 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-26 09:06:42,773 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-26 09:06:42,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-26 09:06:42,802 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-26 09:06:42,802 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-26 09:06:42,803 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1565854659] [2021-08-26 09:06:42,803 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1565854659] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-26 09:06:42,803 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-26 09:06:42,803 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-08-26 09:06:42,803 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [928726013] [2021-08-26 09:06:42,804 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-08-26 09:06:42,804 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-26 09:06:42,805 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-08-26 09:06:42,805 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-08-26 09:06:42,805 INFO L87 Difference]: Start difference. First operand 144 states and 216 transitions. Second operand has 3 states, 3 states have (on average 13.0) internal successors, (39), 2 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-26 09:06:42,840 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-26 09:06:42,841 INFO L93 Difference]: Finished difference Result 384 states and 576 transitions. [2021-08-26 09:06:42,841 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-08-26 09:06:42,841 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 13.0) internal successors, (39), 2 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 39 [2021-08-26 09:06:42,841 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-26 09:06:42,843 INFO L225 Difference]: With dead ends: 384 [2021-08-26 09:06:42,843 INFO L226 Difference]: Without dead ends: 246 [2021-08-26 09:06:42,844 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.0ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-08-26 09:06:42,844 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 246 states. [2021-08-26 09:06:42,869 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 246 to 242. [2021-08-26 09:06:42,869 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 242 states, 240 states have (on average 1.5083333333333333) internal successors, (362), 241 states have internal predecessors, (362), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-26 09:06:42,871 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 242 states to 242 states and 362 transitions. [2021-08-26 09:06:42,871 INFO L78 Accepts]: Start accepts. Automaton has 242 states and 362 transitions. Word has length 39 [2021-08-26 09:06:42,871 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-26 09:06:42,871 INFO L470 AbstractCegarLoop]: Abstraction has 242 states and 362 transitions. [2021-08-26 09:06:42,871 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 13.0) internal successors, (39), 2 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-26 09:06:42,872 INFO L276 IsEmpty]: Start isEmpty. Operand 242 states and 362 transitions. [2021-08-26 09:06:42,872 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2021-08-26 09:06:42,872 INFO L504 BasicCegarLoop]: Found error trace [2021-08-26 09:06:42,872 INFO L512 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] [2021-08-26 09:06:42,873 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2021-08-26 09:06:42,873 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2021-08-26 09:06:42,873 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-26 09:06:42,873 INFO L82 PathProgramCache]: Analyzing trace with hash 1655040020, now seen corresponding path program 1 times [2021-08-26 09:06:42,874 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-26 09:06:42,874 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [644563869] [2021-08-26 09:06:42,874 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-26 09:06:42,874 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-26 09:06:42,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-26 09:06:42,899 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-26 09:06:42,900 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-26 09:06:42,900 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [644563869] [2021-08-26 09:06:42,900 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [644563869] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-26 09:06:42,900 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-26 09:06:42,901 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-08-26 09:06:42,901 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1864145426] [2021-08-26 09:06:42,901 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-08-26 09:06:42,901 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-26 09:06:42,902 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-08-26 09:06:42,902 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-08-26 09:06:42,902 INFO L87 Difference]: Start difference. First operand 242 states and 362 transitions. Second operand has 3 states, 3 states have (on average 13.0) internal successors, (39), 2 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-26 09:06:42,932 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-26 09:06:42,932 INFO L93 Difference]: Finished difference Result 477 states and 715 transitions. [2021-08-26 09:06:42,932 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-08-26 09:06:42,933 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 13.0) internal successors, (39), 2 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 39 [2021-08-26 09:06:42,933 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-26 09:06:42,934 INFO L225 Difference]: With dead ends: 477 [2021-08-26 09:06:42,934 INFO L226 Difference]: Without dead ends: 242 [2021-08-26 09:06:42,935 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.7ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-08-26 09:06:42,935 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 242 states. [2021-08-26 09:06:42,945 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 242 to 242. [2021-08-26 09:06:42,946 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 242 states, 240 states have (on average 1.475) internal successors, (354), 241 states have internal predecessors, (354), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-26 09:06:42,960 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 242 states to 242 states and 354 transitions. [2021-08-26 09:06:42,960 INFO L78 Accepts]: Start accepts. Automaton has 242 states and 354 transitions. Word has length 39 [2021-08-26 09:06:42,961 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-26 09:06:42,961 INFO L470 AbstractCegarLoop]: Abstraction has 242 states and 354 transitions. [2021-08-26 09:06:42,961 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 13.0) internal successors, (39), 2 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-26 09:06:42,961 INFO L276 IsEmpty]: Start isEmpty. Operand 242 states and 354 transitions. [2021-08-26 09:06:42,962 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2021-08-26 09:06:42,962 INFO L504 BasicCegarLoop]: Found error trace [2021-08-26 09:06:42,962 INFO L512 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] [2021-08-26 09:06:42,962 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2021-08-26 09:06:42,962 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2021-08-26 09:06:42,963 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-26 09:06:42,963 INFO L82 PathProgramCache]: Analyzing trace with hash -5694440, now seen corresponding path program 1 times [2021-08-26 09:06:42,963 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-26 09:06:42,963 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1977250958] [2021-08-26 09:06:42,964 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-26 09:06:42,964 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-26 09:06:42,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-26 09:06:42,992 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-26 09:06:42,993 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-26 09:06:42,993 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1977250958] [2021-08-26 09:06:42,993 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1977250958] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-26 09:06:42,993 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-26 09:06:42,993 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-08-26 09:06:42,994 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2052254725] [2021-08-26 09:06:42,994 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-08-26 09:06:42,994 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-26 09:06:42,995 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-08-26 09:06:42,995 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-08-26 09:06:42,995 INFO L87 Difference]: Start difference. First operand 242 states and 354 transitions. Second operand has 3 states, 3 states have (on average 13.0) internal successors, (39), 2 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-26 09:06:43,021 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-26 09:06:43,022 INFO L93 Difference]: Finished difference Result 476 states and 698 transitions. [2021-08-26 09:06:43,022 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-08-26 09:06:43,022 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 13.0) internal successors, (39), 2 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 39 [2021-08-26 09:06:43,022 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-26 09:06:43,023 INFO L225 Difference]: With dead ends: 476 [2021-08-26 09:06:43,023 INFO L226 Difference]: Without dead ends: 242 [2021-08-26 09:06:43,024 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.7ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-08-26 09:06:43,025 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 242 states. [2021-08-26 09:06:43,033 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 242 to 242. [2021-08-26 09:06:43,034 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 242 states, 240 states have (on average 1.4166666666666667) internal successors, (340), 241 states have internal predecessors, (340), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-26 09:06:43,034 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 242 states to 242 states and 340 transitions. [2021-08-26 09:06:43,035 INFO L78 Accepts]: Start accepts. Automaton has 242 states and 340 transitions. Word has length 39 [2021-08-26 09:06:43,035 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-26 09:06:43,035 INFO L470 AbstractCegarLoop]: Abstraction has 242 states and 340 transitions. [2021-08-26 09:06:43,035 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 13.0) internal successors, (39), 2 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-26 09:06:43,035 INFO L276 IsEmpty]: Start isEmpty. Operand 242 states and 340 transitions. [2021-08-26 09:06:43,036 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2021-08-26 09:06:43,036 INFO L504 BasicCegarLoop]: Found error trace [2021-08-26 09:06:43,036 INFO L512 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] [2021-08-26 09:06:43,036 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2021-08-26 09:06:43,036 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2021-08-26 09:06:43,037 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-26 09:06:43,037 INFO L82 PathProgramCache]: Analyzing trace with hash -752003180, now seen corresponding path program 1 times [2021-08-26 09:06:43,037 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-26 09:06:43,037 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1928939370] [2021-08-26 09:06:43,038 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-26 09:06:43,038 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-26 09:06:43,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-26 09:06:43,066 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-26 09:06:43,067 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-26 09:06:43,067 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1928939370] [2021-08-26 09:06:43,067 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1928939370] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-26 09:06:43,067 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-26 09:06:43,067 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-08-26 09:06:43,068 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1406101356] [2021-08-26 09:06:43,068 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-08-26 09:06:43,068 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-26 09:06:43,069 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-08-26 09:06:43,069 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-08-26 09:06:43,069 INFO L87 Difference]: Start difference. First operand 242 states and 340 transitions. Second operand has 4 states, 4 states have (on average 9.75) internal successors, (39), 3 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-26 09:06:43,133 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-26 09:06:43,133 INFO L93 Difference]: Finished difference Result 634 states and 896 transitions. [2021-08-26 09:06:43,134 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-08-26 09:06:43,134 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 9.75) internal successors, (39), 3 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 39 [2021-08-26 09:06:43,134 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-26 09:06:43,135 INFO L225 Difference]: With dead ends: 634 [2021-08-26 09:06:43,135 INFO L226 Difference]: Without dead ends: 401 [2021-08-26 09:06:43,136 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 7.7ms TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-08-26 09:06:43,137 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 401 states. [2021-08-26 09:06:43,149 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 401 to 242. [2021-08-26 09:06:43,149 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 242 states, 240 states have (on average 1.4041666666666666) internal successors, (337), 241 states have internal predecessors, (337), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-26 09:06:43,150 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 242 states to 242 states and 337 transitions. [2021-08-26 09:06:43,150 INFO L78 Accepts]: Start accepts. Automaton has 242 states and 337 transitions. Word has length 39 [2021-08-26 09:06:43,150 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-26 09:06:43,150 INFO L470 AbstractCegarLoop]: Abstraction has 242 states and 337 transitions. [2021-08-26 09:06:43,151 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 9.75) internal successors, (39), 3 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-26 09:06:43,151 INFO L276 IsEmpty]: Start isEmpty. Operand 242 states and 337 transitions. [2021-08-26 09:06:43,151 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2021-08-26 09:06:43,151 INFO L504 BasicCegarLoop]: Found error trace [2021-08-26 09:06:43,152 INFO L512 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] [2021-08-26 09:06:43,152 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2021-08-26 09:06:43,152 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2021-08-26 09:06:43,152 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-26 09:06:43,152 INFO L82 PathProgramCache]: Analyzing trace with hash -50403306, now seen corresponding path program 1 times [2021-08-26 09:06:43,153 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-26 09:06:43,153 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1112560266] [2021-08-26 09:06:43,153 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-26 09:06:43,153 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-26 09:06:43,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-26 09:06:43,181 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-26 09:06:43,181 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-26 09:06:43,181 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1112560266] [2021-08-26 09:06:43,181 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1112560266] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-26 09:06:43,182 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-26 09:06:43,182 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-08-26 09:06:43,182 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1414946327] [2021-08-26 09:06:43,182 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-08-26 09:06:43,182 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-26 09:06:43,183 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-08-26 09:06:43,183 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-08-26 09:06:43,183 INFO L87 Difference]: Start difference. First operand 242 states and 337 transitions. Second operand has 4 states, 4 states have (on average 9.75) internal successors, (39), 3 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-26 09:06:43,260 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-26 09:06:43,260 INFO L93 Difference]: Finished difference Result 820 states and 1141 transitions. [2021-08-26 09:06:43,261 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-08-26 09:06:43,261 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 9.75) internal successors, (39), 3 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 39 [2021-08-26 09:06:43,261 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-26 09:06:43,262 INFO L225 Difference]: With dead ends: 820 [2021-08-26 09:06:43,263 INFO L226 Difference]: Without dead ends: 589 [2021-08-26 09:06:43,263 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 7.0ms TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-08-26 09:06:43,264 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 589 states. [2021-08-26 09:06:43,278 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 589 to 541. [2021-08-26 09:06:43,279 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 541 states, 539 states have (on average 1.37291280148423) internal successors, (740), 540 states have internal predecessors, (740), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-26 09:06:43,280 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 541 states to 541 states and 740 transitions. [2021-08-26 09:06:43,280 INFO L78 Accepts]: Start accepts. Automaton has 541 states and 740 transitions. Word has length 39 [2021-08-26 09:06:43,281 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-26 09:06:43,281 INFO L470 AbstractCegarLoop]: Abstraction has 541 states and 740 transitions. [2021-08-26 09:06:43,281 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 9.75) internal successors, (39), 3 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-26 09:06:43,281 INFO L276 IsEmpty]: Start isEmpty. Operand 541 states and 740 transitions. [2021-08-26 09:06:43,282 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2021-08-26 09:06:43,282 INFO L504 BasicCegarLoop]: Found error trace [2021-08-26 09:06:43,282 INFO L512 BasicCegarLoop]: trace histogram [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] [2021-08-26 09:06:43,282 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2021-08-26 09:06:43,282 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2021-08-26 09:06:43,283 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-26 09:06:43,283 INFO L82 PathProgramCache]: Analyzing trace with hash 1134866542, now seen corresponding path program 1 times [2021-08-26 09:06:43,283 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-26 09:06:43,283 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1163957606] [2021-08-26 09:06:43,283 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-26 09:06:43,284 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-26 09:06:43,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-26 09:06:43,339 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2021-08-26 09:06:43,340 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-26 09:06:43,340 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1163957606] [2021-08-26 09:06:43,340 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1163957606] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-26 09:06:43,340 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-26 09:06:43,340 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-08-26 09:06:43,340 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1994627849] [2021-08-26 09:06:43,341 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-08-26 09:06:43,341 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-26 09:06:43,341 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-08-26 09:06:43,348 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-08-26 09:06:43,348 INFO L87 Difference]: Start difference. First operand 541 states and 740 transitions. Second operand has 5 states, 5 states have (on average 9.0) internal successors, (45), 5 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-26 09:06:43,451 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-26 09:06:43,451 INFO L93 Difference]: Finished difference Result 1379 states and 1899 transitions. [2021-08-26 09:06:43,452 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-08-26 09:06:43,452 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 9.0) internal successors, (45), 5 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 51 [2021-08-26 09:06:43,452 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-26 09:06:43,455 INFO L225 Difference]: With dead ends: 1379 [2021-08-26 09:06:43,455 INFO L226 Difference]: Without dead ends: 859 [2021-08-26 09:06:43,456 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 16.4ms TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2021-08-26 09:06:43,456 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 859 states. [2021-08-26 09:06:43,479 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 859 to 562. [2021-08-26 09:06:43,479 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 562 states, 560 states have (on average 1.3428571428571427) internal successors, (752), 561 states have internal predecessors, (752), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-26 09:06:43,481 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 562 states to 562 states and 752 transitions. [2021-08-26 09:06:43,481 INFO L78 Accepts]: Start accepts. Automaton has 562 states and 752 transitions. Word has length 51 [2021-08-26 09:06:43,481 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-26 09:06:43,481 INFO L470 AbstractCegarLoop]: Abstraction has 562 states and 752 transitions. [2021-08-26 09:06:43,482 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 9.0) internal successors, (45), 5 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-26 09:06:43,482 INFO L276 IsEmpty]: Start isEmpty. Operand 562 states and 752 transitions. [2021-08-26 09:06:43,484 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2021-08-26 09:06:43,484 INFO L504 BasicCegarLoop]: Found error trace [2021-08-26 09:06:43,484 INFO L512 BasicCegarLoop]: trace histogram [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] [2021-08-26 09:06:43,484 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2021-08-26 09:06:43,484 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2021-08-26 09:06:43,485 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-26 09:06:43,485 INFO L82 PathProgramCache]: Analyzing trace with hash 1836466416, now seen corresponding path program 1 times [2021-08-26 09:06:43,485 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-26 09:06:43,485 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [368482014] [2021-08-26 09:06:43,486 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-26 09:06:43,486 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-26 09:06:43,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-26 09:06:43,546 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-26 09:06:43,548 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-26 09:06:43,548 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [368482014] [2021-08-26 09:06:43,548 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [368482014] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-26 09:06:43,548 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-26 09:06:43,548 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-08-26 09:06:43,549 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1031413262] [2021-08-26 09:06:43,550 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-08-26 09:06:43,550 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-26 09:06:43,550 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-08-26 09:06:43,551 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-08-26 09:06:43,551 INFO L87 Difference]: Start difference. First operand 562 states and 752 transitions. Second operand has 3 states, 3 states have (on average 17.0) internal successors, (51), 3 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-26 09:06:43,617 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-26 09:06:43,617 INFO L93 Difference]: Finished difference Result 1555 states and 2057 transitions. [2021-08-26 09:06:43,618 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-08-26 09:06:43,618 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 17.0) internal successors, (51), 3 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 51 [2021-08-26 09:06:43,619 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-26 09:06:43,621 INFO L225 Difference]: With dead ends: 1555 [2021-08-26 09:06:43,621 INFO L226 Difference]: Without dead ends: 1018 [2021-08-26 09:06:43,622 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.6ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-08-26 09:06:43,623 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1018 states. [2021-08-26 09:06:43,654 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1018 to 982. [2021-08-26 09:06:43,655 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 982 states, 980 states have (on average 1.292857142857143) internal successors, (1267), 981 states have internal predecessors, (1267), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-26 09:06:43,657 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 982 states to 982 states and 1267 transitions. [2021-08-26 09:06:43,657 INFO L78 Accepts]: Start accepts. Automaton has 982 states and 1267 transitions. Word has length 51 [2021-08-26 09:06:43,657 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-26 09:06:43,657 INFO L470 AbstractCegarLoop]: Abstraction has 982 states and 1267 transitions. [2021-08-26 09:06:43,657 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 17.0) internal successors, (51), 3 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-26 09:06:43,657 INFO L276 IsEmpty]: Start isEmpty. Operand 982 states and 1267 transitions. [2021-08-26 09:06:43,658 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2021-08-26 09:06:43,658 INFO L504 BasicCegarLoop]: Found error trace [2021-08-26 09:06:43,659 INFO L512 BasicCegarLoop]: trace histogram [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] [2021-08-26 09:06:43,659 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2021-08-26 09:06:43,659 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2021-08-26 09:06:43,659 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-26 09:06:43,659 INFO L82 PathProgramCache]: Analyzing trace with hash 1282971825, now seen corresponding path program 1 times [2021-08-26 09:06:43,659 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-26 09:06:43,660 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [416898687] [2021-08-26 09:06:43,660 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-26 09:06:43,660 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-26 09:06:43,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-26 09:06:43,712 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2021-08-26 09:06:43,712 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-26 09:06:43,712 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [416898687] [2021-08-26 09:06:43,712 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [416898687] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-26 09:06:43,712 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-26 09:06:43,713 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-08-26 09:06:43,713 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1125811915] [2021-08-26 09:06:43,714 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-08-26 09:06:43,714 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-26 09:06:43,714 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-08-26 09:06:43,714 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-08-26 09:06:43,715 INFO L87 Difference]: Start difference. First operand 982 states and 1267 transitions. Second operand has 3 states, 3 states have (on average 15.0) internal successors, (45), 2 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-26 09:06:43,801 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-26 09:06:43,802 INFO L93 Difference]: Finished difference Result 2328 states and 3027 transitions. [2021-08-26 09:06:43,803 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-08-26 09:06:43,805 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 15.0) internal successors, (45), 2 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 52 [2021-08-26 09:06:43,806 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-26 09:06:43,810 INFO L225 Difference]: With dead ends: 2328 [2021-08-26 09:06:43,810 INFO L226 Difference]: Without dead ends: 1624 [2021-08-26 09:06:43,813 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.5ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-08-26 09:06:43,814 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1624 states. [2021-08-26 09:06:43,858 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1624 to 1334. [2021-08-26 09:06:43,860 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1334 states, 1332 states have (on average 1.2905405405405406) internal successors, (1719), 1333 states have internal predecessors, (1719), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-26 09:06:43,864 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1334 states to 1334 states and 1719 transitions. [2021-08-26 09:06:43,864 INFO L78 Accepts]: Start accepts. Automaton has 1334 states and 1719 transitions. Word has length 52 [2021-08-26 09:06:43,864 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-26 09:06:43,864 INFO L470 AbstractCegarLoop]: Abstraction has 1334 states and 1719 transitions. [2021-08-26 09:06:43,864 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 15.0) internal successors, (45), 2 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-26 09:06:43,865 INFO L276 IsEmpty]: Start isEmpty. Operand 1334 states and 1719 transitions. [2021-08-26 09:06:43,865 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2021-08-26 09:06:43,865 INFO L504 BasicCegarLoop]: Found error trace [2021-08-26 09:06:43,865 INFO L512 BasicCegarLoop]: trace histogram [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] [2021-08-26 09:06:43,866 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2021-08-26 09:06:43,866 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2021-08-26 09:06:43,866 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-26 09:06:43,866 INFO L82 PathProgramCache]: Analyzing trace with hash -778511866, now seen corresponding path program 1 times [2021-08-26 09:06:43,866 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-26 09:06:43,867 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1310017058] [2021-08-26 09:06:43,867 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-26 09:06:43,867 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-26 09:06:43,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-26 09:06:43,895 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-26 09:06:43,896 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-26 09:06:43,896 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1310017058] [2021-08-26 09:06:43,896 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1310017058] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-26 09:06:43,896 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-26 09:06:43,896 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-08-26 09:06:43,896 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2121154552] [2021-08-26 09:06:43,897 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-08-26 09:06:43,897 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-26 09:06:43,897 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-08-26 09:06:43,897 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-08-26 09:06:43,898 INFO L87 Difference]: Start difference. First operand 1334 states and 1719 transitions. Second operand has 5 states, 5 states have (on average 12.6) internal successors, (63), 5 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-26 09:06:44,019 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-26 09:06:44,019 INFO L93 Difference]: Finished difference Result 2606 states and 3374 transitions. [2021-08-26 09:06:44,020 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-08-26 09:06:44,020 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 12.6) internal successors, (63), 5 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 63 [2021-08-26 09:06:44,020 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-26 09:06:44,024 INFO L225 Difference]: With dead ends: 2606 [2021-08-26 09:06:44,024 INFO L226 Difference]: Without dead ends: 1600 [2021-08-26 09:06:44,026 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 14.4ms TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2021-08-26 09:06:44,027 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1600 states. [2021-08-26 09:06:44,104 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1600 to 1346. [2021-08-26 09:06:44,106 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1346 states, 1344 states have (on average 1.2626488095238095) internal successors, (1697), 1345 states have internal predecessors, (1697), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-26 09:06:44,108 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1346 states to 1346 states and 1697 transitions. [2021-08-26 09:06:44,108 INFO L78 Accepts]: Start accepts. Automaton has 1346 states and 1697 transitions. Word has length 63 [2021-08-26 09:06:44,109 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-26 09:06:44,109 INFO L470 AbstractCegarLoop]: Abstraction has 1346 states and 1697 transitions. [2021-08-26 09:06:44,109 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 12.6) internal successors, (63), 5 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-26 09:06:44,109 INFO L276 IsEmpty]: Start isEmpty. Operand 1346 states and 1697 transitions. [2021-08-26 09:06:44,110 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2021-08-26 09:06:44,110 INFO L504 BasicCegarLoop]: Found error trace [2021-08-26 09:06:44,110 INFO L512 BasicCegarLoop]: trace histogram [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] [2021-08-26 09:06:44,110 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2021-08-26 09:06:44,110 INFO L402 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2021-08-26 09:06:44,111 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-26 09:06:44,111 INFO L82 PathProgramCache]: Analyzing trace with hash -355810040, now seen corresponding path program 1 times [2021-08-26 09:06:44,111 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-26 09:06:44,112 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1928635705] [2021-08-26 09:06:44,113 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-26 09:06:44,113 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-26 09:06:44,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-26 09:06:44,157 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-26 09:06:44,157 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-26 09:06:44,157 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1928635705] [2021-08-26 09:06:44,157 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1928635705] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-26 09:06:44,158 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-26 09:06:44,158 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-08-26 09:06:44,158 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2027658983] [2021-08-26 09:06:44,158 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-08-26 09:06:44,159 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-26 09:06:44,160 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-08-26 09:06:44,160 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-08-26 09:06:44,160 INFO L87 Difference]: Start difference. First operand 1346 states and 1697 transitions. Second operand has 3 states, 3 states have (on average 21.0) internal successors, (63), 3 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-26 09:06:44,281 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-26 09:06:44,281 INFO L93 Difference]: Finished difference Result 3754 states and 4725 transitions. [2021-08-26 09:06:44,282 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-08-26 09:06:44,282 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 21.0) internal successors, (63), 3 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 63 [2021-08-26 09:06:44,283 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-26 09:06:44,289 INFO L225 Difference]: With dead ends: 3754 [2021-08-26 09:06:44,289 INFO L226 Difference]: Without dead ends: 2454 [2021-08-26 09:06:44,291 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.6ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-08-26 09:06:44,292 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2454 states. [2021-08-26 09:06:44,371 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2454 to 2426. [2021-08-26 09:06:44,374 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2426 states, 2424 states have (on average 1.2421617161716172) internal successors, (3011), 2425 states have internal predecessors, (3011), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-26 09:06:44,378 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2426 states to 2426 states and 3011 transitions. [2021-08-26 09:06:44,378 INFO L78 Accepts]: Start accepts. Automaton has 2426 states and 3011 transitions. Word has length 63 [2021-08-26 09:06:44,379 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-26 09:06:44,379 INFO L470 AbstractCegarLoop]: Abstraction has 2426 states and 3011 transitions. [2021-08-26 09:06:44,379 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 21.0) internal successors, (63), 3 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-26 09:06:44,379 INFO L276 IsEmpty]: Start isEmpty. Operand 2426 states and 3011 transitions. [2021-08-26 09:06:44,380 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2021-08-26 09:06:44,380 INFO L504 BasicCegarLoop]: Found error trace [2021-08-26 09:06:44,380 INFO L512 BasicCegarLoop]: trace histogram [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] [2021-08-26 09:06:44,380 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2021-08-26 09:06:44,380 INFO L402 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2021-08-26 09:06:44,381 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-26 09:06:44,381 INFO L82 PathProgramCache]: Analyzing trace with hash 801765960, now seen corresponding path program 1 times [2021-08-26 09:06:44,381 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-26 09:06:44,381 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [878293558] [2021-08-26 09:06:44,381 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-26 09:06:44,381 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-26 09:06:44,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-26 09:06:44,417 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-26 09:06:44,418 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-26 09:06:44,418 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [878293558] [2021-08-26 09:06:44,418 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [878293558] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-26 09:06:44,418 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-26 09:06:44,418 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-08-26 09:06:44,419 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [599445190] [2021-08-26 09:06:44,419 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-08-26 09:06:44,419 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-26 09:06:44,419 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-08-26 09:06:44,419 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-08-26 09:06:44,420 INFO L87 Difference]: Start difference. First operand 2426 states and 3011 transitions. Second operand has 4 states, 4 states have (on average 16.0) internal successors, (64), 4 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-26 09:06:44,525 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-26 09:06:44,525 INFO L93 Difference]: Finished difference Result 4272 states and 5305 transitions. [2021-08-26 09:06:44,525 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-08-26 09:06:44,526 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 16.0) internal successors, (64), 4 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 64 [2021-08-26 09:06:44,526 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-26 09:06:44,531 INFO L225 Difference]: With dead ends: 4272 [2021-08-26 09:06:44,531 INFO L226 Difference]: Without dead ends: 1871 [2021-08-26 09:06:44,533 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 7.0ms TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-08-26 09:06:44,535 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1871 states. [2021-08-26 09:06:44,601 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1871 to 1871. [2021-08-26 09:06:44,603 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1871 states, 1869 states have (on average 1.2241840556447299) internal successors, (2288), 1870 states have internal predecessors, (2288), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-26 09:06:44,607 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1871 states to 1871 states and 2288 transitions. [2021-08-26 09:06:44,607 INFO L78 Accepts]: Start accepts. Automaton has 1871 states and 2288 transitions. Word has length 64 [2021-08-26 09:06:44,608 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-26 09:06:44,608 INFO L470 AbstractCegarLoop]: Abstraction has 1871 states and 2288 transitions. [2021-08-26 09:06:44,608 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 16.0) internal successors, (64), 4 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-26 09:06:44,608 INFO L276 IsEmpty]: Start isEmpty. Operand 1871 states and 2288 transitions. [2021-08-26 09:06:44,609 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2021-08-26 09:06:44,609 INFO L504 BasicCegarLoop]: Found error trace [2021-08-26 09:06:44,609 INFO L512 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-26 09:06:44,610 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2021-08-26 09:06:44,610 INFO L402 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2021-08-26 09:06:44,610 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-26 09:06:44,610 INFO L82 PathProgramCache]: Analyzing trace with hash -1707646253, now seen corresponding path program 1 times [2021-08-26 09:06:44,610 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-26 09:06:44,610 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [101607159] [2021-08-26 09:06:44,611 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-26 09:06:44,611 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-26 09:06:44,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-26 09:06:44,632 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 24 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2021-08-26 09:06:44,633 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-26 09:06:44,633 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [101607159] [2021-08-26 09:06:44,633 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [101607159] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-26 09:06:44,633 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-26 09:06:44,633 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-08-26 09:06:44,633 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1134676794] [2021-08-26 09:06:44,634 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-08-26 09:06:44,634 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-26 09:06:44,634 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-08-26 09:06:44,634 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-08-26 09:06:44,634 INFO L87 Difference]: Start difference. First operand 1871 states and 2288 transitions. Second operand has 4 states, 4 states have (on average 22.75) internal successors, (91), 4 states have internal predecessors, (91), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-26 09:06:44,741 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-26 09:06:44,741 INFO L93 Difference]: Finished difference Result 3739 states and 4570 transitions. [2021-08-26 09:06:44,741 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-08-26 09:06:44,742 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 22.75) internal successors, (91), 4 states have internal predecessors, (91), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 94 [2021-08-26 09:06:44,742 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-26 09:06:44,746 INFO L225 Difference]: With dead ends: 3739 [2021-08-26 09:06:44,746 INFO L226 Difference]: Without dead ends: 1626 [2021-08-26 09:06:44,748 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 7.1ms TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-08-26 09:06:44,749 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1626 states. [2021-08-26 09:06:44,803 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1626 to 1596. [2021-08-26 09:06:44,805 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1596 states, 1594 states have (on average 1.213927227101631) internal successors, (1935), 1595 states have internal predecessors, (1935), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-26 09:06:44,808 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1596 states to 1596 states and 1935 transitions. [2021-08-26 09:06:44,808 INFO L78 Accepts]: Start accepts. Automaton has 1596 states and 1935 transitions. Word has length 94 [2021-08-26 09:06:44,808 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-26 09:06:44,808 INFO L470 AbstractCegarLoop]: Abstraction has 1596 states and 1935 transitions. [2021-08-26 09:06:44,809 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 22.75) internal successors, (91), 4 states have internal predecessors, (91), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-26 09:06:44,809 INFO L276 IsEmpty]: Start isEmpty. Operand 1596 states and 1935 transitions. [2021-08-26 09:06:44,810 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2021-08-26 09:06:44,810 INFO L504 BasicCegarLoop]: Found error trace [2021-08-26 09:06:44,810 INFO L512 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-26 09:06:44,810 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2021-08-26 09:06:44,810 INFO L402 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2021-08-26 09:06:44,811 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-26 09:06:44,811 INFO L82 PathProgramCache]: Analyzing trace with hash -539668684, now seen corresponding path program 1 times [2021-08-26 09:06:44,811 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-26 09:06:44,811 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [567093994] [2021-08-26 09:06:44,811 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-26 09:06:44,811 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-26 09:06:44,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-26 09:06:44,836 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 22 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2021-08-26 09:06:44,836 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-26 09:06:44,836 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [567093994] [2021-08-26 09:06:44,836 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [567093994] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-26 09:06:44,836 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-26 09:06:44,836 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-08-26 09:06:44,837 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1645763603] [2021-08-26 09:06:44,837 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-08-26 09:06:44,837 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-26 09:06:44,837 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-08-26 09:06:44,838 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-08-26 09:06:44,838 INFO L87 Difference]: Start difference. First operand 1596 states and 1935 transitions. Second operand has 4 states, 4 states have (on average 21.75) internal successors, (87), 4 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-26 09:06:44,897 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-26 09:06:44,898 INFO L93 Difference]: Finished difference Result 2602 states and 3124 transitions. [2021-08-26 09:06:44,898 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-08-26 09:06:44,898 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 21.75) internal successors, (87), 4 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 94 [2021-08-26 09:06:44,899 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-26 09:06:44,900 INFO L225 Difference]: With dead ends: 2602 [2021-08-26 09:06:44,900 INFO L226 Difference]: Without dead ends: 716 [2021-08-26 09:06:44,902 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 7.5ms TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-08-26 09:06:44,902 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 716 states. [2021-08-26 09:06:44,928 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 716 to 716. [2021-08-26 09:06:44,930 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 716 states, 714 states have (on average 1.1288515406162465) internal successors, (806), 715 states have internal predecessors, (806), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-26 09:06:44,931 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 716 states to 716 states and 806 transitions. [2021-08-26 09:06:44,931 INFO L78 Accepts]: Start accepts. Automaton has 716 states and 806 transitions. Word has length 94 [2021-08-26 09:06:44,931 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-26 09:06:44,931 INFO L470 AbstractCegarLoop]: Abstraction has 716 states and 806 transitions. [2021-08-26 09:06:44,931 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 21.75) internal successors, (87), 4 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-26 09:06:44,931 INFO L276 IsEmpty]: Start isEmpty. Operand 716 states and 806 transitions. [2021-08-26 09:06:44,932 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2021-08-26 09:06:44,932 INFO L504 BasicCegarLoop]: Found error trace [2021-08-26 09:06:44,932 INFO L512 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-26 09:06:44,932 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2021-08-26 09:06:44,933 INFO L402 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2021-08-26 09:06:44,933 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-26 09:06:44,933 INFO L82 PathProgramCache]: Analyzing trace with hash -899403247, now seen corresponding path program 1 times [2021-08-26 09:06:44,933 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-26 09:06:44,933 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1848361796] [2021-08-26 09:06:44,933 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-26 09:06:44,933 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-26 09:06:44,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-26 09:06:44,962 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 30 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-26 09:06:44,963 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-26 09:06:44,963 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1848361796] [2021-08-26 09:06:44,963 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1848361796] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-26 09:06:44,963 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-26 09:06:44,963 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-08-26 09:06:44,963 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [208003152] [2021-08-26 09:06:44,964 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-08-26 09:06:44,964 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-26 09:06:44,964 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-08-26 09:06:44,964 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-08-26 09:06:44,964 INFO L87 Difference]: Start difference. First operand 716 states and 806 transitions. Second operand has 3 states, 3 states have (on average 31.333333333333332) internal successors, (94), 3 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-26 09:06:44,995 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-26 09:06:44,996 INFO L93 Difference]: Finished difference Result 1048 states and 1187 transitions. [2021-08-26 09:06:44,996 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-08-26 09:06:44,996 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 31.333333333333332) internal successors, (94), 3 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 94 [2021-08-26 09:06:44,996 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-26 09:06:44,998 INFO L225 Difference]: With dead ends: 1048 [2021-08-26 09:06:44,998 INFO L226 Difference]: Without dead ends: 594 [2021-08-26 09:06:44,999 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 4.2ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-08-26 09:06:45,000 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 594 states. [2021-08-26 09:06:45,017 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 594 to 594. [2021-08-26 09:06:45,017 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 594 states, 592 states have (on average 1.1182432432432432) internal successors, (662), 593 states have internal predecessors, (662), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-26 09:06:45,018 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 594 states to 594 states and 662 transitions. [2021-08-26 09:06:45,018 INFO L78 Accepts]: Start accepts. Automaton has 594 states and 662 transitions. Word has length 94 [2021-08-26 09:06:45,019 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-26 09:06:45,019 INFO L470 AbstractCegarLoop]: Abstraction has 594 states and 662 transitions. [2021-08-26 09:06:45,019 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 31.333333333333332) internal successors, (94), 3 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-26 09:06:45,019 INFO L276 IsEmpty]: Start isEmpty. Operand 594 states and 662 transitions. [2021-08-26 09:06:45,020 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2021-08-26 09:06:45,020 INFO L504 BasicCegarLoop]: Found error trace [2021-08-26 09:06:45,020 INFO L512 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-26 09:06:45,020 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2021-08-26 09:06:45,020 INFO L402 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2021-08-26 09:06:45,021 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-26 09:06:45,021 INFO L82 PathProgramCache]: Analyzing trace with hash -1716798106, now seen corresponding path program 1 times [2021-08-26 09:06:45,021 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-26 09:06:45,021 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1084938043] [2021-08-26 09:06:45,021 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-26 09:06:45,021 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-26 09:06:45,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-26 09:06:45,084 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 22 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2021-08-26 09:06:45,085 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-26 09:06:45,086 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1084938043] [2021-08-26 09:06:45,087 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1084938043] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-26 09:06:45,087 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-26 09:06:45,088 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-08-26 09:06:45,088 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1166335032] [2021-08-26 09:06:45,088 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-08-26 09:06:45,088 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-26 09:06:45,089 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-08-26 09:06:45,089 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-08-26 09:06:45,089 INFO L87 Difference]: Start difference. First operand 594 states and 662 transitions. Second operand has 4 states, 4 states have (on average 22.0) internal successors, (88), 4 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-26 09:06:45,128 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-26 09:06:45,128 INFO L93 Difference]: Finished difference Result 598 states and 666 transitions. [2021-08-26 09:06:45,129 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-08-26 09:06:45,129 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 22.0) internal successors, (88), 4 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 95 [2021-08-26 09:06:45,129 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-26 09:06:45,130 INFO L225 Difference]: With dead ends: 598 [2021-08-26 09:06:45,131 INFO L226 Difference]: Without dead ends: 596 [2021-08-26 09:06:45,131 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 9.8ms TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-08-26 09:06:45,131 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 596 states. [2021-08-26 09:06:45,156 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 596 to 592. [2021-08-26 09:06:45,157 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 592 states, 591 states have (on average 1.1150592216582065) internal successors, (659), 591 states have internal predecessors, (659), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-26 09:06:45,158 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 592 states to 592 states and 659 transitions. [2021-08-26 09:06:45,158 INFO L78 Accepts]: Start accepts. Automaton has 592 states and 659 transitions. Word has length 95 [2021-08-26 09:06:45,158 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-26 09:06:45,158 INFO L470 AbstractCegarLoop]: Abstraction has 592 states and 659 transitions. [2021-08-26 09:06:45,159 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 22.0) internal successors, (88), 4 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-26 09:06:45,159 INFO L276 IsEmpty]: Start isEmpty. Operand 592 states and 659 transitions. [2021-08-26 09:06:45,159 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2021-08-26 09:06:45,159 INFO L504 BasicCegarLoop]: Found error trace [2021-08-26 09:06:45,160 INFO L512 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-26 09:06:45,160 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2021-08-26 09:06:45,160 INFO L402 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2021-08-26 09:06:45,160 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-26 09:06:45,160 INFO L82 PathProgramCache]: Analyzing trace with hash 1152111348, now seen corresponding path program 1 times [2021-08-26 09:06:45,160 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-26 09:06:45,161 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1769183061] [2021-08-26 09:06:45,161 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-26 09:06:45,161 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-26 09:06:45,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-26 09:06:45,180 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2021-08-26 09:06:45,180 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-26 09:06:45,180 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1769183061] [2021-08-26 09:06:45,180 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1769183061] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-26 09:06:45,180 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-26 09:06:45,181 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-08-26 09:06:45,181 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [410560039] [2021-08-26 09:06:45,182 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-08-26 09:06:45,182 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-26 09:06:45,182 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-08-26 09:06:45,182 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-08-26 09:06:45,183 INFO L87 Difference]: Start difference. First operand 592 states and 659 transitions. Second operand has 3 states, 3 states have (on average 26.666666666666668) internal successors, (80), 3 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-26 09:06:45,233 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-26 09:06:45,233 INFO L93 Difference]: Finished difference Result 1230 states and 1372 transitions. [2021-08-26 09:06:45,234 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-08-26 09:06:45,234 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 26.666666666666668) internal successors, (80), 3 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 99 [2021-08-26 09:06:45,234 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-26 09:06:45,236 INFO L225 Difference]: With dead ends: 1230 [2021-08-26 09:06:45,236 INFO L226 Difference]: Without dead ends: 900 [2021-08-26 09:06:45,237 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.5ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-08-26 09:06:45,237 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 900 states. [2021-08-26 09:06:45,263 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 900 to 594. [2021-08-26 09:06:45,263 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 594 states, 593 states have (on average 1.1146711635750421) internal successors, (661), 593 states have internal predecessors, (661), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-26 09:06:45,264 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 594 states to 594 states and 661 transitions. [2021-08-26 09:06:45,264 INFO L78 Accepts]: Start accepts. Automaton has 594 states and 661 transitions. Word has length 99 [2021-08-26 09:06:45,265 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-26 09:06:45,265 INFO L470 AbstractCegarLoop]: Abstraction has 594 states and 661 transitions. [2021-08-26 09:06:45,265 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 26.666666666666668) internal successors, (80), 3 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-26 09:06:45,265 INFO L276 IsEmpty]: Start isEmpty. Operand 594 states and 661 transitions. [2021-08-26 09:06:45,266 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2021-08-26 09:06:45,266 INFO L504 BasicCegarLoop]: Found error trace [2021-08-26 09:06:45,266 INFO L512 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-26 09:06:45,266 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2021-08-26 09:06:45,266 INFO L402 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2021-08-26 09:06:45,266 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-26 09:06:45,267 INFO L82 PathProgramCache]: Analyzing trace with hash 1118276470, now seen corresponding path program 1 times [2021-08-26 09:06:45,267 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-26 09:06:45,267 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [975329501] [2021-08-26 09:06:45,267 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-26 09:06:45,267 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-26 09:06:45,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-26 09:06:45,279 INFO L354 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-08-26 09:06:45,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-26 09:06:45,311 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-08-26 09:06:45,311 INFO L626 BasicCegarLoop]: Counterexample is feasible [2021-08-26 09:06:45,311 INFO L764 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION [2021-08-26 09:06:45,312 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION [2021-08-26 09:06:45,313 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2021-08-26 09:06:45,316 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2021-08-26 09:06:45,379 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 26.08 09:06:45 BoogieIcfgContainer [2021-08-26 09:06:45,379 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2021-08-26 09:06:45,379 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2021-08-26 09:06:45,379 INFO L271 PluginConnector]: Initializing Witness Printer... [2021-08-26 09:06:45,379 INFO L275 PluginConnector]: Witness Printer initialized [2021-08-26 09:06:45,380 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.08 09:06:42" (3/4) ... [2021-08-26 09:06:45,381 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2021-08-26 09:06:45,434 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2021-08-26 09:06:45,434 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2021-08-26 09:06:45,435 INFO L168 Benchmark]: Toolchain (without parser) took 3636.26 ms. Allocated memory was 73.4 MB in the beginning and 270.5 MB in the end (delta: 197.1 MB). Free memory was 56.3 MB in the beginning and 175.8 MB in the end (delta: -119.5 MB). Peak memory consumption was 77.4 MB. Max. memory is 16.1 GB. [2021-08-26 09:06:45,435 INFO L168 Benchmark]: CDTParser took 0.14 ms. Allocated memory is still 73.4 MB. Free memory is still 55.8 MB. There was no memory consumed. Max. memory is 16.1 GB. [2021-08-26 09:06:45,436 INFO L168 Benchmark]: CACSL2BoogieTranslator took 177.57 ms. Allocated memory is still 73.4 MB. Free memory was 56.1 MB in the beginning and 57.7 MB in the end (delta: -1.6 MB). Peak memory consumption was 15.9 MB. Max. memory is 16.1 GB. [2021-08-26 09:06:45,436 INFO L168 Benchmark]: Boogie Procedure Inliner took 42.11 ms. Allocated memory is still 73.4 MB. Free memory was 57.4 MB in the beginning and 54.8 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. [2021-08-26 09:06:45,436 INFO L168 Benchmark]: Boogie Preprocessor took 39.80 ms. Allocated memory is still 73.4 MB. Free memory was 54.8 MB in the beginning and 53.0 MB in the end (delta: 1.8 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. [2021-08-26 09:06:45,436 INFO L168 Benchmark]: RCFGBuilder took 414.16 ms. Allocated memory was 73.4 MB in the beginning and 104.9 MB in the end (delta: 31.5 MB). Free memory was 53.0 MB in the beginning and 65.3 MB in the end (delta: -12.4 MB). Peak memory consumption was 23.1 MB. Max. memory is 16.1 GB. [2021-08-26 09:06:45,437 INFO L168 Benchmark]: TraceAbstraction took 2890.16 ms. Allocated memory was 104.9 MB in the beginning and 270.5 MB in the end (delta: 165.7 MB). Free memory was 64.8 MB in the beginning and 189.4 MB in the end (delta: -124.6 MB). Peak memory consumption was 40.5 MB. Max. memory is 16.1 GB. [2021-08-26 09:06:45,437 INFO L168 Benchmark]: Witness Printer took 55.03 ms. Allocated memory is still 270.5 MB. Free memory was 189.4 MB in the beginning and 175.8 MB in the end (delta: 13.6 MB). Peak memory consumption was 14.7 MB. Max. memory is 16.1 GB. [2021-08-26 09:06:45,438 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.14 ms. Allocated memory is still 73.4 MB. Free memory is still 55.8 MB. There was no memory consumed. Max. memory is 16.1 GB. * CACSL2BoogieTranslator took 177.57 ms. Allocated memory is still 73.4 MB. Free memory was 56.1 MB in the beginning and 57.7 MB in the end (delta: -1.6 MB). Peak memory consumption was 15.9 MB. Max. memory is 16.1 GB. * Boogie Procedure Inliner took 42.11 ms. Allocated memory is still 73.4 MB. Free memory was 57.4 MB in the beginning and 54.8 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. * Boogie Preprocessor took 39.80 ms. Allocated memory is still 73.4 MB. Free memory was 54.8 MB in the beginning and 53.0 MB in the end (delta: 1.8 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. * RCFGBuilder took 414.16 ms. Allocated memory was 73.4 MB in the beginning and 104.9 MB in the end (delta: 31.5 MB). Free memory was 53.0 MB in the beginning and 65.3 MB in the end (delta: -12.4 MB). Peak memory consumption was 23.1 MB. Max. memory is 16.1 GB. * TraceAbstraction took 2890.16 ms. Allocated memory was 104.9 MB in the beginning and 270.5 MB in the end (delta: 165.7 MB). Free memory was 64.8 MB in the beginning and 189.4 MB in the end (delta: -124.6 MB). Peak memory consumption was 40.5 MB. Max. memory is 16.1 GB. * Witness Printer took 55.03 ms. Allocated memory is still 270.5 MB. Free memory was 189.4 MB in the beginning and 175.8 MB in the end (delta: 13.6 MB). Peak memory consumption was 14.7 MB. Max. memory is 16.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0ms ErrorAutomatonConstructionTimeTotal, 0.0ms FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0ms ErrorAutomatonConstructionTimeAvg, 0.0ms ErrorAutomatonDifferenceTimeAvg, 0.0ms ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - CounterExampleResult [Line: 12]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L16] int m_pc = 0; [L17] int t1_pc = 0; [L18] int m_st ; [L19] int t1_st ; [L20] int m_i ; [L21] int t1_i ; [L22] int M_E = 2; [L23] int T1_E = 2; [L24] int E_M = 2; [L25] int E_1 = 2; [L29] int token ; [L31] 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] [L477] int __retres1 ; [L392] m_i = 1 [L393] 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] [L418] int kernel_st ; [L419] int tmp ; [L420] int tmp___0 ; [L424] kernel_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] [L174] COND TRUE m_i == 1 [L175] 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] [L179] COND TRUE t1_i == 1 [L180] 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] [L263] COND FALSE !(M_E == 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] [L268] COND FALSE !(T1_E == 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] [L273] COND FALSE !(E_M == 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] [L278] COND FALSE !(E_1 == 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] [L316] int tmp ; [L317] int tmp___0 ; [L125] 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] [L128] COND FALSE !(m_pc == 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] [L138] __retres1 = 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] [L140] return (__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] [L321] tmp = is_master_triggered() [L323] COND FALSE !(\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, token=0] [L144] 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] [L147] COND FALSE !(t1_pc == 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] [L157] __retres1 = 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] [L159] return (__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] [L329] tmp___0 = is_transmit1_triggered() [L331] COND FALSE !(\read(tmp___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] [L291] COND FALSE !(M_E == 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] [L296] COND FALSE !(T1_E == 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] [L301] COND FALSE !(E_M == 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] [L306] COND FALSE !(E_1 == 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] [L432] 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] [L435] kernel_st = 1 [L210] 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] [L214] 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] [L189] 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] [L192] COND TRUE m_st == 0 [L193] __retres1 = 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] [L205] return (__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] [L217] tmp = exists_runnable_thread() [L219] 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, token=0] [L224] COND TRUE m_st == 0 [L225] int tmp_ndt_1; [L226] tmp_ndt_1 = __VERIFIER_nondet_int() [L227] 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, token=0] [L238] COND TRUE t1_st == 0 [L239] int tmp_ndt_2; [L240] tmp_ndt_2 = __VERIFIER_nondet_int() [L241] COND TRUE \read(tmp_ndt_2) [L243] t1_st = 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] [L92] 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] [L103] 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] [L105] t1_pc = 1 [L106] 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] [L214] 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, token=0] [L189] 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] [L192] COND TRUE m_st == 0 [L193] __retres1 = 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, token=0] [L205] return (__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] [L217] tmp = exists_runnable_thread() [L219] 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, token=0] [L224] COND TRUE m_st == 0 [L225] int tmp_ndt_1; [L226] tmp_ndt_1 = __VERIFIER_nondet_int() [L227] COND TRUE \read(tmp_ndt_1) [L229] m_st = 1 [L34] int tmp_var = __VERIFIER_nondet_int(); [L36] 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, token=0] [L47] 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, token=0] [L50] token = __VERIFIER_nondet_int() [L51] local = token [L52] E_1 = 1 [L316] int tmp ; [L317] int tmp___0 ; [L125] int __retres1 ; 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, token=0] [L128] COND FALSE !(m_pc == 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, token=0] [L138] __retres1 = 0 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, token=0] [L140] return (__retres1); 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, token=0] [L321] tmp = is_master_triggered() [L323] COND FALSE !(\read(tmp)) 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, token=0] [L144] int __retres1 ; 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, token=0] [L147] COND TRUE t1_pc == 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, token=0] [L148] COND TRUE E_1 == 1 [L149] __retres1 = 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, token=0] [L159] return (__retres1); 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, token=0] [L329] tmp___0 = is_transmit1_triggered() [L331] COND TRUE \read(tmp___0) [L332] t1_st = 0 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, token=0] [L54] E_1 = 2 [L55] m_pc = 1 [L56] 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, token=0] [L238] COND TRUE t1_st == 0 [L239] int tmp_ndt_2; [L240] tmp_ndt_2 = __VERIFIER_nondet_int() [L241] COND TRUE \read(tmp_ndt_2) [L243] t1_st = 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] [L92] 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] [L95] 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] [L111] token += 1 [L112] E_M = 1 [L316] int tmp ; [L317] int tmp___0 ; [L125] int __retres1 ; 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] [L128] COND TRUE m_pc == 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] [L129] COND TRUE E_M == 1 [L130] __retres1 = 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] [L140] return (__retres1); 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] [L321] tmp = is_master_triggered() [L323] COND TRUE \read(tmp) [L324] m_st = 0 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] [L144] int __retres1 ; 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] [L147] COND TRUE t1_pc == 1 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] [L148] COND FALSE !(E_1 == 1) 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] [L157] __retres1 = 0 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] [L159] return (__retres1); 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] [L329] tmp___0 = is_transmit1_triggered() [L331] COND FALSE !(\read(tmp___0)) 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] [L114] 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] [L103] 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] [L105] t1_pc = 1 [L106] 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] [L214] 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, token=1] [L189] 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] [L192] COND TRUE m_st == 0 [L193] __retres1 = 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, token=1] [L205] return (__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] [L217] tmp = exists_runnable_thread() [L219] 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, token=1] [L224] COND TRUE m_st == 0 [L225] int tmp_ndt_1; [L226] tmp_ndt_1 = __VERIFIER_nondet_int() [L227] COND TRUE \read(tmp_ndt_1) [L229] m_st = 1 [L34] int tmp_var = __VERIFIER_nondet_int(); [L36] 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, token=1] [L39] 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, token=1] [L61] 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, token=1] [L66] 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, token=1] [L67] 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, token=1] [L72] 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, token=1] [L73] 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, 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, token=1] [L12] 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] - UnprovableResult [Line: 12]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 148 locations, 2 error locations. Started 1 CEGAR loops. OverallTime: 2782.5ms, OverallIterations: 18, TraceHistogramMax: 3, EmptinessCheckTime: 21.6ms, AutomataDifference: 1272.4ms, DeadEndRemovalTime: 0.0ms, HoareAnnotationTime: 0.0ms, InitialAbstractionConstructionTime: 8.8ms, PartialOrderReductionTime: 0.0ms, HoareTripleCheckerStatistics: 3652 SDtfs, 4277 SDslu, 2959 SDs, 0 SdLazy, 416 SolverSat, 143 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 291.9ms Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 69 GetRequests, 33 SyntacticMatches, 0 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 96.8ms Time, 0.0ms BasicInterpolantAutomatonTime, BiggestAbstraction: size=2426occurred in iteration=11, InterpolantAutomatonStates: 66, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0ms DumpTime, AutomataMinimizationStatistics: 628.9ms AutomataMinimizationTime, 17 MinimizatonAttempts, 1456 StatesRemovedByMinimization, 11 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 42.2ms SsaConstructionTime, 164.0ms SatisfiabilityAnalysisTime, 416.1ms InterpolantComputationTime, 1154 NumberOfCodeBlocks, 1154 NumberOfCodeBlocksAsserted, 18 NumberOfCheckSat, 1037 ConstructedInterpolants, 0 QuantifiedInterpolants, 1848 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 17 InterpolantComputations, 17 PerfectInterpolantSequences, 197/197 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-08-26 09:06:45,464 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...