./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 f470102c Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx12G -Xms1G -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.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(__VERIFIER_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 59598ef74ac7afb6c962e2cc2ba26af488759b7c ..................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... 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.1.25-f470102 [2019-11-28 17:31:24,889 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-28 17:31:24,892 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-28 17:31:24,910 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-28 17:31:24,910 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-28 17:31:24,913 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-28 17:31:24,915 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-28 17:31:24,926 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-28 17:31:24,932 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-28 17:31:24,935 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-28 17:31:24,936 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-28 17:31:24,938 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-28 17:31:24,939 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-28 17:31:24,941 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-28 17:31:24,943 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-28 17:31:24,944 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-28 17:31:24,946 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-28 17:31:24,947 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-28 17:31:24,949 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-28 17:31:24,953 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-28 17:31:24,958 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-28 17:31:24,962 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-28 17:31:24,964 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-28 17:31:24,965 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-28 17:31:24,968 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-28 17:31:24,968 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-28 17:31:24,968 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-28 17:31:24,970 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-28 17:31:24,971 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-28 17:31:24,972 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-28 17:31:24,972 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-28 17:31:24,973 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-28 17:31:24,973 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-28 17:31:24,974 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-28 17:31:24,976 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-28 17:31:24,976 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-28 17:31:24,977 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-28 17:31:24,977 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-28 17:31:24,978 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-28 17:31:24,979 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-28 17:31:24,980 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-28 17:31:24,981 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2019-11-28 17:31:25,013 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-28 17:31:25,017 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-28 17:31:25,018 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-28 17:31:25,020 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-28 17:31:25,021 INFO L138 SettingsManager]: * Use SBE=true [2019-11-28 17:31:25,021 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-28 17:31:25,021 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-28 17:31:25,022 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-28 17:31:25,022 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-28 17:31:25,022 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-28 17:31:25,023 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-11-28 17:31:25,023 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-28 17:31:25,024 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-11-28 17:31:25,024 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-28 17:31:25,024 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-28 17:31:25,025 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-28 17:31:25,025 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-11-28 17:31:25,025 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-28 17:31:25,026 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-28 17:31:25,026 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-28 17:31:25,026 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-11-28 17:31:25,026 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-28 17:31:25,027 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-28 17:31:25,027 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-28 17:31:25,028 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-11-28 17:31:25,028 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-11-28 17:31:25,028 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-11-28 17:31:25,028 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-11-28 17:31:25,029 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2019-11-28 17:31:25,029 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode 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(__VERIFIER_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 -> 59598ef74ac7afb6c962e2cc2ba26af488759b7c [2019-11-28 17:31:25,337 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-28 17:31:25,361 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-28 17:31:25,364 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-28 17:31:25,368 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-28 17:31:25,369 INFO L275 PluginConnector]: CDTParser initialized [2019-11-28 17:31:25,370 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/systemc/token_ring.01.cil-2.c [2019-11-28 17:31:25,454 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/84a8f81e0/dba3782637ca49679b125f99a056c118/FLAG7e20575bb [2019-11-28 17:31:25,977 INFO L306 CDTParser]: Found 1 translation units. [2019-11-28 17:31:25,978 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/systemc/token_ring.01.cil-2.c [2019-11-28 17:31:25,988 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/84a8f81e0/dba3782637ca49679b125f99a056c118/FLAG7e20575bb [2019-11-28 17:31:26,387 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/84a8f81e0/dba3782637ca49679b125f99a056c118 [2019-11-28 17:31:26,391 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-28 17:31:26,393 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-11-28 17:31:26,395 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-28 17:31:26,395 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-28 17:31:26,399 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-28 17:31:26,401 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 05:31:26" (1/1) ... [2019-11-28 17:31:26,404 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@28ec0670 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 05:31:26, skipping insertion in model container [2019-11-28 17:31:26,405 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 05:31:26" (1/1) ... [2019-11-28 17:31:26,414 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-11-28 17:31:26,454 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-11-28 17:31:26,716 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-28 17:31:26,721 INFO L203 MainTranslator]: Completed pre-run [2019-11-28 17:31:26,826 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-28 17:31:26,847 INFO L208 MainTranslator]: Completed translation [2019-11-28 17:31:26,848 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 05:31:26 WrapperNode [2019-11-28 17:31:26,848 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-28 17:31:26,849 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-11-28 17:31:26,849 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-11-28 17:31:26,850 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-11-28 17:31:26,861 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 05:31:26" (1/1) ... [2019-11-28 17:31:26,875 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 05:31:26" (1/1) ... [2019-11-28 17:31:26,919 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-11-28 17:31:26,919 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-28 17:31:26,920 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-28 17:31:26,920 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-28 17:31:26,929 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 05:31:26" (1/1) ... [2019-11-28 17:31:26,930 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 05:31:26" (1/1) ... [2019-11-28 17:31:26,933 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 05:31:26" (1/1) ... [2019-11-28 17:31:26,934 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 05:31:26" (1/1) ... [2019-11-28 17:31:26,943 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 05:31:26" (1/1) ... [2019-11-28 17:31:26,953 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 05:31:26" (1/1) ... [2019-11-28 17:31:26,957 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 05:31:26" (1/1) ... [2019-11-28 17:31:26,963 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-28 17:31:26,964 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-28 17:31:26,964 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-28 17:31:26,964 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-28 17:31:26,965 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 05:31:26" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-28 17:31:27,052 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-28 17:31:27,052 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-28 17:31:27,780 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-28 17:31:27,780 INFO L287 CfgBuilder]: Removed 82 assume(true) statements. [2019-11-28 17:31:27,781 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 05:31:27 BoogieIcfgContainer [2019-11-28 17:31:27,782 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-28 17:31:27,783 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-11-28 17:31:27,783 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-11-28 17:31:27,786 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-11-28 17:31:27,786 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 28.11 05:31:26" (1/3) ... [2019-11-28 17:31:27,787 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@46215af6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.11 05:31:27, skipping insertion in model container [2019-11-28 17:31:27,787 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 05:31:26" (2/3) ... [2019-11-28 17:31:27,788 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@46215af6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.11 05:31:27, skipping insertion in model container [2019-11-28 17:31:27,788 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 05:31:27" (3/3) ... [2019-11-28 17:31:27,790 INFO L109 eAbstractionObserver]: Analyzing ICFG token_ring.01.cil-2.c [2019-11-28 17:31:27,800 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-11-28 17:31:27,807 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2019-11-28 17:31:27,819 INFO L249 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2019-11-28 17:31:27,845 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-11-28 17:31:27,845 INFO L374 AbstractCegarLoop]: Hoare is true [2019-11-28 17:31:27,845 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-11-28 17:31:27,845 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-28 17:31:27,846 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-28 17:31:27,846 INFO L378 AbstractCegarLoop]: Difference is false [2019-11-28 17:31:27,846 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-28 17:31:27,846 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-11-28 17:31:27,866 INFO L276 IsEmpty]: Start isEmpty. Operand 148 states. [2019-11-28 17:31:27,873 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2019-11-28 17:31:27,873 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 17:31:27,874 INFO L410 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] [2019-11-28 17:31:27,874 INFO L410 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 17:31:27,879 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 17:31:27,879 INFO L82 PathProgramCache]: Analyzing trace with hash 754195226, now seen corresponding path program 1 times [2019-11-28 17:31:27,887 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 17:31:27,888 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [250700737] [2019-11-28 17:31:27,888 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 17:31:27,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:31:28,040 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 17:31:28,041 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [250700737] [2019-11-28 17:31:28,042 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 17:31:28,042 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-28 17:31:28,044 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [932363185] [2019-11-28 17:31:28,053 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-28 17:31:28,054 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 17:31:28,064 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-28 17:31:28,065 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 17:31:28,066 INFO L87 Difference]: Start difference. First operand 148 states. Second operand 3 states. [2019-11-28 17:31:28,143 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 17:31:28,144 INFO L93 Difference]: Finished difference Result 291 states and 455 transitions. [2019-11-28 17:31:28,144 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-28 17:31:28,146 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 39 [2019-11-28 17:31:28,146 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 17:31:28,160 INFO L225 Difference]: With dead ends: 291 [2019-11-28 17:31:28,161 INFO L226 Difference]: Without dead ends: 144 [2019-11-28 17:31:28,165 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 17:31:28,183 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 144 states. [2019-11-28 17:31:28,222 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 144 to 144. [2019-11-28 17:31:28,223 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 144 states. [2019-11-28 17:31:28,226 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 144 states to 144 states and 216 transitions. [2019-11-28 17:31:28,232 INFO L78 Accepts]: Start accepts. Automaton has 144 states and 216 transitions. Word has length 39 [2019-11-28 17:31:28,232 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 17:31:28,233 INFO L462 AbstractCegarLoop]: Abstraction has 144 states and 216 transitions. [2019-11-28 17:31:28,233 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-28 17:31:28,234 INFO L276 IsEmpty]: Start isEmpty. Operand 144 states and 216 transitions. [2019-11-28 17:31:28,236 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2019-11-28 17:31:28,237 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 17:31:28,237 INFO L410 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] [2019-11-28 17:31:28,238 INFO L410 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 17:31:28,238 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 17:31:28,239 INFO L82 PathProgramCache]: Analyzing trace with hash 1598200728, now seen corresponding path program 1 times [2019-11-28 17:31:28,239 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 17:31:28,239 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [664088219] [2019-11-28 17:31:28,240 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 17:31:28,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:31:28,330 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 17:31:28,331 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [664088219] [2019-11-28 17:31:28,332 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 17:31:28,333 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-28 17:31:28,333 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [430656789] [2019-11-28 17:31:28,341 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-28 17:31:28,342 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 17:31:28,343 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-28 17:31:28,343 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 17:31:28,343 INFO L87 Difference]: Start difference. First operand 144 states and 216 transitions. Second operand 3 states. [2019-11-28 17:31:28,471 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 17:31:28,471 INFO L93 Difference]: Finished difference Result 384 states and 576 transitions. [2019-11-28 17:31:28,472 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-28 17:31:28,472 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 39 [2019-11-28 17:31:28,472 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 17:31:28,477 INFO L225 Difference]: With dead ends: 384 [2019-11-28 17:31:28,480 INFO L226 Difference]: Without dead ends: 246 [2019-11-28 17:31:28,482 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 17:31:28,487 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 246 states. [2019-11-28 17:31:28,540 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 246 to 242. [2019-11-28 17:31:28,541 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 242 states. [2019-11-28 17:31:28,546 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 242 states to 242 states and 362 transitions. [2019-11-28 17:31:28,549 INFO L78 Accepts]: Start accepts. Automaton has 242 states and 362 transitions. Word has length 39 [2019-11-28 17:31:28,550 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 17:31:28,550 INFO L462 AbstractCegarLoop]: Abstraction has 242 states and 362 transitions. [2019-11-28 17:31:28,550 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-28 17:31:28,551 INFO L276 IsEmpty]: Start isEmpty. Operand 242 states and 362 transitions. [2019-11-28 17:31:28,552 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2019-11-28 17:31:28,552 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 17:31:28,553 INFO L410 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] [2019-11-28 17:31:28,553 INFO L410 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 17:31:28,554 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 17:31:28,554 INFO L82 PathProgramCache]: Analyzing trace with hash 1655040020, now seen corresponding path program 1 times [2019-11-28 17:31:28,554 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 17:31:28,554 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [842710812] [2019-11-28 17:31:28,555 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 17:31:28,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:31:28,622 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 17:31:28,622 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [842710812] [2019-11-28 17:31:28,622 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 17:31:28,623 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-28 17:31:28,623 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [445797753] [2019-11-28 17:31:28,624 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-28 17:31:28,624 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 17:31:28,625 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-28 17:31:28,625 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 17:31:28,625 INFO L87 Difference]: Start difference. First operand 242 states and 362 transitions. Second operand 3 states. [2019-11-28 17:31:28,691 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 17:31:28,692 INFO L93 Difference]: Finished difference Result 477 states and 715 transitions. [2019-11-28 17:31:28,693 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-28 17:31:28,693 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 39 [2019-11-28 17:31:28,693 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 17:31:28,696 INFO L225 Difference]: With dead ends: 477 [2019-11-28 17:31:28,697 INFO L226 Difference]: Without dead ends: 242 [2019-11-28 17:31:28,698 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 17:31:28,700 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 242 states. [2019-11-28 17:31:28,719 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 242 to 242. [2019-11-28 17:31:28,720 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 242 states. [2019-11-28 17:31:28,721 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 242 states to 242 states and 354 transitions. [2019-11-28 17:31:28,722 INFO L78 Accepts]: Start accepts. Automaton has 242 states and 354 transitions. Word has length 39 [2019-11-28 17:31:28,722 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 17:31:28,722 INFO L462 AbstractCegarLoop]: Abstraction has 242 states and 354 transitions. [2019-11-28 17:31:28,722 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-28 17:31:28,723 INFO L276 IsEmpty]: Start isEmpty. Operand 242 states and 354 transitions. [2019-11-28 17:31:28,724 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2019-11-28 17:31:28,724 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 17:31:28,725 INFO L410 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] [2019-11-28 17:31:28,725 INFO L410 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 17:31:28,725 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 17:31:28,726 INFO L82 PathProgramCache]: Analyzing trace with hash -5694440, now seen corresponding path program 1 times [2019-11-28 17:31:28,726 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 17:31:28,726 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1529827248] [2019-11-28 17:31:28,727 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 17:31:28,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:31:28,760 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 17:31:28,761 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1529827248] [2019-11-28 17:31:28,761 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 17:31:28,761 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-28 17:31:28,762 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [149572630] [2019-11-28 17:31:28,762 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-28 17:31:28,763 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 17:31:28,763 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-28 17:31:28,763 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 17:31:28,764 INFO L87 Difference]: Start difference. First operand 242 states and 354 transitions. Second operand 3 states. [2019-11-28 17:31:28,822 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 17:31:28,823 INFO L93 Difference]: Finished difference Result 476 states and 698 transitions. [2019-11-28 17:31:28,824 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-28 17:31:28,824 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 39 [2019-11-28 17:31:28,824 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 17:31:28,826 INFO L225 Difference]: With dead ends: 476 [2019-11-28 17:31:28,826 INFO L226 Difference]: Without dead ends: 242 [2019-11-28 17:31:28,828 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 17:31:28,829 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 242 states. [2019-11-28 17:31:28,846 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 242 to 242. [2019-11-28 17:31:28,847 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 242 states. [2019-11-28 17:31:28,848 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 242 states to 242 states and 340 transitions. [2019-11-28 17:31:28,849 INFO L78 Accepts]: Start accepts. Automaton has 242 states and 340 transitions. Word has length 39 [2019-11-28 17:31:28,849 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 17:31:28,849 INFO L462 AbstractCegarLoop]: Abstraction has 242 states and 340 transitions. [2019-11-28 17:31:28,849 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-28 17:31:28,850 INFO L276 IsEmpty]: Start isEmpty. Operand 242 states and 340 transitions. [2019-11-28 17:31:28,851 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2019-11-28 17:31:28,851 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 17:31:28,851 INFO L410 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] [2019-11-28 17:31:28,852 INFO L410 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 17:31:28,852 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 17:31:28,852 INFO L82 PathProgramCache]: Analyzing trace with hash -752003180, now seen corresponding path program 1 times [2019-11-28 17:31:28,853 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 17:31:28,853 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [396285846] [2019-11-28 17:31:28,854 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 17:31:28,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:31:28,899 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 17:31:28,899 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [396285846] [2019-11-28 17:31:28,900 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 17:31:28,900 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-28 17:31:28,900 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1262012621] [2019-11-28 17:31:28,901 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-28 17:31:28,901 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 17:31:28,902 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-28 17:31:28,902 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 17:31:28,902 INFO L87 Difference]: Start difference. First operand 242 states and 340 transitions. Second operand 3 states. [2019-11-28 17:31:28,972 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 17:31:28,973 INFO L93 Difference]: Finished difference Result 475 states and 669 transitions. [2019-11-28 17:31:28,973 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-28 17:31:28,973 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 39 [2019-11-28 17:31:28,974 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 17:31:28,975 INFO L225 Difference]: With dead ends: 475 [2019-11-28 17:31:28,976 INFO L226 Difference]: Without dead ends: 242 [2019-11-28 17:31:28,977 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 17:31:28,978 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 242 states. [2019-11-28 17:31:28,993 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 242 to 242. [2019-11-28 17:31:28,993 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 242 states. [2019-11-28 17:31:28,994 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 242 states to 242 states and 326 transitions. [2019-11-28 17:31:28,995 INFO L78 Accepts]: Start accepts. Automaton has 242 states and 326 transitions. Word has length 39 [2019-11-28 17:31:28,995 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 17:31:28,995 INFO L462 AbstractCegarLoop]: Abstraction has 242 states and 326 transitions. [2019-11-28 17:31:28,995 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-28 17:31:28,996 INFO L276 IsEmpty]: Start isEmpty. Operand 242 states and 326 transitions. [2019-11-28 17:31:28,997 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2019-11-28 17:31:28,997 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 17:31:28,997 INFO L410 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] [2019-11-28 17:31:28,997 INFO L410 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 17:31:28,998 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 17:31:28,998 INFO L82 PathProgramCache]: Analyzing trace with hash 729577623, now seen corresponding path program 1 times [2019-11-28 17:31:28,998 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 17:31:28,998 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1183428050] [2019-11-28 17:31:28,999 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 17:31:29,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:31:29,088 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 17:31:29,089 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1183428050] [2019-11-28 17:31:29,089 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 17:31:29,089 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-28 17:31:29,089 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2116133056] [2019-11-28 17:31:29,090 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-28 17:31:29,090 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 17:31:29,090 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-28 17:31:29,092 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 17:31:29,092 INFO L87 Difference]: Start difference. First operand 242 states and 326 transitions. Second operand 3 states. [2019-11-28 17:31:29,164 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 17:31:29,164 INFO L93 Difference]: Finished difference Result 662 states and 893 transitions. [2019-11-28 17:31:29,165 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-28 17:31:29,165 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 39 [2019-11-28 17:31:29,166 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 17:31:29,168 INFO L225 Difference]: With dead ends: 662 [2019-11-28 17:31:29,169 INFO L226 Difference]: Without dead ends: 431 [2019-11-28 17:31:29,170 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 17:31:29,171 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 431 states. [2019-11-28 17:31:29,195 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 431 to 407. [2019-11-28 17:31:29,195 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 407 states. [2019-11-28 17:31:29,197 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 407 states to 407 states and 538 transitions. [2019-11-28 17:31:29,198 INFO L78 Accepts]: Start accepts. Automaton has 407 states and 538 transitions. Word has length 39 [2019-11-28 17:31:29,198 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 17:31:29,198 INFO L462 AbstractCegarLoop]: Abstraction has 407 states and 538 transitions. [2019-11-28 17:31:29,199 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-28 17:31:29,199 INFO L276 IsEmpty]: Start isEmpty. Operand 407 states and 538 transitions. [2019-11-28 17:31:29,201 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2019-11-28 17:31:29,201 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 17:31:29,201 INFO L410 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] [2019-11-28 17:31:29,201 INFO L410 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 17:31:29,202 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 17:31:29,202 INFO L82 PathProgramCache]: Analyzing trace with hash 407580417, now seen corresponding path program 1 times [2019-11-28 17:31:29,202 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 17:31:29,203 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [334603812] [2019-11-28 17:31:29,203 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 17:31:29,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:31:29,297 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 17:31:29,299 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [334603812] [2019-11-28 17:31:29,299 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 17:31:29,299 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-28 17:31:29,299 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [9625237] [2019-11-28 17:31:29,301 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-28 17:31:29,306 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 17:31:29,307 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-28 17:31:29,307 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-28 17:31:29,307 INFO L87 Difference]: Start difference. First operand 407 states and 538 transitions. Second operand 5 states. [2019-11-28 17:31:29,435 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 17:31:29,435 INFO L93 Difference]: Finished difference Result 985 states and 1321 transitions. [2019-11-28 17:31:29,436 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-28 17:31:29,436 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 63 [2019-11-28 17:31:29,436 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 17:31:29,439 INFO L225 Difference]: With dead ends: 985 [2019-11-28 17:31:29,440 INFO L226 Difference]: Without dead ends: 593 [2019-11-28 17:31:29,441 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2019-11-28 17:31:29,442 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 593 states. [2019-11-28 17:31:29,472 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 593 to 413. [2019-11-28 17:31:29,473 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 413 states. [2019-11-28 17:31:29,474 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 413 states to 413 states and 533 transitions. [2019-11-28 17:31:29,475 INFO L78 Accepts]: Start accepts. Automaton has 413 states and 533 transitions. Word has length 63 [2019-11-28 17:31:29,475 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 17:31:29,475 INFO L462 AbstractCegarLoop]: Abstraction has 413 states and 533 transitions. [2019-11-28 17:31:29,475 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-28 17:31:29,476 INFO L276 IsEmpty]: Start isEmpty. Operand 413 states and 533 transitions. [2019-11-28 17:31:29,477 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2019-11-28 17:31:29,477 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 17:31:29,477 INFO L410 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] [2019-11-28 17:31:29,477 INFO L410 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 17:31:29,478 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 17:31:29,478 INFO L82 PathProgramCache]: Analyzing trace with hash 830282243, now seen corresponding path program 1 times [2019-11-28 17:31:29,478 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 17:31:29,478 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [25633268] [2019-11-28 17:31:29,479 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 17:31:29,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:31:29,568 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 17:31:29,568 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [25633268] [2019-11-28 17:31:29,569 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 17:31:29,569 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-28 17:31:29,569 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [64908788] [2019-11-28 17:31:29,570 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-28 17:31:29,570 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 17:31:29,571 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-28 17:31:29,571 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 17:31:29,571 INFO L87 Difference]: Start difference. First operand 413 states and 533 transitions. Second operand 3 states. [2019-11-28 17:31:29,661 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 17:31:29,661 INFO L93 Difference]: Finished difference Result 1143 states and 1486 transitions. [2019-11-28 17:31:29,662 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-28 17:31:29,662 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 63 [2019-11-28 17:31:29,662 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 17:31:29,666 INFO L225 Difference]: With dead ends: 1143 [2019-11-28 17:31:29,667 INFO L226 Difference]: Without dead ends: 747 [2019-11-28 17:31:29,668 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 17:31:29,669 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 747 states. [2019-11-28 17:31:29,716 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 747 to 715. [2019-11-28 17:31:29,716 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 715 states. [2019-11-28 17:31:29,719 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 715 states to 715 states and 925 transitions. [2019-11-28 17:31:29,720 INFO L78 Accepts]: Start accepts. Automaton has 715 states and 925 transitions. Word has length 63 [2019-11-28 17:31:29,720 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 17:31:29,720 INFO L462 AbstractCegarLoop]: Abstraction has 715 states and 925 transitions. [2019-11-28 17:31:29,720 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-28 17:31:29,721 INFO L276 IsEmpty]: Start isEmpty. Operand 715 states and 925 transitions. [2019-11-28 17:31:29,721 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2019-11-28 17:31:29,722 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 17:31:29,722 INFO L410 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] [2019-11-28 17:31:29,722 INFO L410 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 17:31:29,722 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 17:31:29,723 INFO L82 PathProgramCache]: Analyzing trace with hash 1821446916, now seen corresponding path program 1 times [2019-11-28 17:31:29,723 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 17:31:29,723 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1253189536] [2019-11-28 17:31:29,723 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 17:31:29,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:31:29,769 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 17:31:29,770 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1253189536] [2019-11-28 17:31:29,770 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 17:31:29,770 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-28 17:31:29,770 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [354536223] [2019-11-28 17:31:29,771 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-28 17:31:29,771 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 17:31:29,771 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-28 17:31:29,772 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-28 17:31:29,772 INFO L87 Difference]: Start difference. First operand 715 states and 925 transitions. Second operand 5 states. [2019-11-28 17:31:29,919 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 17:31:29,920 INFO L93 Difference]: Finished difference Result 1617 states and 2113 transitions. [2019-11-28 17:31:29,920 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-28 17:31:29,921 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 63 [2019-11-28 17:31:29,921 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 17:31:29,926 INFO L225 Difference]: With dead ends: 1617 [2019-11-28 17:31:29,926 INFO L226 Difference]: Without dead ends: 923 [2019-11-28 17:31:29,928 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2019-11-28 17:31:29,930 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 923 states. [2019-11-28 17:31:29,982 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 923 to 721. [2019-11-28 17:31:29,982 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 721 states. [2019-11-28 17:31:29,985 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 721 states to 721 states and 912 transitions. [2019-11-28 17:31:29,985 INFO L78 Accepts]: Start accepts. Automaton has 721 states and 912 transitions. Word has length 63 [2019-11-28 17:31:29,986 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 17:31:29,986 INFO L462 AbstractCegarLoop]: Abstraction has 721 states and 912 transitions. [2019-11-28 17:31:29,986 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-28 17:31:29,986 INFO L276 IsEmpty]: Start isEmpty. Operand 721 states and 912 transitions. [2019-11-28 17:31:29,987 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2019-11-28 17:31:29,987 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 17:31:29,988 INFO L410 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] [2019-11-28 17:31:29,988 INFO L410 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 17:31:29,988 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 17:31:29,988 INFO L82 PathProgramCache]: Analyzing trace with hash -355810040, now seen corresponding path program 1 times [2019-11-28 17:31:29,989 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 17:31:29,989 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [548344330] [2019-11-28 17:31:29,989 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 17:31:29,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:31:30,051 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 17:31:30,052 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [548344330] [2019-11-28 17:31:30,052 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 17:31:30,052 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-28 17:31:30,052 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [707265736] [2019-11-28 17:31:30,053 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-28 17:31:30,053 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 17:31:30,053 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-28 17:31:30,053 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 17:31:30,053 INFO L87 Difference]: Start difference. First operand 721 states and 912 transitions. Second operand 3 states. [2019-11-28 17:31:30,154 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 17:31:30,154 INFO L93 Difference]: Finished difference Result 2017 states and 2558 transitions. [2019-11-28 17:31:30,155 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-28 17:31:30,155 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 63 [2019-11-28 17:31:30,155 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 17:31:30,162 INFO L225 Difference]: With dead ends: 2017 [2019-11-28 17:31:30,162 INFO L226 Difference]: Without dead ends: 1321 [2019-11-28 17:31:30,164 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 17:31:30,166 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1321 states. [2019-11-28 17:31:30,239 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1321 to 1317. [2019-11-28 17:31:30,240 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1317 states. [2019-11-28 17:31:30,244 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1317 states to 1317 states and 1638 transitions. [2019-11-28 17:31:30,244 INFO L78 Accepts]: Start accepts. Automaton has 1317 states and 1638 transitions. Word has length 63 [2019-11-28 17:31:30,245 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 17:31:30,245 INFO L462 AbstractCegarLoop]: Abstraction has 1317 states and 1638 transitions. [2019-11-28 17:31:30,245 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-28 17:31:30,245 INFO L276 IsEmpty]: Start isEmpty. Operand 1317 states and 1638 transitions. [2019-11-28 17:31:30,246 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2019-11-28 17:31:30,246 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 17:31:30,247 INFO L410 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] [2019-11-28 17:31:30,247 INFO L410 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 17:31:30,247 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 17:31:30,247 INFO L82 PathProgramCache]: Analyzing trace with hash 801765960, now seen corresponding path program 1 times [2019-11-28 17:31:30,248 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 17:31:30,248 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [917534617] [2019-11-28 17:31:30,248 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 17:31:30,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:31:30,287 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 17:31:30,287 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [917534617] [2019-11-28 17:31:30,288 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 17:31:30,288 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-28 17:31:30,288 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [628725170] [2019-11-28 17:31:30,289 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-28 17:31:30,289 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 17:31:30,290 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-28 17:31:30,290 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 17:31:30,290 INFO L87 Difference]: Start difference. First operand 1317 states and 1638 transitions. Second operand 3 states. [2019-11-28 17:31:30,456 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 17:31:30,456 INFO L93 Difference]: Finished difference Result 3670 states and 4533 transitions. [2019-11-28 17:31:30,457 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-28 17:31:30,457 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 64 [2019-11-28 17:31:30,457 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 17:31:30,466 INFO L225 Difference]: With dead ends: 3670 [2019-11-28 17:31:30,466 INFO L226 Difference]: Without dead ends: 1847 [2019-11-28 17:31:30,470 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 17:31:30,472 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1847 states. [2019-11-28 17:31:30,574 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1847 to 1847. [2019-11-28 17:31:30,574 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1847 states. [2019-11-28 17:31:30,582 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1847 states to 1847 states and 2255 transitions. [2019-11-28 17:31:30,582 INFO L78 Accepts]: Start accepts. Automaton has 1847 states and 2255 transitions. Word has length 64 [2019-11-28 17:31:30,582 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 17:31:30,583 INFO L462 AbstractCegarLoop]: Abstraction has 1847 states and 2255 transitions. [2019-11-28 17:31:30,583 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-28 17:31:30,583 INFO L276 IsEmpty]: Start isEmpty. Operand 1847 states and 2255 transitions. [2019-11-28 17:31:30,585 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2019-11-28 17:31:30,585 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 17:31:30,586 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 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] [2019-11-28 17:31:30,586 INFO L410 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 17:31:30,586 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 17:31:30,586 INFO L82 PathProgramCache]: Analyzing trace with hash -1159062640, now seen corresponding path program 1 times [2019-11-28 17:31:30,587 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 17:31:30,587 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1467636475] [2019-11-28 17:31:30,587 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 17:31:30,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:31:30,623 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2019-11-28 17:31:30,623 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1467636475] [2019-11-28 17:31:30,624 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 17:31:30,624 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-28 17:31:30,624 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1966892700] [2019-11-28 17:31:30,624 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-28 17:31:30,625 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 17:31:30,625 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-28 17:31:30,625 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 17:31:30,625 INFO L87 Difference]: Start difference. First operand 1847 states and 2255 transitions. Second operand 3 states. [2019-11-28 17:31:30,746 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 17:31:30,746 INFO L93 Difference]: Finished difference Result 3621 states and 4413 transitions. [2019-11-28 17:31:30,747 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-28 17:31:30,747 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 93 [2019-11-28 17:31:30,747 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 17:31:30,756 INFO L225 Difference]: With dead ends: 3621 [2019-11-28 17:31:30,756 INFO L226 Difference]: Without dead ends: 1799 [2019-11-28 17:31:30,759 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 17:31:30,762 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1799 states. [2019-11-28 17:31:30,867 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1799 to 1799. [2019-11-28 17:31:30,868 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1799 states. [2019-11-28 17:31:30,875 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1799 states to 1799 states and 2119 transitions. [2019-11-28 17:31:30,875 INFO L78 Accepts]: Start accepts. Automaton has 1799 states and 2119 transitions. Word has length 93 [2019-11-28 17:31:30,876 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 17:31:30,876 INFO L462 AbstractCegarLoop]: Abstraction has 1799 states and 2119 transitions. [2019-11-28 17:31:30,876 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-28 17:31:30,876 INFO L276 IsEmpty]: Start isEmpty. Operand 1799 states and 2119 transitions. [2019-11-28 17:31:30,879 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2019-11-28 17:31:30,879 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 17:31:30,880 INFO L410 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] [2019-11-28 17:31:30,880 INFO L410 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 17:31:30,880 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 17:31:30,881 INFO L82 PathProgramCache]: Analyzing trace with hash -2067380816, now seen corresponding path program 1 times [2019-11-28 17:31:30,881 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 17:31:30,881 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1021119757] [2019-11-28 17:31:30,881 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 17:31:30,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:31:30,920 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 24 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-11-28 17:31:30,921 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1021119757] [2019-11-28 17:31:30,921 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 17:31:30,921 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-28 17:31:30,921 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1877995074] [2019-11-28 17:31:30,922 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-28 17:31:30,922 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 17:31:30,922 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-28 17:31:30,923 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 17:31:30,923 INFO L87 Difference]: Start difference. First operand 1799 states and 2119 transitions. Second operand 3 states. [2019-11-28 17:31:31,043 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 17:31:31,044 INFO L93 Difference]: Finished difference Result 3078 states and 3607 transitions. [2019-11-28 17:31:31,045 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-28 17:31:31,046 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 94 [2019-11-28 17:31:31,046 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 17:31:31,055 INFO L225 Difference]: With dead ends: 3078 [2019-11-28 17:31:31,055 INFO L226 Difference]: Without dead ends: 724 [2019-11-28 17:31:31,059 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 17:31:31,063 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 724 states. [2019-11-28 17:31:31,107 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 724 to 716. [2019-11-28 17:31:31,108 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 716 states. [2019-11-28 17:31:31,111 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 716 states to 716 states and 806 transitions. [2019-11-28 17:31:31,111 INFO L78 Accepts]: Start accepts. Automaton has 716 states and 806 transitions. Word has length 94 [2019-11-28 17:31:31,111 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 17:31:31,112 INFO L462 AbstractCegarLoop]: Abstraction has 716 states and 806 transitions. [2019-11-28 17:31:31,112 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-28 17:31:31,112 INFO L276 IsEmpty]: Start isEmpty. Operand 716 states and 806 transitions. [2019-11-28 17:31:31,113 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2019-11-28 17:31:31,115 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 17:31:31,115 INFO L410 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] [2019-11-28 17:31:31,115 INFO L410 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 17:31:31,116 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 17:31:31,116 INFO L82 PathProgramCache]: Analyzing trace with hash -899403247, now seen corresponding path program 1 times [2019-11-28 17:31:31,116 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 17:31:31,121 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1679492987] [2019-11-28 17:31:31,121 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 17:31:31,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:31:31,188 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 30 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 17:31:31,189 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1679492987] [2019-11-28 17:31:31,189 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 17:31:31,189 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-28 17:31:31,190 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1618663508] [2019-11-28 17:31:31,191 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-28 17:31:31,191 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 17:31:31,191 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-28 17:31:31,192 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 17:31:31,192 INFO L87 Difference]: Start difference. First operand 716 states and 806 transitions. Second operand 3 states. [2019-11-28 17:31:31,265 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 17:31:31,265 INFO L93 Difference]: Finished difference Result 1048 states and 1187 transitions. [2019-11-28 17:31:31,266 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-28 17:31:31,266 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 94 [2019-11-28 17:31:31,266 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 17:31:31,270 INFO L225 Difference]: With dead ends: 1048 [2019-11-28 17:31:31,270 INFO L226 Difference]: Without dead ends: 594 [2019-11-28 17:31:31,271 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 17:31:31,272 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 594 states. [2019-11-28 17:31:31,302 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 594 to 594. [2019-11-28 17:31:31,303 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 594 states. [2019-11-28 17:31:31,305 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 594 states to 594 states and 662 transitions. [2019-11-28 17:31:31,305 INFO L78 Accepts]: Start accepts. Automaton has 594 states and 662 transitions. Word has length 94 [2019-11-28 17:31:31,305 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 17:31:31,306 INFO L462 AbstractCegarLoop]: Abstraction has 594 states and 662 transitions. [2019-11-28 17:31:31,306 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-28 17:31:31,306 INFO L276 IsEmpty]: Start isEmpty. Operand 594 states and 662 transitions. [2019-11-28 17:31:31,307 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2019-11-28 17:31:31,307 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 17:31:31,307 INFO L410 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] [2019-11-28 17:31:31,308 INFO L410 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 17:31:31,308 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 17:31:31,308 INFO L82 PathProgramCache]: Analyzing trace with hash -1716798106, now seen corresponding path program 1 times [2019-11-28 17:31:31,308 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 17:31:31,308 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1071571436] [2019-11-28 17:31:31,309 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 17:31:31,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:31:31,406 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 22 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2019-11-28 17:31:31,406 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1071571436] [2019-11-28 17:31:31,406 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 17:31:31,407 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-28 17:31:31,407 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1586513086] [2019-11-28 17:31:31,407 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-28 17:31:31,407 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 17:31:31,408 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-28 17:31:31,408 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-28 17:31:31,408 INFO L87 Difference]: Start difference. First operand 594 states and 662 transitions. Second operand 4 states. [2019-11-28 17:31:31,461 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 17:31:31,461 INFO L93 Difference]: Finished difference Result 598 states and 666 transitions. [2019-11-28 17:31:31,461 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-28 17:31:31,462 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 95 [2019-11-28 17:31:31,462 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 17:31:31,465 INFO L225 Difference]: With dead ends: 598 [2019-11-28 17:31:31,465 INFO L226 Difference]: Without dead ends: 596 [2019-11-28 17:31:31,466 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-28 17:31:31,467 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 596 states. [2019-11-28 17:31:31,507 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 596 to 592. [2019-11-28 17:31:31,508 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 592 states. [2019-11-28 17:31:31,510 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 592 states to 592 states and 659 transitions. [2019-11-28 17:31:31,511 INFO L78 Accepts]: Start accepts. Automaton has 592 states and 659 transitions. Word has length 95 [2019-11-28 17:31:31,511 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 17:31:31,511 INFO L462 AbstractCegarLoop]: Abstraction has 592 states and 659 transitions. [2019-11-28 17:31:31,512 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-28 17:31:31,512 INFO L276 IsEmpty]: Start isEmpty. Operand 592 states and 659 transitions. [2019-11-28 17:31:31,514 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2019-11-28 17:31:31,514 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 17:31:31,515 INFO L410 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] [2019-11-28 17:31:31,515 INFO L410 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 17:31:31,515 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 17:31:31,515 INFO L82 PathProgramCache]: Analyzing trace with hash 1152111348, now seen corresponding path program 1 times [2019-11-28 17:31:31,516 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 17:31:31,516 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1163892240] [2019-11-28 17:31:31,516 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 17:31:31,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:31:31,574 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2019-11-28 17:31:31,575 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1163892240] [2019-11-28 17:31:31,578 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 17:31:31,578 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-28 17:31:31,579 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1857624625] [2019-11-28 17:31:31,579 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-28 17:31:31,580 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 17:31:31,580 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-28 17:31:31,581 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 17:31:31,581 INFO L87 Difference]: Start difference. First operand 592 states and 659 transitions. Second operand 3 states. [2019-11-28 17:31:31,670 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 17:31:31,670 INFO L93 Difference]: Finished difference Result 1230 states and 1372 transitions. [2019-11-28 17:31:31,671 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-28 17:31:31,671 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 99 [2019-11-28 17:31:31,671 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 17:31:31,676 INFO L225 Difference]: With dead ends: 1230 [2019-11-28 17:31:31,676 INFO L226 Difference]: Without dead ends: 900 [2019-11-28 17:31:31,678 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 17:31:31,679 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 900 states. [2019-11-28 17:31:31,726 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 900 to 594. [2019-11-28 17:31:31,727 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 594 states. [2019-11-28 17:31:31,729 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 594 states to 594 states and 661 transitions. [2019-11-28 17:31:31,730 INFO L78 Accepts]: Start accepts. Automaton has 594 states and 661 transitions. Word has length 99 [2019-11-28 17:31:31,730 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 17:31:31,730 INFO L462 AbstractCegarLoop]: Abstraction has 594 states and 661 transitions. [2019-11-28 17:31:31,730 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-28 17:31:31,731 INFO L276 IsEmpty]: Start isEmpty. Operand 594 states and 661 transitions. [2019-11-28 17:31:31,732 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2019-11-28 17:31:31,732 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 17:31:31,733 INFO L410 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] [2019-11-28 17:31:31,733 INFO L410 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 17:31:31,733 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 17:31:31,733 INFO L82 PathProgramCache]: Analyzing trace with hash 1118276470, now seen corresponding path program 1 times [2019-11-28 17:31:31,734 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 17:31:31,734 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1272304338] [2019-11-28 17:31:31,734 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 17:31:31,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 17:31:31,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 17:31:31,841 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-28 17:31:31,841 INFO L475 BasicCegarLoop]: Counterexample might be feasible [2019-11-28 17:31:31,977 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 28.11 05:31:31 BoogieIcfgContainer [2019-11-28 17:31:31,978 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-11-28 17:31:31,979 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-11-28 17:31:31,979 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-11-28 17:31:31,979 INFO L275 PluginConnector]: Witness Printer initialized [2019-11-28 17:31:31,980 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 05:31:27" (3/4) ... [2019-11-28 17:31:31,983 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2019-11-28 17:31:32,206 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2019-11-28 17:31:32,209 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-11-28 17:31:32,212 INFO L168 Benchmark]: Toolchain (without parser) took 5818.54 ms. Allocated memory was 1.0 GB in the beginning and 1.4 GB in the end (delta: 323.5 MB). Free memory was 961.7 MB in the beginning and 1.1 GB in the end (delta: -170.8 MB). Peak memory consumption was 152.7 MB. Max. memory is 11.5 GB. [2019-11-28 17:31:32,213 INFO L168 Benchmark]: CDTParser took 0.93 ms. Allocated memory is still 1.0 GB. Free memory is still 987.2 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-28 17:31:32,214 INFO L168 Benchmark]: CACSL2BoogieTranslator took 454.16 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 129.0 MB). Free memory was 961.7 MB in the beginning and 1.1 GB in the end (delta: -157.2 MB). Peak memory consumption was 20.5 MB. Max. memory is 11.5 GB. [2019-11-28 17:31:32,214 INFO L168 Benchmark]: Boogie Procedure Inliner took 69.97 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-28 17:31:32,214 INFO L168 Benchmark]: Boogie Preprocessor took 43.97 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.7 MB). Peak memory consumption was 6.7 MB. Max. memory is 11.5 GB. [2019-11-28 17:31:32,215 INFO L168 Benchmark]: RCFGBuilder took 818.12 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 40.3 MB). Peak memory consumption was 40.3 MB. Max. memory is 11.5 GB. [2019-11-28 17:31:32,215 INFO L168 Benchmark]: TraceAbstraction took 4195.66 ms. Allocated memory was 1.2 GB in the beginning and 1.4 GB in the end (delta: 194.5 MB). Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: -70.1 MB). Peak memory consumption was 124.4 MB. Max. memory is 11.5 GB. [2019-11-28 17:31:32,216 INFO L168 Benchmark]: Witness Printer took 230.79 ms. Allocated memory is still 1.4 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 9.6 MB). Peak memory consumption was 9.6 MB. Max. memory is 11.5 GB. [2019-11-28 17:31:32,218 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.93 ms. Allocated memory is still 1.0 GB. Free memory is still 987.2 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 454.16 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 129.0 MB). Free memory was 961.7 MB in the beginning and 1.1 GB in the end (delta: -157.2 MB). Peak memory consumption was 20.5 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 69.97 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * Boogie Preprocessor took 43.97 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.7 MB). Peak memory consumption was 6.7 MB. Max. memory is 11.5 GB. * RCFGBuilder took 818.12 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 40.3 MB). Peak memory consumption was 40.3 MB. Max. memory is 11.5 GB. * TraceAbstraction took 4195.66 ms. Allocated memory was 1.2 GB in the beginning and 1.4 GB in the end (delta: 194.5 MB). Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: -70.1 MB). Peak memory consumption was 124.4 MB. Max. memory is 11.5 GB. * Witness Printer took 230.79 ms. Allocated memory is still 1.4 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 9.6 MB). Peak memory consumption was 9.6 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 10]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L14] int m_pc = 0; [L15] int t1_pc = 0; [L16] int m_st ; [L17] int t1_st ; [L18] int m_i ; [L19] int t1_i ; [L20] int M_E = 2; [L21] int T1_E = 2; [L22] int E_M = 2; [L23] int E_1 = 2; [L27] int token ; [L29] 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] [L475] int __retres1 ; [L390] m_i = 1 [L391] 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] [L416] int kernel_st ; [L417] int tmp ; [L418] int tmp___0 ; [L422] 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] [L172] COND TRUE m_i == 1 [L173] 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] [L177] COND TRUE t1_i == 1 [L178] 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] [L261] 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] [L266] 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] [L271] 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] [L276] 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] [L314] int tmp ; [L315] int tmp___0 ; [L123] 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] [L126] 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] [L136] __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] [L138] 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] [L319] tmp = is_master_triggered() [L321] 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] [L142] 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] [L145] 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] [L155] __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] [L157] 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] [L327] tmp___0 = is_transmit1_triggered() [L329] 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] [L289] 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] [L294] 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] [L299] 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] [L304] 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] [L430] 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] [L433] kernel_st = 1 [L208] 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] [L212] 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] [L187] 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] [L190] COND TRUE m_st == 0 [L191] __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] [L203] 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] [L215] tmp = exists_runnable_thread() [L217] 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] [L222] COND TRUE m_st == 0 [L223] int tmp_ndt_1; [L224] tmp_ndt_1 = __VERIFIER_nondet_int() [L225] 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] [L236] COND TRUE t1_st == 0 [L237] int tmp_ndt_2; [L238] tmp_ndt_2 = __VERIFIER_nondet_int() [L239] COND TRUE \read(tmp_ndt_2) [L241] 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] [L90] 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] [L101] 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] [L103] t1_pc = 1 [L104] 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] [L212] 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] [L187] 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] [L190] COND TRUE m_st == 0 [L191] __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] [L203] 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] [L215] tmp = exists_runnable_thread() [L217] 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] [L222] COND TRUE m_st == 0 [L223] int tmp_ndt_1; [L224] tmp_ndt_1 = __VERIFIER_nondet_int() [L225] COND TRUE \read(tmp_ndt_1) [L227] m_st = 1 [L32] int tmp_var = __VERIFIER_nondet_int(); [L34] 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] [L45] 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] [L48] token = __VERIFIER_nondet_int() [L49] local = token [L50] E_1 = 1 [L314] int tmp ; [L315] int tmp___0 ; [L123] 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] [L126] 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] [L136] __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] [L138] 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] [L319] tmp = is_master_triggered() [L321] 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] [L142] 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] [L145] 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] [L146] COND TRUE E_1 == 1 [L147] __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] [L157] 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] [L327] tmp___0 = is_transmit1_triggered() [L329] COND TRUE \read(tmp___0) [L330] 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] [L52] E_1 = 2 [L53] m_pc = 1 [L54] 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] [L236] COND TRUE t1_st == 0 [L237] int tmp_ndt_2; [L238] tmp_ndt_2 = __VERIFIER_nondet_int() [L239] COND TRUE \read(tmp_ndt_2) [L241] 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] [L90] 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] [L93] 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] [L109] token += 1 [L110] E_M = 1 [L314] int tmp ; [L315] int tmp___0 ; [L123] 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] [L126] 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] [L127] COND TRUE E_M == 1 [L128] __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] [L138] 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] [L319] tmp = is_master_triggered() [L321] COND TRUE \read(tmp) [L322] 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] [L142] 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] [L145] 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] [L146] 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] [L155] __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] [L157] 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] [L327] tmp___0 = is_transmit1_triggered() [L329] 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] [L112] 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] [L101] 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] [L103] t1_pc = 1 [L104] 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] [L212] 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] [L187] 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] [L190] COND TRUE m_st == 0 [L191] __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] [L203] 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] [L215] tmp = exists_runnable_thread() [L217] 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] [L222] COND TRUE m_st == 0 [L223] int tmp_ndt_1; [L224] tmp_ndt_1 = __VERIFIER_nondet_int() [L225] COND TRUE \read(tmp_ndt_1) [L227] m_st = 1 [L32] int tmp_var = __VERIFIER_nondet_int(); [L34] 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] [L37] 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] [L59] 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] [L64] 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] [L65] 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] [L70] 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] [L71] 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] [L10] __VERIFIER_error() VAL [E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, token=1] - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 148 locations, 2 error locations. Result: UNSAFE, OverallTime: 3.9s, OverallIterations: 17, TraceHistogramMax: 3, AutomataDifference: 1.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 3381 SDtfs, 2968 SDslu, 2280 SDs, 0 SdLazy, 233 SolverSat, 103 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.4s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 57 GetRequests, 31 SyntacticMatches, 1 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1847occurred in iteration=11, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.8s AutomataMinimizationTime, 16 MinimizatonAttempts, 764 StatesRemovedByMinimization, 9 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 0.6s InterpolantComputationTime, 1125 NumberOfCodeBlocks, 1125 NumberOfCodeBlocksAsserted, 17 NumberOfCheckSat, 1009 ConstructedInterpolants, 0 QuantifiedInterpolants, 125079 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 16 InterpolantComputations, 16 PerfectInterpolantSequences, 191/191 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! Received shutdown request...