./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/product-lines/minepump_spec1_product51.cil.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 30f4e4ab 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_product51.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 0d6f6f11832d8f580d186172cf5d58d3f276ea91 ........................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... 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.24-30f4e4a [2019-11-28 00:20:22,823 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-28 00:20:22,825 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-28 00:20:22,842 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-28 00:20:22,842 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-28 00:20:22,844 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-28 00:20:22,846 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-28 00:20:22,855 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-28 00:20:22,860 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-28 00:20:22,864 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-28 00:20:22,866 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-28 00:20:22,868 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-28 00:20:22,868 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-28 00:20:22,871 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-28 00:20:22,872 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-28 00:20:22,873 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-28 00:20:22,875 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-28 00:20:22,876 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-28 00:20:22,878 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-28 00:20:22,882 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-28 00:20:22,887 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-28 00:20:22,890 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-28 00:20:22,893 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-28 00:20:22,894 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-28 00:20:22,898 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-28 00:20:22,898 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-28 00:20:22,898 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-28 00:20:22,900 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-28 00:20:22,900 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-28 00:20:22,901 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-28 00:20:22,902 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-28 00:20:22,903 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-28 00:20:22,903 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-28 00:20:22,905 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-28 00:20:22,906 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-28 00:20:22,906 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-28 00:20:22,907 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-28 00:20:22,908 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-28 00:20:22,908 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-28 00:20:22,909 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-28 00:20:22,910 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-28 00:20:22,911 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2019-11-28 00:20:22,948 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-28 00:20:22,951 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-28 00:20:22,952 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-28 00:20:22,953 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-28 00:20:22,953 INFO L138 SettingsManager]: * Use SBE=true [2019-11-28 00:20:22,954 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-28 00:20:22,954 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-28 00:20:22,956 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-28 00:20:22,956 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-28 00:20:22,956 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-28 00:20:22,956 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-11-28 00:20:22,957 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-28 00:20:22,957 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-11-28 00:20:22,957 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-28 00:20:22,957 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-28 00:20:22,957 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-28 00:20:22,958 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-11-28 00:20:22,958 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-28 00:20:22,958 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-28 00:20:22,958 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-28 00:20:22,958 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-11-28 00:20:22,959 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-28 00:20:22,959 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-28 00:20:22,959 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-28 00:20:22,959 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-11-28 00:20:22,959 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-11-28 00:20:22,960 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-11-28 00:20:22,960 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-11-28 00:20:22,960 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 -> 0d6f6f11832d8f580d186172cf5d58d3f276ea91 [2019-11-28 00:20:23,248 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-28 00:20:23,261 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-28 00:20:23,264 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-28 00:20:23,265 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-28 00:20:23,266 INFO L275 PluginConnector]: CDTParser initialized [2019-11-28 00:20:23,267 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/product-lines/minepump_spec1_product51.cil.c [2019-11-28 00:20:23,337 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5c31cfab3/1039605660b44c9a8e83c976c7c3c92f/FLAG7c718de1f [2019-11-28 00:20:23,810 INFO L306 CDTParser]: Found 1 translation units. [2019-11-28 00:20:23,811 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/product-lines/minepump_spec1_product51.cil.c [2019-11-28 00:20:23,829 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5c31cfab3/1039605660b44c9a8e83c976c7c3c92f/FLAG7c718de1f [2019-11-28 00:20:24,132 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5c31cfab3/1039605660b44c9a8e83c976c7c3c92f [2019-11-28 00:20:24,136 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-28 00:20:24,137 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-11-28 00:20:24,138 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-28 00:20:24,139 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-28 00:20:24,142 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-28 00:20:24,143 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 12:20:24" (1/1) ... [2019-11-28 00:20:24,146 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@21aba202 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 12:20:24, skipping insertion in model container [2019-11-28 00:20:24,146 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 12:20:24" (1/1) ... [2019-11-28 00:20:24,153 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-11-28 00:20:24,209 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-11-28 00:20:24,616 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-28 00:20:24,628 INFO L203 MainTranslator]: Completed pre-run [2019-11-28 00:20:24,707 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-28 00:20:24,756 INFO L208 MainTranslator]: Completed translation [2019-11-28 00:20:24,756 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 12:20:24 WrapperNode [2019-11-28 00:20:24,756 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-28 00:20:24,757 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-11-28 00:20:24,758 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-11-28 00:20:24,758 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-11-28 00:20:24,766 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 12:20:24" (1/1) ... [2019-11-28 00:20:24,787 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 12:20:24" (1/1) ... [2019-11-28 00:20:24,830 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-11-28 00:20:24,831 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-28 00:20:24,831 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-28 00:20:24,831 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-28 00:20:24,841 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 12:20:24" (1/1) ... [2019-11-28 00:20:24,841 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 12:20:24" (1/1) ... [2019-11-28 00:20:24,846 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 12:20:24" (1/1) ... [2019-11-28 00:20:24,847 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 12:20:24" (1/1) ... [2019-11-28 00:20:24,859 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 12:20:24" (1/1) ... [2019-11-28 00:20:24,868 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 12:20:24" (1/1) ... [2019-11-28 00:20:24,872 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 12:20:24" (1/1) ... [2019-11-28 00:20:24,877 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-28 00:20:24,877 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-28 00:20:24,877 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-28 00:20:24,878 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-28 00:20:24,879 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 12:20:24" (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 00:20:24,965 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-11-28 00:20:24,966 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2019-11-28 00:20:24,967 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-28 00:20:24,967 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-28 00:20:25,908 INFO L292 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-28 00:20:25,908 INFO L297 CfgBuilder]: Removed 160 assume(true) statements. [2019-11-28 00:20:25,910 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 12:20:25 BoogieIcfgContainer [2019-11-28 00:20:25,910 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-28 00:20:25,911 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-11-28 00:20:25,911 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-11-28 00:20:25,914 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-11-28 00:20:25,915 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 28.11 12:20:24" (1/3) ... [2019-11-28 00:20:25,916 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@a628ff4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.11 12:20:25, skipping insertion in model container [2019-11-28 00:20:25,916 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 12:20:24" (2/3) ... [2019-11-28 00:20:25,916 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@a628ff4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.11 12:20:25, skipping insertion in model container [2019-11-28 00:20:25,917 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 12:20:25" (3/3) ... [2019-11-28 00:20:25,918 INFO L109 eAbstractionObserver]: Analyzing ICFG minepump_spec1_product51.cil.c [2019-11-28 00:20:25,929 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-11-28 00:20:25,937 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 3 error locations. [2019-11-28 00:20:25,949 INFO L249 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2019-11-28 00:20:25,969 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-11-28 00:20:25,969 INFO L374 AbstractCegarLoop]: Hoare is true [2019-11-28 00:20:25,970 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-11-28 00:20:25,970 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-28 00:20:25,970 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-28 00:20:25,970 INFO L378 AbstractCegarLoop]: Difference is false [2019-11-28 00:20:25,970 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-28 00:20:25,971 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-11-28 00:20:25,988 INFO L276 IsEmpty]: Start isEmpty. Operand 119 states. [2019-11-28 00:20:25,995 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-11-28 00:20:25,995 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 00:20:25,996 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 00:20:25,997 INFO L410 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 00:20:26,002 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 00:20:26,003 INFO L82 PathProgramCache]: Analyzing trace with hash 1844308238, now seen corresponding path program 1 times [2019-11-28 00:20:26,012 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 00:20:26,013 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [489909451] [2019-11-28 00:20:26,013 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 00:20:26,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:20:26,310 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 00:20:26,311 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [489909451] [2019-11-28 00:20:26,312 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 00:20:26,312 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-28 00:20:26,313 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1575444256] [2019-11-28 00:20:26,318 INFO L442 AbstractCegarLoop]: Interpolant automaton has 2 states [2019-11-28 00:20:26,318 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 00:20:26,330 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2019-11-28 00:20:26,330 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-11-28 00:20:26,332 INFO L87 Difference]: Start difference. First operand 119 states. Second operand 2 states. [2019-11-28 00:20:26,365 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 00:20:26,365 INFO L93 Difference]: Finished difference Result 232 states and 353 transitions. [2019-11-28 00:20:26,365 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2019-11-28 00:20:26,367 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 16 [2019-11-28 00:20:26,367 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 00:20:26,379 INFO L225 Difference]: With dead ends: 232 [2019-11-28 00:20:26,380 INFO L226 Difference]: Without dead ends: 115 [2019-11-28 00:20:26,384 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 00:20:26,400 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 115 states. [2019-11-28 00:20:26,423 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 115 to 115. [2019-11-28 00:20:26,425 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 115 states. [2019-11-28 00:20:26,427 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 115 states to 115 states and 168 transitions. [2019-11-28 00:20:26,429 INFO L78 Accepts]: Start accepts. Automaton has 115 states and 168 transitions. Word has length 16 [2019-11-28 00:20:26,429 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 00:20:26,429 INFO L462 AbstractCegarLoop]: Abstraction has 115 states and 168 transitions. [2019-11-28 00:20:26,430 INFO L463 AbstractCegarLoop]: Interpolant automaton has 2 states. [2019-11-28 00:20:26,430 INFO L276 IsEmpty]: Start isEmpty. Operand 115 states and 168 transitions. [2019-11-28 00:20:26,431 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-11-28 00:20:26,431 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 00:20:26,431 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 00:20:26,432 INFO L410 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 00:20:26,432 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 00:20:26,432 INFO L82 PathProgramCache]: Analyzing trace with hash -323074868, now seen corresponding path program 1 times [2019-11-28 00:20:26,432 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 00:20:26,433 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1464373957] [2019-11-28 00:20:26,433 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 00:20:26,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:20:26,559 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 00:20:26,560 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1464373957] [2019-11-28 00:20:26,560 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 00:20:26,560 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-28 00:20:26,560 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1961800779] [2019-11-28 00:20:26,562 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-28 00:20:26,562 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 00:20:26,563 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-28 00:20:26,563 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 00:20:26,563 INFO L87 Difference]: Start difference. First operand 115 states and 168 transitions. Second operand 3 states. [2019-11-28 00:20:26,577 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 00:20:26,577 INFO L93 Difference]: Finished difference Result 115 states and 168 transitions. [2019-11-28 00:20:26,578 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-28 00:20:26,578 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 17 [2019-11-28 00:20:26,578 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 00:20:26,579 INFO L225 Difference]: With dead ends: 115 [2019-11-28 00:20:26,579 INFO L226 Difference]: Without dead ends: 49 [2019-11-28 00:20:26,581 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 00:20:26,581 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2019-11-28 00:20:26,586 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 49. [2019-11-28 00:20:26,586 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 49 states. [2019-11-28 00:20:26,587 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 71 transitions. [2019-11-28 00:20:26,588 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 71 transitions. Word has length 17 [2019-11-28 00:20:26,588 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 00:20:26,588 INFO L462 AbstractCegarLoop]: Abstraction has 49 states and 71 transitions. [2019-11-28 00:20:26,588 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-28 00:20:26,588 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 71 transitions. [2019-11-28 00:20:26,589 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-11-28 00:20:26,589 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 00:20:26,590 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 00:20:26,590 INFO L410 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 00:20:26,590 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 00:20:26,590 INFO L82 PathProgramCache]: Analyzing trace with hash -426243093, now seen corresponding path program 1 times [2019-11-28 00:20:26,591 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 00:20:26,591 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [717854570] [2019-11-28 00:20:26,591 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 00:20:26,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:20:26,676 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 00:20:26,676 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [717854570] [2019-11-28 00:20:26,677 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 00:20:26,677 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-28 00:20:26,677 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1189171215] [2019-11-28 00:20:26,678 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-28 00:20:26,678 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 00:20:26,678 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-28 00:20:26,679 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 00:20:26,679 INFO L87 Difference]: Start difference. First operand 49 states and 71 transitions. Second operand 3 states. [2019-11-28 00:20:26,715 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 00:20:26,716 INFO L93 Difference]: Finished difference Result 135 states and 201 transitions. [2019-11-28 00:20:26,719 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-28 00:20:26,719 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 22 [2019-11-28 00:20:26,719 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 00:20:26,721 INFO L225 Difference]: With dead ends: 135 [2019-11-28 00:20:26,721 INFO L226 Difference]: Without dead ends: 92 [2019-11-28 00:20:26,721 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 00:20:26,723 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92 states. [2019-11-28 00:20:26,744 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92 to 88. [2019-11-28 00:20:26,744 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 88 states. [2019-11-28 00:20:26,747 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 131 transitions. [2019-11-28 00:20:26,747 INFO L78 Accepts]: Start accepts. Automaton has 88 states and 131 transitions. Word has length 22 [2019-11-28 00:20:26,748 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 00:20:26,749 INFO L462 AbstractCegarLoop]: Abstraction has 88 states and 131 transitions. [2019-11-28 00:20:26,749 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-28 00:20:26,749 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 131 transitions. [2019-11-28 00:20:26,750 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2019-11-28 00:20:26,750 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 00:20:26,750 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] [2019-11-28 00:20:26,751 INFO L410 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 00:20:26,751 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 00:20:26,751 INFO L82 PathProgramCache]: Analyzing trace with hash 844046893, now seen corresponding path program 1 times [2019-11-28 00:20:26,751 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 00:20:26,752 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1965442805] [2019-11-28 00:20:26,752 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 00:20:26,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:20:26,847 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 00:20:26,848 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1965442805] [2019-11-28 00:20:26,848 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 00:20:26,848 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-28 00:20:26,848 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2043631351] [2019-11-28 00:20:26,849 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-28 00:20:26,849 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 00:20:26,849 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-28 00:20:26,850 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 00:20:26,850 INFO L87 Difference]: Start difference. First operand 88 states and 131 transitions. Second operand 3 states. [2019-11-28 00:20:26,934 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 00:20:26,934 INFO L93 Difference]: Finished difference Result 211 states and 318 transitions. [2019-11-28 00:20:26,934 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-28 00:20:26,934 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 24 [2019-11-28 00:20:26,935 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 00:20:26,936 INFO L225 Difference]: With dead ends: 211 [2019-11-28 00:20:26,936 INFO L226 Difference]: Without dead ends: 129 [2019-11-28 00:20:26,937 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 00:20:26,938 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 129 states. [2019-11-28 00:20:26,953 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 129 to 127. [2019-11-28 00:20:26,953 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 127 states. [2019-11-28 00:20:26,954 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 127 states to 127 states and 185 transitions. [2019-11-28 00:20:26,954 INFO L78 Accepts]: Start accepts. Automaton has 127 states and 185 transitions. Word has length 24 [2019-11-28 00:20:26,955 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 00:20:26,955 INFO L462 AbstractCegarLoop]: Abstraction has 127 states and 185 transitions. [2019-11-28 00:20:26,955 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-28 00:20:26,955 INFO L276 IsEmpty]: Start isEmpty. Operand 127 states and 185 transitions. [2019-11-28 00:20:26,960 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-11-28 00:20:26,961 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 00:20:26,962 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 00:20:26,962 INFO L410 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 00:20:26,962 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 00:20:26,963 INFO L82 PathProgramCache]: Analyzing trace with hash -1604149312, now seen corresponding path program 1 times [2019-11-28 00:20:26,963 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 00:20:26,963 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1047874615] [2019-11-28 00:20:26,964 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 00:20:27,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:20:27,081 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 00:20:27,081 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1047874615] [2019-11-28 00:20:27,082 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 00:20:27,082 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-28 00:20:27,082 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1945906838] [2019-11-28 00:20:27,083 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-28 00:20:27,084 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 00:20:27,084 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-28 00:20:27,085 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-28 00:20:27,085 INFO L87 Difference]: Start difference. First operand 127 states and 185 transitions. Second operand 5 states. [2019-11-28 00:20:27,224 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 00:20:27,225 INFO L93 Difference]: Finished difference Result 683 states and 1014 transitions. [2019-11-28 00:20:27,225 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-11-28 00:20:27,226 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 25 [2019-11-28 00:20:27,226 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 00:20:27,231 INFO L225 Difference]: With dead ends: 683 [2019-11-28 00:20:27,232 INFO L226 Difference]: Without dead ends: 562 [2019-11-28 00:20:27,236 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 00:20:27,238 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 562 states. [2019-11-28 00:20:27,277 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 562 to 238. [2019-11-28 00:20:27,278 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 238 states. [2019-11-28 00:20:27,279 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 238 states to 238 states and 343 transitions. [2019-11-28 00:20:27,279 INFO L78 Accepts]: Start accepts. Automaton has 238 states and 343 transitions. Word has length 25 [2019-11-28 00:20:27,280 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 00:20:27,280 INFO L462 AbstractCegarLoop]: Abstraction has 238 states and 343 transitions. [2019-11-28 00:20:27,280 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-28 00:20:27,280 INFO L276 IsEmpty]: Start isEmpty. Operand 238 states and 343 transitions. [2019-11-28 00:20:27,282 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2019-11-28 00:20:27,283 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 00:20:27,283 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 00:20:27,283 INFO L410 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 00:20:27,284 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 00:20:27,284 INFO L82 PathProgramCache]: Analyzing trace with hash -1807956406, now seen corresponding path program 1 times [2019-11-28 00:20:27,284 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 00:20:27,285 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1668709346] [2019-11-28 00:20:27,285 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 00:20:27,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:20:27,362 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 00:20:27,362 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1668709346] [2019-11-28 00:20:27,363 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 00:20:27,363 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-28 00:20:27,363 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [320316952] [2019-11-28 00:20:27,364 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-28 00:20:27,364 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 00:20:27,364 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-28 00:20:27,365 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-28 00:20:27,365 INFO L87 Difference]: Start difference. First operand 238 states and 343 transitions. Second operand 5 states. [2019-11-28 00:20:27,518 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 00:20:27,518 INFO L93 Difference]: Finished difference Result 684 states and 990 transitions. [2019-11-28 00:20:27,519 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-11-28 00:20:27,519 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 26 [2019-11-28 00:20:27,520 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 00:20:27,524 INFO L225 Difference]: With dead ends: 684 [2019-11-28 00:20:27,524 INFO L226 Difference]: Without dead ends: 682 [2019-11-28 00:20:27,525 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 00:20:27,526 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 682 states. [2019-11-28 00:20:27,544 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 682 to 238. [2019-11-28 00:20:27,545 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 238 states. [2019-11-28 00:20:27,546 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 238 states to 238 states and 341 transitions. [2019-11-28 00:20:27,547 INFO L78 Accepts]: Start accepts. Automaton has 238 states and 341 transitions. Word has length 26 [2019-11-28 00:20:27,547 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 00:20:27,547 INFO L462 AbstractCegarLoop]: Abstraction has 238 states and 341 transitions. [2019-11-28 00:20:27,547 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-28 00:20:27,548 INFO L276 IsEmpty]: Start isEmpty. Operand 238 states and 341 transitions. [2019-11-28 00:20:27,549 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2019-11-28 00:20:27,549 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 00:20:27,550 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 00:20:27,550 INFO L410 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 00:20:27,550 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 00:20:27,551 INFO L82 PathProgramCache]: Analyzing trace with hash 1131451540, now seen corresponding path program 1 times [2019-11-28 00:20:27,551 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 00:20:27,551 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2078358544] [2019-11-28 00:20:27,552 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 00:20:27,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:20:27,604 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 00:20:27,604 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2078358544] [2019-11-28 00:20:27,605 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 00:20:27,605 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-28 00:20:27,605 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1823052706] [2019-11-28 00:20:27,605 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-28 00:20:27,606 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 00:20:27,606 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-28 00:20:27,606 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-28 00:20:27,606 INFO L87 Difference]: Start difference. First operand 238 states and 341 transitions. Second operand 5 states. [2019-11-28 00:20:27,704 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 00:20:27,704 INFO L93 Difference]: Finished difference Result 650 states and 916 transitions. [2019-11-28 00:20:27,705 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-28 00:20:27,705 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 31 [2019-11-28 00:20:27,705 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 00:20:27,708 INFO L225 Difference]: With dead ends: 650 [2019-11-28 00:20:27,708 INFO L226 Difference]: Without dead ends: 418 [2019-11-28 00:20:27,709 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 00:20:27,710 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 418 states. [2019-11-28 00:20:27,729 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 418 to 262. [2019-11-28 00:20:27,730 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 262 states. [2019-11-28 00:20:27,731 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 262 states to 262 states and 365 transitions. [2019-11-28 00:20:27,731 INFO L78 Accepts]: Start accepts. Automaton has 262 states and 365 transitions. Word has length 31 [2019-11-28 00:20:27,731 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 00:20:27,732 INFO L462 AbstractCegarLoop]: Abstraction has 262 states and 365 transitions. [2019-11-28 00:20:27,732 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-28 00:20:27,732 INFO L276 IsEmpty]: Start isEmpty. Operand 262 states and 365 transitions. [2019-11-28 00:20:27,733 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2019-11-28 00:20:27,734 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 00:20:27,734 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 00:20:27,734 INFO L410 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 00:20:27,734 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 00:20:27,735 INFO L82 PathProgramCache]: Analyzing trace with hash 738424530, now seen corresponding path program 1 times [2019-11-28 00:20:27,735 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 00:20:27,735 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1247539148] [2019-11-28 00:20:27,736 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 00:20:27,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:20:27,786 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 00:20:27,787 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1247539148] [2019-11-28 00:20:27,787 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 00:20:27,787 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-28 00:20:27,787 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1073739744] [2019-11-28 00:20:27,788 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-28 00:20:27,788 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 00:20:27,788 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-28 00:20:27,788 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-28 00:20:27,789 INFO L87 Difference]: Start difference. First operand 262 states and 365 transitions. Second operand 5 states. [2019-11-28 00:20:27,916 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 00:20:27,917 INFO L93 Difference]: Finished difference Result 734 states and 1001 transitions. [2019-11-28 00:20:27,917 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-11-28 00:20:27,918 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 31 [2019-11-28 00:20:27,918 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 00:20:27,921 INFO L225 Difference]: With dead ends: 734 [2019-11-28 00:20:27,921 INFO L226 Difference]: Without dead ends: 478 [2019-11-28 00:20:27,922 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 5 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 00:20:27,923 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 478 states. [2019-11-28 00:20:27,946 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 478 to 278. [2019-11-28 00:20:27,946 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 278 states. [2019-11-28 00:20:27,948 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 278 states to 278 states and 381 transitions. [2019-11-28 00:20:27,948 INFO L78 Accepts]: Start accepts. Automaton has 278 states and 381 transitions. Word has length 31 [2019-11-28 00:20:27,948 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 00:20:27,949 INFO L462 AbstractCegarLoop]: Abstraction has 278 states and 381 transitions. [2019-11-28 00:20:27,949 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-28 00:20:27,949 INFO L276 IsEmpty]: Start isEmpty. Operand 278 states and 381 transitions. [2019-11-28 00:20:27,950 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2019-11-28 00:20:27,950 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 00:20:27,950 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 00:20:27,951 INFO L410 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 00:20:27,951 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 00:20:27,951 INFO L82 PathProgramCache]: Analyzing trace with hash 996589968, now seen corresponding path program 1 times [2019-11-28 00:20:27,952 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 00:20:27,952 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1278461642] [2019-11-28 00:20:27,952 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 00:20:27,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:20:27,992 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 00:20:27,993 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1278461642] [2019-11-28 00:20:27,993 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 00:20:27,993 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-28 00:20:27,994 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1991459262] [2019-11-28 00:20:27,994 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-28 00:20:27,994 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 00:20:27,994 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-28 00:20:27,995 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 00:20:27,995 INFO L87 Difference]: Start difference. First operand 278 states and 381 transitions. Second operand 3 states. [2019-11-28 00:20:28,085 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 00:20:28,086 INFO L93 Difference]: Finished difference Result 654 states and 890 transitions. [2019-11-28 00:20:28,086 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-28 00:20:28,086 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 31 [2019-11-28 00:20:28,086 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 00:20:28,088 INFO L225 Difference]: With dead ends: 654 [2019-11-28 00:20:28,089 INFO L226 Difference]: Without dead ends: 382 [2019-11-28 00:20:28,089 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 00:20:28,090 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 382 states. [2019-11-28 00:20:28,120 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 382 to 382. [2019-11-28 00:20:28,121 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 382 states. [2019-11-28 00:20:28,122 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 382 states to 382 states and 507 transitions. [2019-11-28 00:20:28,122 INFO L78 Accepts]: Start accepts. Automaton has 382 states and 507 transitions. Word has length 31 [2019-11-28 00:20:28,122 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 00:20:28,123 INFO L462 AbstractCegarLoop]: Abstraction has 382 states and 507 transitions. [2019-11-28 00:20:28,123 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-28 00:20:28,123 INFO L276 IsEmpty]: Start isEmpty. Operand 382 states and 507 transitions. [2019-11-28 00:20:28,127 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2019-11-28 00:20:28,127 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 00:20:28,127 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] [2019-11-28 00:20:28,127 INFO L410 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 00:20:28,128 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 00:20:28,128 INFO L82 PathProgramCache]: Analyzing trace with hash -1116169902, now seen corresponding path program 1 times [2019-11-28 00:20:28,128 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 00:20:28,128 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [776816788] [2019-11-28 00:20:28,128 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 00:20:28,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 00:20:28,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 00:20:28,312 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-28 00:20:28,312 INFO L475 BasicCegarLoop]: Counterexample might be feasible [2019-11-28 00:20:28,401 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 28.11 12:20:28 BoogieIcfgContainer [2019-11-28 00:20:28,401 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-11-28 00:20:28,402 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-11-28 00:20:28,402 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-11-28 00:20:28,402 INFO L275 PluginConnector]: Witness Printer initialized [2019-11-28 00:20:28,402 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 12:20:25" (3/4) ... [2019-11-28 00:20:28,405 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2019-11-28 00:20:28,507 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2019-11-28 00:20:28,508 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-11-28 00:20:28,515 INFO L168 Benchmark]: Toolchain (without parser) took 4372.24 ms. Allocated memory was 1.0 GB in the beginning and 1.3 GB in the end (delta: 241.7 MB). Free memory was 952.3 MB in the beginning and 1.2 GB in the end (delta: -213.4 MB). Peak memory consumption was 28.3 MB. Max. memory is 11.5 GB. [2019-11-28 00:20:28,518 INFO L168 Benchmark]: CDTParser took 0.27 ms. Allocated memory is still 1.0 GB. Free memory is still 981.8 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-28 00:20:28,520 INFO L168 Benchmark]: CACSL2BoogieTranslator took 618.54 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 169.9 MB). Free memory was 952.3 MB in the beginning and 1.2 GB in the end (delta: -201.2 MB). Peak memory consumption was 26.2 MB. Max. memory is 11.5 GB. [2019-11-28 00:20:28,520 INFO L168 Benchmark]: Boogie Procedure Inliner took 72.97 ms. Allocated memory is still 1.2 GB. Free memory was 1.2 GB in the beginning and 1.1 GB in the end (delta: 8.0 MB). Peak memory consumption was 8.0 MB. Max. memory is 11.5 GB. [2019-11-28 00:20:28,522 INFO L168 Benchmark]: Boogie Preprocessor took 46.47 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 00:20:28,523 INFO L168 Benchmark]: RCFGBuilder took 1032.65 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: 68.5 MB). Peak memory consumption was 68.5 MB. Max. memory is 11.5 GB. [2019-11-28 00:20:28,523 INFO L168 Benchmark]: TraceAbstraction took 2490.25 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 71.8 MB). Free memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: -103.6 MB). There was no memory consumed. Max. memory is 11.5 GB. [2019-11-28 00:20:28,524 INFO L168 Benchmark]: Witness Printer took 106.17 ms. Allocated memory is still 1.3 GB. Free memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 14.9 MB). Peak memory consumption was 14.9 MB. Max. memory is 11.5 GB. [2019-11-28 00:20:28,528 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.27 ms. Allocated memory is still 1.0 GB. Free memory is still 981.8 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 618.54 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 169.9 MB). Free memory was 952.3 MB in the beginning and 1.2 GB in the end (delta: -201.2 MB). Peak memory consumption was 26.2 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 72.97 ms. Allocated memory is still 1.2 GB. Free memory was 1.2 GB in the beginning and 1.1 GB in the end (delta: 8.0 MB). Peak memory consumption was 8.0 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 46.47 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 1032.65 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: 68.5 MB). Peak memory consumption was 68.5 MB. Max. memory is 11.5 GB. * TraceAbstraction took 2490.25 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 71.8 MB). Free memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: -103.6 MB). There was no memory consumed. Max. memory is 11.5 GB. * Witness Printer took 106.17 ms. Allocated memory is still 1.3 GB. Free memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 14.9 MB). Peak memory consumption was 14.9 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 704]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L121] int pumpRunning = 0; [L122] int systemActive = 1; [L503] static struct __ACC__ERR *head = (struct __ACC__ERR *)0; [L773] int cleanupTimeShifts = 4; [L870] int waterLevel = 1; [L871] int methaneLevelCritical = 0; VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=0, systemActive=1, waterLevel=1] [L846] int retValue_acc ; [L847] int tmp ; VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=0, systemActive=1, waterLevel=1] [L738] int retValue_acc ; [L741] retValue_acc = 1 [L742] return (retValue_acc); VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=0, systemActive=1, waterLevel=1] [L853] tmp = valid_product() [L855] COND TRUE \read(tmp) VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=0, systemActive=1, waterLevel=1] [L46] int splverifierCounter ; [L47] int tmp ; [L48] int tmp___0 ; [L49] int tmp___1 ; [L50] int tmp___2 ; [L53] splverifierCounter = 0 VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=0, systemActive=1, waterLevel=1] [L55] COND TRUE 1 VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=0, systemActive=1, waterLevel=1] [L57] COND TRUE splverifierCounter < 4 VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=0, systemActive=1, waterLevel=1] [L63] tmp = __VERIFIER_nondet_int() [L65] COND TRUE \read(tmp) VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=0, systemActive=1, waterLevel=1] [L888] COND TRUE waterLevel < 2 [L889] waterLevel = waterLevel + 1 VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=0, systemActive=1, waterLevel=2] [L73] tmp___0 = __VERIFIER_nondet_int() [L75] COND TRUE \read(tmp___0) VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=0, systemActive=1, waterLevel=2] [L900] COND FALSE !(\read(methaneLevelCritical)) [L903] methaneLevelCritical = 1 VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=1, pumpRunning=0, systemActive=1, waterLevel=2] [L83] tmp___2 = __VERIFIER_nondet_int() [L85] COND TRUE \read(tmp___2) VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=1, pumpRunning=0, systemActive=1, waterLevel=2] [L129] COND FALSE !(\read(pumpRunning)) VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=1, pumpRunning=0, systemActive=1, waterLevel=2] [L136] COND TRUE \read(systemActive) [L184] int tmp ; VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=1, pumpRunning=0, systemActive=1, waterLevel=2] [L187] COND FALSE !(\read(pumpRunning)) [L158] int tmp ; VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=1, pumpRunning=0, systemActive=1, waterLevel=2] [L161] COND TRUE ! pumpRunning [L281] int retValue_acc ; [L282] int tmp ; [L283] int tmp___0 ; [L950] int retValue_acc ; VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=1, pumpRunning=0, systemActive=1, waterLevel=2] [L953] COND FALSE !(waterLevel < 2) [L957] retValue_acc = 0 [L958] return (retValue_acc); VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=1, pumpRunning=0, systemActive=1, waterLevel=2] [L287] tmp = isHighWaterSensorDry() [L289] COND FALSE !(\read(tmp)) [L292] tmp___0 = 1 VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=1, pumpRunning=0, systemActive=1, waterLevel=2] [L294] retValue_acc = tmp___0 [L295] return (retValue_acc); VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=1, pumpRunning=0, systemActive=1, waterLevel=2] [L163] tmp = isHighWaterLevel() [L165] COND TRUE \read(tmp) [L212] pumpRunning = 1 VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=1, pumpRunning=1, systemActive=1, waterLevel=2] [L748] int tmp ; [L749] int tmp___0 ; [L909] int retValue_acc ; [L912] retValue_acc = methaneLevelCritical [L913] return (retValue_acc); VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=1, pumpRunning=1, systemActive=1, waterLevel=2] [L753] tmp = isMethaneLevelCritical() [L755] COND TRUE \read(tmp) [L236] int retValue_acc ; [L239] retValue_acc = pumpRunning [L240] return (retValue_acc); VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=1, pumpRunning=1, systemActive=1, waterLevel=2] [L757] tmp___0 = isPumpRunning() [L759] COND TRUE \read(tmp___0) VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=1, pumpRunning=1, systemActive=1, waterLevel=2] [L704] __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, 119 locations, 3 error locations. Result: UNSAFE, OverallTime: 2.3s, OverallIterations: 10, TraceHistogramMax: 1, AutomataDifference: 0.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 875 SDtfs, 1188 SDslu, 1284 SDs, 0 SdLazy, 160 SolverSat, 39 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.2s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 48 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=382occurred 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, 1130 StatesRemovedByMinimization, 6 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 0.4s InterpolantComputationTime, 255 NumberOfCodeBlocks, 255 NumberOfCodeBlocksAsserted, 10 NumberOfCheckSat, 214 ConstructedInterpolants, 0 QuantifiedInterpolants, 11496 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...