./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/product-lines/minepump_spec1_product35.cil.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/product-lines/minepump_spec1_product35.cil.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 dc08a0b643f05bf554ed8bba095ffb3efc1cc232 ......................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... 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:24:20,765 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-28 17:24:20,767 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-28 17:24:20,784 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-28 17:24:20,785 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-28 17:24:20,786 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-28 17:24:20,787 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-28 17:24:20,789 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-28 17:24:20,791 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-28 17:24:20,792 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-28 17:24:20,793 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-28 17:24:20,795 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-28 17:24:20,795 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-28 17:24:20,796 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-28 17:24:20,797 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-28 17:24:20,798 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-28 17:24:20,799 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-28 17:24:20,800 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-28 17:24:20,802 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-28 17:24:20,804 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-28 17:24:20,806 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-28 17:24:20,807 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-28 17:24:20,808 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-28 17:24:20,809 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-28 17:24:20,811 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-28 17:24:20,812 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-28 17:24:20,812 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-28 17:24:20,813 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-28 17:24:20,814 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-28 17:24:20,815 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-28 17:24:20,815 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-28 17:24:20,816 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-28 17:24:20,817 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-28 17:24:20,817 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-28 17:24:20,819 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-28 17:24:20,819 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-28 17:24:20,820 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-28 17:24:20,820 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-28 17:24:20,820 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-28 17:24:20,821 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-28 17:24:20,822 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-28 17:24:20,823 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:24:20,838 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-28 17:24:20,838 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-28 17:24:20,839 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-28 17:24:20,840 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-28 17:24:20,840 INFO L138 SettingsManager]: * Use SBE=true [2019-11-28 17:24:20,840 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-28 17:24:20,840 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-28 17:24:20,840 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-28 17:24:20,841 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-28 17:24:20,841 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-28 17:24:20,841 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-11-28 17:24:20,841 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-28 17:24:20,841 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-11-28 17:24:20,842 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-28 17:24:20,843 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-28 17:24:20,843 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-28 17:24:20,843 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-11-28 17:24:20,843 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-28 17:24:20,844 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-28 17:24:20,844 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-28 17:24:20,844 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-11-28 17:24:20,844 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-28 17:24:20,845 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-28 17:24:20,845 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-28 17:24:20,845 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-11-28 17:24:20,846 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-11-28 17:24:20,846 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-11-28 17:24:20,846 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-11-28 17:24:20,847 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2019-11-28 17:24:20,847 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 -> dc08a0b643f05bf554ed8bba095ffb3efc1cc232 [2019-11-28 17:24:21,240 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-28 17:24:21,263 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-28 17:24:21,267 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-28 17:24:21,272 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-28 17:24:21,273 INFO L275 PluginConnector]: CDTParser initialized [2019-11-28 17:24:21,274 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/product-lines/minepump_spec1_product35.cil.c [2019-11-28 17:24:21,361 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/52820d4b8/b8e2cd312a8f4540a5fa70af0f5142a7/FLAG9348479f8 [2019-11-28 17:24:21,908 INFO L306 CDTParser]: Found 1 translation units. [2019-11-28 17:24:21,909 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/product-lines/minepump_spec1_product35.cil.c [2019-11-28 17:24:21,923 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/52820d4b8/b8e2cd312a8f4540a5fa70af0f5142a7/FLAG9348479f8 [2019-11-28 17:24:22,171 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/52820d4b8/b8e2cd312a8f4540a5fa70af0f5142a7 [2019-11-28 17:24:22,175 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-28 17:24:22,177 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-11-28 17:24:22,178 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-28 17:24:22,178 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-28 17:24:22,182 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-28 17:24:22,183 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 05:24:22" (1/1) ... [2019-11-28 17:24:22,187 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@34097ed9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 05:24:22, skipping insertion in model container [2019-11-28 17:24:22,187 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 05:24:22" (1/1) ... [2019-11-28 17:24:22,196 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-11-28 17:24:22,248 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-11-28 17:24:22,669 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-28 17:24:22,681 INFO L203 MainTranslator]: Completed pre-run [2019-11-28 17:24:22,766 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-28 17:24:22,805 INFO L208 MainTranslator]: Completed translation [2019-11-28 17:24:22,806 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 05:24:22 WrapperNode [2019-11-28 17:24:22,806 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-28 17:24:22,807 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-11-28 17:24:22,807 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-11-28 17:24:22,807 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-11-28 17:24:22,815 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:24:22" (1/1) ... [2019-11-28 17:24:22,839 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:24:22" (1/1) ... [2019-11-28 17:24:22,882 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-11-28 17:24:22,882 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-28 17:24:22,882 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-28 17:24:22,882 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-28 17:24:22,893 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 05:24:22" (1/1) ... [2019-11-28 17:24:22,893 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 05:24:22" (1/1) ... [2019-11-28 17:24:22,898 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 05:24:22" (1/1) ... [2019-11-28 17:24:22,898 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 05:24:22" (1/1) ... [2019-11-28 17:24:22,911 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 05:24:22" (1/1) ... [2019-11-28 17:24:22,919 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 05:24:22" (1/1) ... [2019-11-28 17:24:22,922 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 05:24:22" (1/1) ... [2019-11-28 17:24:22,927 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-28 17:24:22,927 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-28 17:24:22,927 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-28 17:24:22,928 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-28 17:24:22,928 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 05:24:22" (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:24:22,987 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-11-28 17:24:22,987 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2019-11-28 17:24:22,987 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-28 17:24:22,988 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-28 17:24:23,777 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-28 17:24:23,777 INFO L287 CfgBuilder]: Removed 100 assume(true) statements. [2019-11-28 17:24:23,778 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 05:24:23 BoogieIcfgContainer [2019-11-28 17:24:23,778 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-28 17:24:23,779 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-11-28 17:24:23,780 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-11-28 17:24:23,783 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-11-28 17:24:23,783 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 28.11 05:24:22" (1/3) ... [2019-11-28 17:24:23,784 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3d38a825 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.11 05:24:23, skipping insertion in model container [2019-11-28 17:24:23,784 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 05:24:22" (2/3) ... [2019-11-28 17:24:23,785 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3d38a825 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.11 05:24:23, skipping insertion in model container [2019-11-28 17:24:23,785 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 05:24:23" (3/3) ... [2019-11-28 17:24:23,787 INFO L109 eAbstractionObserver]: Analyzing ICFG minepump_spec1_product35.cil.c [2019-11-28 17:24:23,796 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-11-28 17:24:23,804 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 3 error locations. [2019-11-28 17:24:23,818 INFO L249 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2019-11-28 17:24:23,846 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-11-28 17:24:23,846 INFO L374 AbstractCegarLoop]: Hoare is true [2019-11-28 17:24:23,846 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-11-28 17:24:23,847 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-28 17:24:23,847 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-28 17:24:23,847 INFO L378 AbstractCegarLoop]: Difference is false [2019-11-28 17:24:23,847 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-28 17:24:23,848 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-11-28 17:24:23,866 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states. [2019-11-28 17:24:23,874 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-11-28 17:24:23,874 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 17:24:23,875 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 17:24:23,876 INFO L410 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 17:24:23,882 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 17:24:23,883 INFO L82 PathProgramCache]: Analyzing trace with hash -1355288485, now seen corresponding path program 1 times [2019-11-28 17:24:23,892 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 17:24:23,893 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [289593642] [2019-11-28 17:24:23,893 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 17:24:24,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:24:24,229 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:24:24,231 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [289593642] [2019-11-28 17:24:24,232 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 17:24:24,232 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-28 17:24:24,234 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [608386027] [2019-11-28 17:24:24,240 INFO L442 AbstractCegarLoop]: Interpolant automaton has 2 states [2019-11-28 17:24:24,240 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 17:24:24,255 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2019-11-28 17:24:24,256 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-11-28 17:24:24,258 INFO L87 Difference]: Start difference. First operand 80 states. Second operand 2 states. [2019-11-28 17:24:24,289 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 17:24:24,290 INFO L93 Difference]: Finished difference Result 154 states and 233 transitions. [2019-11-28 17:24:24,290 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2019-11-28 17:24:24,291 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 16 [2019-11-28 17:24:24,292 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 17:24:24,305 INFO L225 Difference]: With dead ends: 154 [2019-11-28 17:24:24,305 INFO L226 Difference]: Without dead ends: 76 [2019-11-28 17:24:24,309 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-11-28 17:24:24,329 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76 states. [2019-11-28 17:24:24,365 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 76. [2019-11-28 17:24:24,367 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 76 states. [2019-11-28 17:24:24,373 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 108 transitions. [2019-11-28 17:24:24,377 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 108 transitions. Word has length 16 [2019-11-28 17:24:24,379 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 17:24:24,379 INFO L462 AbstractCegarLoop]: Abstraction has 76 states and 108 transitions. [2019-11-28 17:24:24,379 INFO L463 AbstractCegarLoop]: Interpolant automaton has 2 states. [2019-11-28 17:24:24,380 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 108 transitions. [2019-11-28 17:24:24,382 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-11-28 17:24:24,382 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 17:24:24,382 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 17:24:24,383 INFO L410 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 17:24:24,384 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 17:24:24,384 INFO L82 PathProgramCache]: Analyzing trace with hash 1892921914, now seen corresponding path program 1 times [2019-11-28 17:24:24,384 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 17:24:24,385 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2056418847] [2019-11-28 17:24:24,385 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 17:24:24,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:24:24,543 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:24:24,544 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2056418847] [2019-11-28 17:24:24,544 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 17:24:24,544 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-28 17:24:24,544 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1056208128] [2019-11-28 17:24:24,546 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-28 17:24:24,548 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 17:24:24,548 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-28 17:24:24,549 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 17:24:24,549 INFO L87 Difference]: Start difference. First operand 76 states and 108 transitions. Second operand 3 states. [2019-11-28 17:24:24,573 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 17:24:24,575 INFO L93 Difference]: Finished difference Result 76 states and 108 transitions. [2019-11-28 17:24:24,576 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-28 17:24:24,576 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 17 [2019-11-28 17:24:24,577 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 17:24:24,579 INFO L225 Difference]: With dead ends: 76 [2019-11-28 17:24:24,580 INFO L226 Difference]: Without dead ends: 36 [2019-11-28 17:24:24,583 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:24:24,584 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2019-11-28 17:24:24,588 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 36. [2019-11-28 17:24:24,588 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36 states. [2019-11-28 17:24:24,589 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 51 transitions. [2019-11-28 17:24:24,590 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 51 transitions. Word has length 17 [2019-11-28 17:24:24,590 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 17:24:24,590 INFO L462 AbstractCegarLoop]: Abstraction has 36 states and 51 transitions. [2019-11-28 17:24:24,591 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-28 17:24:24,591 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 51 transitions. [2019-11-28 17:24:24,592 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-11-28 17:24:24,592 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 17:24:24,592 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] [2019-11-28 17:24:24,593 INFO L410 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 17:24:24,593 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 17:24:24,593 INFO L82 PathProgramCache]: Analyzing trace with hash -1160602350, now seen corresponding path program 1 times [2019-11-28 17:24:24,594 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 17:24:24,594 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [448513872] [2019-11-28 17:24:24,594 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 17:24:24,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:24:24,739 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:24:24,740 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [448513872] [2019-11-28 17:24:24,740 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 17:24:24,740 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-28 17:24:24,741 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [485558242] [2019-11-28 17:24:24,741 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-28 17:24:24,741 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 17:24:24,745 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-28 17:24:24,745 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-11-28 17:24:24,746 INFO L87 Difference]: Start difference. First operand 36 states and 51 transitions. Second operand 6 states. [2019-11-28 17:24:24,890 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 17:24:24,891 INFO L93 Difference]: Finished difference Result 119 states and 175 transitions. [2019-11-28 17:24:24,892 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-28 17:24:24,892 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 22 [2019-11-28 17:24:24,892 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 17:24:24,893 INFO L225 Difference]: With dead ends: 119 [2019-11-28 17:24:24,893 INFO L226 Difference]: Without dead ends: 89 [2019-11-28 17:24:24,895 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2019-11-28 17:24:24,895 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states. [2019-11-28 17:24:24,905 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 55. [2019-11-28 17:24:24,905 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 55 states. [2019-11-28 17:24:24,906 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 80 transitions. [2019-11-28 17:24:24,907 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 80 transitions. Word has length 22 [2019-11-28 17:24:24,907 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 17:24:24,907 INFO L462 AbstractCegarLoop]: Abstraction has 55 states and 80 transitions. [2019-11-28 17:24:24,907 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-28 17:24:24,908 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 80 transitions. [2019-11-28 17:24:24,909 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2019-11-28 17:24:24,909 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 17:24:24,909 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] [2019-11-28 17:24:24,910 INFO L410 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 17:24:24,910 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 17:24:24,910 INFO L82 PathProgramCache]: Analyzing trace with hash 1572373846, now seen corresponding path program 1 times [2019-11-28 17:24:24,911 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 17:24:24,911 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1133925609] [2019-11-28 17:24:24,911 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 17:24:24,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:24:24,984 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:24:24,987 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1133925609] [2019-11-28 17:24:24,988 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 17:24:24,988 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-28 17:24:24,988 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [379377657] [2019-11-28 17:24:24,989 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-28 17:24:24,989 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 17:24:24,989 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-28 17:24:24,989 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 17:24:24,993 INFO L87 Difference]: Start difference. First operand 55 states and 80 transitions. Second operand 3 states. [2019-11-28 17:24:25,030 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 17:24:25,031 INFO L93 Difference]: Finished difference Result 125 states and 184 transitions. [2019-11-28 17:24:25,031 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-28 17:24:25,031 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 23 [2019-11-28 17:24:25,032 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 17:24:25,033 INFO L225 Difference]: With dead ends: 125 [2019-11-28 17:24:25,033 INFO L226 Difference]: Without dead ends: 76 [2019-11-28 17:24:25,034 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:24:25,034 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76 states. [2019-11-28 17:24:25,044 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 74. [2019-11-28 17:24:25,044 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 74 states. [2019-11-28 17:24:25,045 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 105 transitions. [2019-11-28 17:24:25,045 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 105 transitions. Word has length 23 [2019-11-28 17:24:25,045 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 17:24:25,045 INFO L462 AbstractCegarLoop]: Abstraction has 74 states and 105 transitions. [2019-11-28 17:24:25,046 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-28 17:24:25,046 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 105 transitions. [2019-11-28 17:24:25,047 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-11-28 17:24:25,047 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 17:24:25,047 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] [2019-11-28 17:24:25,048 INFO L410 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 17:24:25,048 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 17:24:25,048 INFO L82 PathProgramCache]: Analyzing trace with hash 1956458727, now seen corresponding path program 1 times [2019-11-28 17:24:25,049 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 17:24:25,049 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [270646850] [2019-11-28 17:24:25,049 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 17:24:25,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:24:25,166 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:24:25,168 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [270646850] [2019-11-28 17:24:25,168 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 17:24:25,168 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-28 17:24:25,168 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1986600704] [2019-11-28 17:24:25,169 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-28 17:24:25,169 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 17:24:25,170 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-28 17:24:25,170 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-28 17:24:25,170 INFO L87 Difference]: Start difference. First operand 74 states and 105 transitions. Second operand 5 states. [2019-11-28 17:24:25,293 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 17:24:25,293 INFO L93 Difference]: Finished difference Result 354 states and 517 transitions. [2019-11-28 17:24:25,294 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-11-28 17:24:25,294 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 25 [2019-11-28 17:24:25,295 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 17:24:25,297 INFO L225 Difference]: With dead ends: 354 [2019-11-28 17:24:25,297 INFO L226 Difference]: Without dead ends: 286 [2019-11-28 17:24:25,298 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2019-11-28 17:24:25,299 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 286 states. [2019-11-28 17:24:25,321 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 286 to 134. [2019-11-28 17:24:25,322 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 134 states. [2019-11-28 17:24:25,323 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 134 states to 134 states and 188 transitions. [2019-11-28 17:24:25,323 INFO L78 Accepts]: Start accepts. Automaton has 134 states and 188 transitions. Word has length 25 [2019-11-28 17:24:25,324 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 17:24:25,324 INFO L462 AbstractCegarLoop]: Abstraction has 134 states and 188 transitions. [2019-11-28 17:24:25,324 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-28 17:24:25,324 INFO L276 IsEmpty]: Start isEmpty. Operand 134 states and 188 transitions. [2019-11-28 17:24:25,335 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2019-11-28 17:24:25,335 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 17:24:25,335 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] [2019-11-28 17:24:25,336 INFO L410 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 17:24:25,336 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 17:24:25,336 INFO L82 PathProgramCache]: Analyzing trace with hash 1752651633, now seen corresponding path program 1 times [2019-11-28 17:24:25,336 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 17:24:25,340 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [750767218] [2019-11-28 17:24:25,340 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 17:24:25,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:24:25,450 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:24:25,452 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [750767218] [2019-11-28 17:24:25,453 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 17:24:25,453 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-28 17:24:25,453 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [600014861] [2019-11-28 17:24:25,455 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-28 17:24:25,455 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 17:24:25,455 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-28 17:24:25,456 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-28 17:24:25,456 INFO L87 Difference]: Start difference. First operand 134 states and 188 transitions. Second operand 5 states. [2019-11-28 17:24:25,596 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 17:24:25,596 INFO L93 Difference]: Finished difference Result 368 states and 521 transitions. [2019-11-28 17:24:25,597 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-11-28 17:24:25,597 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 26 [2019-11-28 17:24:25,597 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 17:24:25,600 INFO L225 Difference]: With dead ends: 368 [2019-11-28 17:24:25,600 INFO L226 Difference]: Without dead ends: 366 [2019-11-28 17:24:25,601 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2019-11-28 17:24:25,602 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 366 states. [2019-11-28 17:24:25,623 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 366 to 134. [2019-11-28 17:24:25,624 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 134 states. [2019-11-28 17:24:25,625 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 134 states to 134 states and 186 transitions. [2019-11-28 17:24:25,625 INFO L78 Accepts]: Start accepts. Automaton has 134 states and 186 transitions. Word has length 26 [2019-11-28 17:24:25,625 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 17:24:25,626 INFO L462 AbstractCegarLoop]: Abstraction has 134 states and 186 transitions. [2019-11-28 17:24:25,626 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-28 17:24:25,626 INFO L276 IsEmpty]: Start isEmpty. Operand 134 states and 186 transitions. [2019-11-28 17:24:25,628 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2019-11-28 17:24:25,628 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 17:24:25,628 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] [2019-11-28 17:24:25,630 INFO L410 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 17:24:25,631 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 17:24:25,631 INFO L82 PathProgramCache]: Analyzing trace with hash -1960990159, now seen corresponding path program 1 times [2019-11-28 17:24:25,631 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 17:24:25,632 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1415143802] [2019-11-28 17:24:25,632 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 17:24:25,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:24:25,718 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:24:25,718 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1415143802] [2019-11-28 17:24:25,718 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 17:24:25,719 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-28 17:24:25,719 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [919783530] [2019-11-28 17:24:25,719 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-28 17:24:25,726 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 17:24:25,726 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-28 17:24:25,726 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-28 17:24:25,727 INFO L87 Difference]: Start difference. First operand 134 states and 186 transitions. Second operand 5 states. [2019-11-28 17:24:25,792 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 17:24:25,793 INFO L93 Difference]: Finished difference Result 398 states and 551 transitions. [2019-11-28 17:24:25,793 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-28 17:24:25,793 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 30 [2019-11-28 17:24:25,794 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 17:24:25,795 INFO L225 Difference]: With dead ends: 398 [2019-11-28 17:24:25,796 INFO L226 Difference]: Without dead ends: 270 [2019-11-28 17:24:25,797 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:24:25,798 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 270 states. [2019-11-28 17:24:25,815 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 270 to 140. [2019-11-28 17:24:25,816 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 140 states. [2019-11-28 17:24:25,817 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 140 states to 140 states and 192 transitions. [2019-11-28 17:24:25,817 INFO L78 Accepts]: Start accepts. Automaton has 140 states and 192 transitions. Word has length 30 [2019-11-28 17:24:25,817 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 17:24:25,817 INFO L462 AbstractCegarLoop]: Abstraction has 140 states and 192 transitions. [2019-11-28 17:24:25,818 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-28 17:24:25,818 INFO L276 IsEmpty]: Start isEmpty. Operand 140 states and 192 transitions. [2019-11-28 17:24:25,819 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2019-11-28 17:24:25,819 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 17:24:25,820 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] [2019-11-28 17:24:25,820 INFO L410 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 17:24:25,820 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 17:24:25,820 INFO L82 PathProgramCache]: Analyzing trace with hash 1940950127, now seen corresponding path program 1 times [2019-11-28 17:24:25,821 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 17:24:25,821 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1435998155] [2019-11-28 17:24:25,821 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 17:24:25,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:24:25,891 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:24:25,892 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1435998155] [2019-11-28 17:24:25,892 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 17:24:25,892 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-11-28 17:24:25,893 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [191369766] [2019-11-28 17:24:25,893 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-28 17:24:25,894 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 17:24:25,894 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-28 17:24:25,894 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-11-28 17:24:25,894 INFO L87 Difference]: Start difference. First operand 140 states and 192 transitions. Second operand 6 states. [2019-11-28 17:24:25,995 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 17:24:25,995 INFO L93 Difference]: Finished difference Result 432 states and 590 transitions. [2019-11-28 17:24:25,996 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-11-28 17:24:25,996 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 30 [2019-11-28 17:24:25,996 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 17:24:25,998 INFO L225 Difference]: With dead ends: 432 [2019-11-28 17:24:25,998 INFO L226 Difference]: Without dead ends: 298 [2019-11-28 17:24:25,999 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=34, Invalid=56, Unknown=0, NotChecked=0, Total=90 [2019-11-28 17:24:26,000 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 298 states. [2019-11-28 17:24:26,016 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 298 to 144. [2019-11-28 17:24:26,016 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 144 states. [2019-11-28 17:24:26,017 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 144 states to 144 states and 196 transitions. [2019-11-28 17:24:26,017 INFO L78 Accepts]: Start accepts. Automaton has 144 states and 196 transitions. Word has length 30 [2019-11-28 17:24:26,017 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 17:24:26,018 INFO L462 AbstractCegarLoop]: Abstraction has 144 states and 196 transitions. [2019-11-28 17:24:26,018 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-28 17:24:26,018 INFO L276 IsEmpty]: Start isEmpty. Operand 144 states and 196 transitions. [2019-11-28 17:24:26,019 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2019-11-28 17:24:26,019 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 17:24:26,019 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] [2019-11-28 17:24:26,020 INFO L410 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 17:24:26,020 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 17:24:26,020 INFO L82 PathProgramCache]: Analyzing trace with hash -2095851731, now seen corresponding path program 1 times [2019-11-28 17:24:26,020 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 17:24:26,021 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [963729908] [2019-11-28 17:24:26,021 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 17:24:26,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:24:26,061 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:24:26,062 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [963729908] [2019-11-28 17:24:26,062 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 17:24:26,062 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-28 17:24:26,063 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [999716456] [2019-11-28 17:24:26,063 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-28 17:24:26,063 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 17:24:26,064 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-28 17:24:26,064 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 17:24:26,064 INFO L87 Difference]: Start difference. First operand 144 states and 196 transitions. Second operand 3 states. [2019-11-28 17:24:26,113 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 17:24:26,114 INFO L93 Difference]: Finished difference Result 368 states and 500 transitions. [2019-11-28 17:24:26,114 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-28 17:24:26,114 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 30 [2019-11-28 17:24:26,115 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 17:24:26,116 INFO L225 Difference]: With dead ends: 368 [2019-11-28 17:24:26,117 INFO L226 Difference]: Without dead ends: 230 [2019-11-28 17:24:26,117 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:24:26,118 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 230 states. [2019-11-28 17:24:26,151 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 230 to 230. [2019-11-28 17:24:26,151 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 230 states. [2019-11-28 17:24:26,153 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 230 states to 230 states and 304 transitions. [2019-11-28 17:24:26,153 INFO L78 Accepts]: Start accepts. Automaton has 230 states and 304 transitions. Word has length 30 [2019-11-28 17:24:26,153 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 17:24:26,154 INFO L462 AbstractCegarLoop]: Abstraction has 230 states and 304 transitions. [2019-11-28 17:24:26,154 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-28 17:24:26,154 INFO L276 IsEmpty]: Start isEmpty. Operand 230 states and 304 transitions. [2019-11-28 17:24:26,159 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2019-11-28 17:24:26,159 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 17:24:26,160 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] [2019-11-28 17:24:26,160 INFO L410 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 17:24:26,160 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 17:24:26,161 INFO L82 PathProgramCache]: Analyzing trace with hash 191299371, now seen corresponding path program 1 times [2019-11-28 17:24:26,161 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 17:24:26,161 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [817269127] [2019-11-28 17:24:26,162 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 17:24:26,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 17:24:26,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 17:24:26,422 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-28 17:24:26,423 INFO L475 BasicCegarLoop]: Counterexample might be feasible [2019-11-28 17:24:26,542 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 28.11 05:24:26 BoogieIcfgContainer [2019-11-28 17:24:26,543 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-11-28 17:24:26,543 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-11-28 17:24:26,543 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-11-28 17:24:26,546 INFO L275 PluginConnector]: Witness Printer initialized [2019-11-28 17:24:26,547 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 05:24:23" (3/4) ... [2019-11-28 17:24:26,551 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2019-11-28 17:24:26,664 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2019-11-28 17:24:26,665 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-11-28 17:24:26,667 INFO L168 Benchmark]: Toolchain (without parser) took 4490.06 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 207.6 MB). Free memory was 957.7 MB in the beginning and 1.2 GB in the end (delta: -203.4 MB). Peak memory consumption was 4.3 MB. Max. memory is 11.5 GB. [2019-11-28 17:24:26,667 INFO L168 Benchmark]: CDTParser took 0.76 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:24:26,668 INFO L168 Benchmark]: CACSL2BoogieTranslator took 628.45 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 132.1 MB). Free memory was 957.7 MB in the beginning and 1.1 GB in the end (delta: -151.5 MB). Peak memory consumption was 26.0 MB. Max. memory is 11.5 GB. [2019-11-28 17:24:26,668 INFO L168 Benchmark]: Boogie Procedure Inliner took 75.42 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.5 MB). Peak memory consumption was 6.5 MB. Max. memory is 11.5 GB. [2019-11-28 17:24:26,669 INFO L168 Benchmark]: Boogie Preprocessor took 44.67 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:24:26,669 INFO L168 Benchmark]: RCFGBuilder took 851.28 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: 49.9 MB). Peak memory consumption was 49.9 MB. Max. memory is 11.5 GB. [2019-11-28 17:24:26,672 INFO L168 Benchmark]: TraceAbstraction took 2763.42 ms. Allocated memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 75.5 MB). Free memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: -123.6 MB). There was no memory consumed. Max. memory is 11.5 GB. [2019-11-28 17:24:26,674 INFO L168 Benchmark]: Witness Printer took 121.50 ms. Allocated memory is still 1.2 GB. Free memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 15.3 MB). Peak memory consumption was 15.3 MB. Max. memory is 11.5 GB. [2019-11-28 17:24:26,676 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.76 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 628.45 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 132.1 MB). Free memory was 957.7 MB in the beginning and 1.1 GB in the end (delta: -151.5 MB). Peak memory consumption was 26.0 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 75.42 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.5 MB). Peak memory consumption was 6.5 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 44.67 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. * RCFGBuilder took 851.28 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: 49.9 MB). Peak memory consumption was 49.9 MB. Max. memory is 11.5 GB. * TraceAbstraction took 2763.42 ms. Allocated memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 75.5 MB). Free memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: -123.6 MB). There was no memory consumed. Max. memory is 11.5 GB. * Witness Printer took 121.50 ms. Allocated memory is still 1.2 GB. Free memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 15.3 MB). Peak memory consumption was 15.3 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 145]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L47] int waterLevel = 1; [L48] int methaneLevelCritical = 0; [L250] int pumpRunning = 0; [L251] int systemActive = 1; [L455] int cleanupTimeShifts = 4; [L720] static struct __ACC__ERR *head = (struct __ACC__ERR *)0; VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=0, systemActive=1, waterLevel=1] [L528] int retValue_acc ; [L529] int tmp ; VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=0, systemActive=1, waterLevel=1] [L446] int retValue_acc ; [L449] retValue_acc = 1 [L450] return (retValue_acc); VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=0, systemActive=1, waterLevel=1] [L535] tmp = valid_product() [L537] COND TRUE \read(tmp) VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=0, systemActive=1, waterLevel=1] [L181] int splverifierCounter ; [L182] int tmp ; [L183] int tmp___0 ; [L184] int tmp___1 ; [L185] int tmp___2 ; [L188] splverifierCounter = 0 VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=0, systemActive=1, waterLevel=1] [L190] COND TRUE 1 VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=0, systemActive=1, waterLevel=1] [L192] COND TRUE splverifierCounter < 4 VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=0, systemActive=1, waterLevel=1] [L198] tmp = __VERIFIER_nondet_int() [L200] COND TRUE \read(tmp) VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=0, systemActive=1, waterLevel=1] [L65] COND TRUE waterLevel < 2 [L66] waterLevel = waterLevel + 1 VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=0, systemActive=1, waterLevel=2] [L208] tmp___0 = __VERIFIER_nondet_int() [L210] COND TRUE \read(tmp___0) VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=0, systemActive=1, waterLevel=2] [L77] COND FALSE !(\read(methaneLevelCritical)) [L80] methaneLevelCritical = 1 VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=1, pumpRunning=0, systemActive=1, waterLevel=2] [L218] tmp___2 = __VERIFIER_nondet_int() [L220] COND TRUE \read(tmp___2) VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=1, pumpRunning=0, systemActive=1, waterLevel=2] [L257] COND FALSE !(\read(pumpRunning)) VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=1, pumpRunning=0, systemActive=1, waterLevel=2] [L264] COND TRUE \read(systemActive) [L286] int tmp ; VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=1, pumpRunning=0, systemActive=1, waterLevel=2] [L289] COND TRUE ! pumpRunning [L383] int retValue_acc ; [L384] int tmp ; [L385] int tmp___0 ; [L127] int retValue_acc ; VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=1, pumpRunning=0, systemActive=1, waterLevel=2] [L130] COND FALSE !(waterLevel < 2) [L134] retValue_acc = 0 [L135] return (retValue_acc); VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=1, pumpRunning=0, systemActive=1, waterLevel=2] [L389] tmp = isHighWaterSensorDry() [L391] COND FALSE !(\read(tmp)) [L394] tmp___0 = 1 VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=1, pumpRunning=0, systemActive=1, waterLevel=2] [L396] retValue_acc = tmp___0 [L397] return (retValue_acc); VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=1, pumpRunning=0, systemActive=1, waterLevel=2] [L291] tmp = isHighWaterLevel() [L293] COND TRUE \read(tmp) [L314] pumpRunning = 1 VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=1, pumpRunning=1, systemActive=1, waterLevel=2] [L152] int tmp ; [L153] int tmp___0 ; [L86] int retValue_acc ; [L89] retValue_acc = methaneLevelCritical [L90] return (retValue_acc); VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=1, pumpRunning=1, systemActive=1, waterLevel=2] [L157] tmp = isMethaneLevelCritical() [L159] COND TRUE \read(tmp) [L338] int retValue_acc ; [L341] retValue_acc = pumpRunning [L342] return (retValue_acc); VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=1, pumpRunning=1, systemActive=1, waterLevel=2] [L161] tmp___0 = isPumpRunning() [L163] COND TRUE \read(tmp___0) VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=1, pumpRunning=1, systemActive=1, waterLevel=2] [L145] __VERIFIER_error() VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=1, pumpRunning=1, systemActive=1, waterLevel=2] - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 80 locations, 3 error locations. Result: UNSAFE, OverallTime: 2.5s, OverallIterations: 10, TraceHistogramMax: 1, AutomataDifference: 0.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 624 SDtfs, 977 SDslu, 1094 SDs, 0 SdLazy, 129 SolverSat, 22 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.2s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 55 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=230occurred in iteration=9, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.2s AutomataMinimizationTime, 9 MinimizatonAttempts, 704 StatesRemovedByMinimization, 6 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 0.6s InterpolantComputationTime, 250 NumberOfCodeBlocks, 250 NumberOfCodeBlocksAsserted, 10 NumberOfCheckSat, 210 ConstructedInterpolants, 0 QuantifiedInterpolants, 10475 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 9 InterpolantComputations, 9 PerfectInterpolantSequences, 0/0 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...