./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/product-lines/minepump_spec1_product55.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_product55.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 f98010979adc33ea49508c52e1057d4173359b78 .............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................. 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:24,877 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-28 00:20:24,879 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-28 00:20:24,892 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-28 00:20:24,892 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-28 00:20:24,894 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-28 00:20:24,895 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-28 00:20:24,898 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-28 00:20:24,900 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-28 00:20:24,901 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-28 00:20:24,902 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-28 00:20:24,903 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-28 00:20:24,904 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-28 00:20:24,905 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-28 00:20:24,907 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-28 00:20:24,908 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-28 00:20:24,910 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-28 00:20:24,913 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-28 00:20:24,915 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-28 00:20:24,921 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-28 00:20:24,923 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-28 00:20:24,926 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-28 00:20:24,928 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-28 00:20:24,928 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-28 00:20:24,933 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-28 00:20:24,933 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-28 00:20:24,933 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-28 00:20:24,935 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-28 00:20:24,936 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-28 00:20:24,938 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-28 00:20:24,938 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-28 00:20:24,939 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-28 00:20:24,940 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-28 00:20:24,940 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-28 00:20:24,945 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-28 00:20:24,945 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-28 00:20:24,946 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-28 00:20:24,946 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-28 00:20:24,946 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-28 00:20:24,950 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-28 00:20:24,952 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-28 00:20:24,953 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:24,976 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-28 00:20:24,976 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-28 00:20:24,978 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-28 00:20:24,978 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-28 00:20:24,979 INFO L138 SettingsManager]: * Use SBE=true [2019-11-28 00:20:24,979 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-28 00:20:24,979 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-28 00:20:24,979 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-28 00:20:24,980 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-28 00:20:24,980 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-28 00:20:24,981 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-11-28 00:20:24,981 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-28 00:20:24,981 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-11-28 00:20:24,982 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-28 00:20:24,982 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-28 00:20:24,982 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-28 00:20:24,982 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-11-28 00:20:24,983 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-28 00:20:24,983 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-28 00:20:24,983 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-28 00:20:24,983 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-11-28 00:20:24,983 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-28 00:20:24,984 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-28 00:20:24,984 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-28 00:20:24,984 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-11-28 00:20:24,984 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-11-28 00:20:24,985 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-11-28 00:20:24,985 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-11-28 00:20:24,985 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 -> f98010979adc33ea49508c52e1057d4173359b78 [2019-11-28 00:20:25,304 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-28 00:20:25,318 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-28 00:20:25,321 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-28 00:20:25,323 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-28 00:20:25,323 INFO L275 PluginConnector]: CDTParser initialized [2019-11-28 00:20:25,324 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/product-lines/minepump_spec1_product55.cil.c [2019-11-28 00:20:25,408 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/332766c7f/5a0666d1857c44a3a38b11dde3b55411/FLAGc5f6048f4 [2019-11-28 00:20:25,979 INFO L306 CDTParser]: Found 1 translation units. [2019-11-28 00:20:25,979 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/product-lines/minepump_spec1_product55.cil.c [2019-11-28 00:20:25,995 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/332766c7f/5a0666d1857c44a3a38b11dde3b55411/FLAGc5f6048f4 [2019-11-28 00:20:26,261 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/332766c7f/5a0666d1857c44a3a38b11dde3b55411 [2019-11-28 00:20:26,265 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-28 00:20:26,267 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-11-28 00:20:26,269 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-28 00:20:26,269 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-28 00:20:26,273 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-28 00:20:26,274 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 12:20:26" (1/1) ... [2019-11-28 00:20:26,277 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@10a49d1c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 12:20:26, skipping insertion in model container [2019-11-28 00:20:26,278 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 12:20:26" (1/1) ... [2019-11-28 00:20:26,286 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-11-28 00:20:26,337 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-11-28 00:20:26,777 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-28 00:20:26,800 INFO L203 MainTranslator]: Completed pre-run [2019-11-28 00:20:26,896 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-28 00:20:26,938 INFO L208 MainTranslator]: Completed translation [2019-11-28 00:20:26,939 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 12:20:26 WrapperNode [2019-11-28 00:20:26,940 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-28 00:20:26,941 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-11-28 00:20:26,941 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-11-28 00:20:26,941 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-11-28 00:20:26,950 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:26" (1/1) ... [2019-11-28 00:20:26,973 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:26" (1/1) ... [2019-11-28 00:20:27,034 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-11-28 00:20:27,034 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-28 00:20:27,034 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-28 00:20:27,034 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-28 00:20:27,046 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:26" (1/1) ... [2019-11-28 00:20:27,046 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:26" (1/1) ... [2019-11-28 00:20:27,054 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:26" (1/1) ... [2019-11-28 00:20:27,055 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:26" (1/1) ... [2019-11-28 00:20:27,090 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:26" (1/1) ... [2019-11-28 00:20:27,105 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:26" (1/1) ... [2019-11-28 00:20:27,110 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:26" (1/1) ... [2019-11-28 00:20:27,117 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-28 00:20:27,118 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-28 00:20:27,118 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-28 00:20:27,118 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-28 00:20:27,120 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 12:20:26" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-28 00:20:27,212 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-11-28 00:20:27,213 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2019-11-28 00:20:27,213 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-28 00:20:27,213 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-28 00:20:28,242 INFO L292 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-28 00:20:28,243 INFO L297 CfgBuilder]: Removed 280 assume(true) statements. [2019-11-28 00:20:28,244 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 12:20:28 BoogieIcfgContainer [2019-11-28 00:20:28,244 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-28 00:20:28,246 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-11-28 00:20:28,246 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-11-28 00:20:28,250 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-11-28 00:20:28,251 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 28.11 12:20:26" (1/3) ... [2019-11-28 00:20:28,252 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2a6fdcba and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.11 12:20:28, skipping insertion in model container [2019-11-28 00:20:28,252 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 12:20:26" (2/3) ... [2019-11-28 00:20:28,253 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2a6fdcba and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.11 12:20:28, skipping insertion in model container [2019-11-28 00:20:28,253 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 12:20:28" (3/3) ... [2019-11-28 00:20:28,258 INFO L109 eAbstractionObserver]: Analyzing ICFG minepump_spec1_product55.cil.c [2019-11-28 00:20:28,268 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-11-28 00:20:28,278 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 3 error locations. [2019-11-28 00:20:28,291 INFO L249 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2019-11-28 00:20:28,325 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-11-28 00:20:28,325 INFO L374 AbstractCegarLoop]: Hoare is true [2019-11-28 00:20:28,325 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-11-28 00:20:28,326 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-28 00:20:28,326 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-28 00:20:28,326 INFO L378 AbstractCegarLoop]: Difference is false [2019-11-28 00:20:28,326 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-28 00:20:28,327 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-11-28 00:20:28,349 INFO L276 IsEmpty]: Start isEmpty. Operand 191 states. [2019-11-28 00:20:28,356 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-11-28 00:20:28,357 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 00:20:28,358 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:28,358 INFO L410 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 00:20:28,364 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 00:20:28,364 INFO L82 PathProgramCache]: Analyzing trace with hash 1084846627, now seen corresponding path program 1 times [2019-11-28 00:20:28,371 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 00:20:28,372 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1180446626] [2019-11-28 00:20:28,372 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 00:20:28,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:20:28,674 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:28,675 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1180446626] [2019-11-28 00:20:28,676 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 00:20:28,676 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-28 00:20:28,677 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1574947454] [2019-11-28 00:20:28,683 INFO L442 AbstractCegarLoop]: Interpolant automaton has 2 states [2019-11-28 00:20:28,683 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 00:20:28,697 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2019-11-28 00:20:28,699 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-11-28 00:20:28,701 INFO L87 Difference]: Start difference. First operand 191 states. Second operand 2 states. [2019-11-28 00:20:28,750 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 00:20:28,750 INFO L93 Difference]: Finished difference Result 376 states and 575 transitions. [2019-11-28 00:20:28,751 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2019-11-28 00:20:28,752 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 16 [2019-11-28 00:20:28,753 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 00:20:28,768 INFO L225 Difference]: With dead ends: 376 [2019-11-28 00:20:28,768 INFO L226 Difference]: Without dead ends: 187 [2019-11-28 00:20:28,773 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:28,796 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 187 states. [2019-11-28 00:20:28,866 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 187 to 187. [2019-11-28 00:20:28,868 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 187 states. [2019-11-28 00:20:28,877 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 187 states to 187 states and 279 transitions. [2019-11-28 00:20:28,882 INFO L78 Accepts]: Start accepts. Automaton has 187 states and 279 transitions. Word has length 16 [2019-11-28 00:20:28,882 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 00:20:28,882 INFO L462 AbstractCegarLoop]: Abstraction has 187 states and 279 transitions. [2019-11-28 00:20:28,883 INFO L463 AbstractCegarLoop]: Interpolant automaton has 2 states. [2019-11-28 00:20:28,883 INFO L276 IsEmpty]: Start isEmpty. Operand 187 states and 279 transitions. [2019-11-28 00:20:28,886 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-11-28 00:20:28,886 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 00:20:28,887 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:28,887 INFO L410 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 00:20:28,887 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 00:20:28,888 INFO L82 PathProgramCache]: Analyzing trace with hash 38089730, now seen corresponding path program 1 times [2019-11-28 00:20:28,888 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 00:20:28,889 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [711918614] [2019-11-28 00:20:28,889 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 00:20:28,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:20:28,988 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:28,989 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [711918614] [2019-11-28 00:20:28,989 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 00:20:28,989 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-28 00:20:28,992 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [314224576] [2019-11-28 00:20:28,994 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-28 00:20:28,995 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 00:20:28,995 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-28 00:20:28,996 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 00:20:28,996 INFO L87 Difference]: Start difference. First operand 187 states and 279 transitions. Second operand 3 states. [2019-11-28 00:20:29,026 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 00:20:29,026 INFO L93 Difference]: Finished difference Result 187 states and 279 transitions. [2019-11-28 00:20:29,032 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-28 00:20:29,032 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 17 [2019-11-28 00:20:29,032 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 00:20:29,034 INFO L225 Difference]: With dead ends: 187 [2019-11-28 00:20:29,034 INFO L226 Difference]: Without dead ends: 73 [2019-11-28 00:20:29,036 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:29,038 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states. [2019-11-28 00:20:29,046 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 73. [2019-11-28 00:20:29,047 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 73 states. [2019-11-28 00:20:29,048 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 108 transitions. [2019-11-28 00:20:29,048 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 108 transitions. Word has length 17 [2019-11-28 00:20:29,049 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 00:20:29,049 INFO L462 AbstractCegarLoop]: Abstraction has 73 states and 108 transitions. [2019-11-28 00:20:29,049 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-28 00:20:29,049 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 108 transitions. [2019-11-28 00:20:29,050 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-11-28 00:20:29,051 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 00:20:29,051 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:29,051 INFO L410 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 00:20:29,051 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 00:20:29,052 INFO L82 PathProgramCache]: Analyzing trace with hash -1082167242, now seen corresponding path program 1 times [2019-11-28 00:20:29,052 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 00:20:29,052 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [376004574] [2019-11-28 00:20:29,053 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 00:20:29,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:20:29,222 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:29,222 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [376004574] [2019-11-28 00:20:29,222 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 00:20:29,223 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-28 00:20:29,223 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1606659983] [2019-11-28 00:20:29,223 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-28 00:20:29,224 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 00:20:29,224 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-28 00:20:29,225 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-11-28 00:20:29,225 INFO L87 Difference]: Start difference. First operand 73 states and 108 transitions. Second operand 6 states. [2019-11-28 00:20:29,370 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 00:20:29,371 INFO L93 Difference]: Finished difference Result 230 states and 346 transitions. [2019-11-28 00:20:29,372 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-28 00:20:29,372 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 22 [2019-11-28 00:20:29,372 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 00:20:29,375 INFO L225 Difference]: With dead ends: 230 [2019-11-28 00:20:29,375 INFO L226 Difference]: Without dead ends: 163 [2019-11-28 00:20:29,376 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 00:20:29,378 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 163 states. [2019-11-28 00:20:29,391 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 163 to 92. [2019-11-28 00:20:29,391 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 92 states. [2019-11-28 00:20:29,392 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 92 states and 137 transitions. [2019-11-28 00:20:29,392 INFO L78 Accepts]: Start accepts. Automaton has 92 states and 137 transitions. Word has length 22 [2019-11-28 00:20:29,393 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 00:20:29,393 INFO L462 AbstractCegarLoop]: Abstraction has 92 states and 137 transitions. [2019-11-28 00:20:29,393 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-28 00:20:29,394 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 137 transitions. [2019-11-28 00:20:29,395 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-11-28 00:20:29,395 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 00:20:29,395 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:29,396 INFO L410 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 00:20:29,396 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 00:20:29,396 INFO L82 PathProgramCache]: Analyzing trace with hash 1933185311, now seen corresponding path program 1 times [2019-11-28 00:20:29,397 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 00:20:29,397 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1892724043] [2019-11-28 00:20:29,397 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 00:20:29,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:20:29,460 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:29,461 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1892724043] [2019-11-28 00:20:29,461 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 00:20:29,461 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-28 00:20:29,462 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [648629086] [2019-11-28 00:20:29,462 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-28 00:20:29,463 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 00:20:29,464 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-28 00:20:29,464 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 00:20:29,464 INFO L87 Difference]: Start difference. First operand 92 states and 137 transitions. Second operand 3 states. [2019-11-28 00:20:29,531 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 00:20:29,531 INFO L93 Difference]: Finished difference Result 187 states and 280 transitions. [2019-11-28 00:20:29,532 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-28 00:20:29,532 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 25 [2019-11-28 00:20:29,532 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 00:20:29,533 INFO L225 Difference]: With dead ends: 187 [2019-11-28 00:20:29,533 INFO L226 Difference]: Without dead ends: 101 [2019-11-28 00:20:29,534 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:29,535 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101 states. [2019-11-28 00:20:29,558 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101 to 99. [2019-11-28 00:20:29,558 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 99 states. [2019-11-28 00:20:29,559 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 141 transitions. [2019-11-28 00:20:29,559 INFO L78 Accepts]: Start accepts. Automaton has 99 states and 141 transitions. Word has length 25 [2019-11-28 00:20:29,559 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 00:20:29,559 INFO L462 AbstractCegarLoop]: Abstraction has 99 states and 141 transitions. [2019-11-28 00:20:29,560 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-28 00:20:29,560 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 141 transitions. [2019-11-28 00:20:29,561 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-11-28 00:20:29,561 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 00:20:29,561 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:29,561 INFO L410 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 00:20:29,562 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 00:20:29,562 INFO L82 PathProgramCache]: Analyzing trace with hash 2034893835, now seen corresponding path program 1 times [2019-11-28 00:20:29,562 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 00:20:29,563 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2013799463] [2019-11-28 00:20:29,563 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 00:20:29,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:20:29,641 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:29,641 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2013799463] [2019-11-28 00:20:29,642 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 00:20:29,642 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-28 00:20:29,642 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [205995934] [2019-11-28 00:20:29,643 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-28 00:20:29,643 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 00:20:29,643 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-28 00:20:29,643 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-28 00:20:29,643 INFO L87 Difference]: Start difference. First operand 99 states and 141 transitions. Second operand 5 states. [2019-11-28 00:20:29,871 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 00:20:29,871 INFO L93 Difference]: Finished difference Result 281 states and 403 transitions. [2019-11-28 00:20:29,871 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-11-28 00:20:29,872 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 25 [2019-11-28 00:20:29,872 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 00:20:29,874 INFO L225 Difference]: With dead ends: 281 [2019-11-28 00:20:29,874 INFO L226 Difference]: Without dead ends: 279 [2019-11-28 00:20:29,879 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:29,880 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 279 states. [2019-11-28 00:20:29,908 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 279 to 99. [2019-11-28 00:20:29,909 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 99 states. [2019-11-28 00:20:29,910 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 139 transitions. [2019-11-28 00:20:29,910 INFO L78 Accepts]: Start accepts. Automaton has 99 states and 139 transitions. Word has length 25 [2019-11-28 00:20:29,910 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 00:20:29,911 INFO L462 AbstractCegarLoop]: Abstraction has 99 states and 139 transitions. [2019-11-28 00:20:29,911 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-28 00:20:29,911 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 139 transitions. [2019-11-28 00:20:29,913 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2019-11-28 00:20:29,913 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 00:20:29,914 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:29,914 INFO L410 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 00:20:29,914 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 00:20:29,915 INFO L82 PathProgramCache]: Analyzing trace with hash -899676752, now seen corresponding path program 1 times [2019-11-28 00:20:29,915 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 00:20:29,916 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1300968648] [2019-11-28 00:20:29,916 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 00:20:29,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:20:30,021 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:30,022 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1300968648] [2019-11-28 00:20:30,022 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 00:20:30,022 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-28 00:20:30,023 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2003086151] [2019-11-28 00:20:30,024 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-28 00:20:30,024 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 00:20:30,025 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-28 00:20:30,026 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-28 00:20:30,026 INFO L87 Difference]: Start difference. First operand 99 states and 139 transitions. Second operand 5 states. [2019-11-28 00:20:30,144 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 00:20:30,144 INFO L93 Difference]: Finished difference Result 282 states and 395 transitions. [2019-11-28 00:20:30,145 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-28 00:20:30,145 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 31 [2019-11-28 00:20:30,146 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 00:20:30,147 INFO L225 Difference]: With dead ends: 282 [2019-11-28 00:20:30,148 INFO L226 Difference]: Without dead ends: 189 [2019-11-28 00:20:30,149 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:30,150 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 189 states. [2019-11-28 00:20:30,172 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 189 to 108. [2019-11-28 00:20:30,172 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 108 states. [2019-11-28 00:20:30,173 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 108 states to 108 states and 148 transitions. [2019-11-28 00:20:30,175 INFO L78 Accepts]: Start accepts. Automaton has 108 states and 148 transitions. Word has length 31 [2019-11-28 00:20:30,175 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 00:20:30,176 INFO L462 AbstractCegarLoop]: Abstraction has 108 states and 148 transitions. [2019-11-28 00:20:30,177 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-28 00:20:30,177 INFO L276 IsEmpty]: Start isEmpty. Operand 108 states and 148 transitions. [2019-11-28 00:20:30,184 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2019-11-28 00:20:30,185 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 00:20:30,186 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:30,191 INFO L410 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 00:20:30,192 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 00:20:30,192 INFO L82 PathProgramCache]: Analyzing trace with hash -1292703762, now seen corresponding path program 1 times [2019-11-28 00:20:30,194 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 00:20:30,194 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [628551530] [2019-11-28 00:20:30,195 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 00:20:30,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:20:30,257 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:30,258 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [628551530] [2019-11-28 00:20:30,258 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 00:20:30,258 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-28 00:20:30,258 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [490983207] [2019-11-28 00:20:30,259 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-28 00:20:30,259 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 00:20:30,259 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-28 00:20:30,259 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-28 00:20:30,260 INFO L87 Difference]: Start difference. First operand 108 states and 148 transitions. Second operand 4 states. [2019-11-28 00:20:30,326 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 00:20:30,326 INFO L93 Difference]: Finished difference Result 266 states and 364 transitions. [2019-11-28 00:20:30,327 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-28 00:20:30,327 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 31 [2019-11-28 00:20:30,328 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 00:20:30,329 INFO L225 Difference]: With dead ends: 266 [2019-11-28 00:20:30,329 INFO L226 Difference]: Without dead ends: 164 [2019-11-28 00:20:30,330 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-28 00:20:30,330 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 164 states. [2019-11-28 00:20:30,340 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 164 to 114. [2019-11-28 00:20:30,341 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 114 states. [2019-11-28 00:20:30,341 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 114 states to 114 states and 154 transitions. [2019-11-28 00:20:30,342 INFO L78 Accepts]: Start accepts. Automaton has 114 states and 154 transitions. Word has length 31 [2019-11-28 00:20:30,342 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 00:20:30,342 INFO L462 AbstractCegarLoop]: Abstraction has 114 states and 154 transitions. [2019-11-28 00:20:30,343 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-28 00:20:30,343 INFO L276 IsEmpty]: Start isEmpty. Operand 114 states and 154 transitions. [2019-11-28 00:20:30,344 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2019-11-28 00:20:30,344 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 00:20:30,344 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:30,345 INFO L410 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 00:20:30,345 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 00:20:30,345 INFO L82 PathProgramCache]: Analyzing trace with hash -1034538324, now seen corresponding path program 1 times [2019-11-28 00:20:30,345 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 00:20:30,346 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1212904198] [2019-11-28 00:20:30,346 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 00:20:30,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:20:30,387 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:30,388 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1212904198] [2019-11-28 00:20:30,388 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 00:20:30,389 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-28 00:20:30,389 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [48159511] [2019-11-28 00:20:30,390 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-28 00:20:30,390 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 00:20:30,391 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-28 00:20:30,391 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 00:20:30,391 INFO L87 Difference]: Start difference. First operand 114 states and 154 transitions. Second operand 3 states. [2019-11-28 00:20:30,433 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 00:20:30,433 INFO L93 Difference]: Finished difference Result 269 states and 365 transitions. [2019-11-28 00:20:30,434 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-28 00:20:30,434 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 31 [2019-11-28 00:20:30,434 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 00:20:30,436 INFO L225 Difference]: With dead ends: 269 [2019-11-28 00:20:30,436 INFO L226 Difference]: Without dead ends: 161 [2019-11-28 00:20:30,437 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:30,437 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 161 states. [2019-11-28 00:20:30,455 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 161 to 161. [2019-11-28 00:20:30,456 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 161 states. [2019-11-28 00:20:30,457 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 161 states to 161 states and 214 transitions. [2019-11-28 00:20:30,457 INFO L78 Accepts]: Start accepts. Automaton has 161 states and 214 transitions. Word has length 31 [2019-11-28 00:20:30,458 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 00:20:30,458 INFO L462 AbstractCegarLoop]: Abstraction has 161 states and 214 transitions. [2019-11-28 00:20:30,458 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-28 00:20:30,459 INFO L276 IsEmpty]: Start isEmpty. Operand 161 states and 214 transitions. [2019-11-28 00:20:30,460 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2019-11-28 00:20:30,460 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 00:20:30,460 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:30,461 INFO L410 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 00:20:30,461 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 00:20:30,461 INFO L82 PathProgramCache]: Analyzing trace with hash 1147669102, now seen corresponding path program 1 times [2019-11-28 00:20:30,462 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 00:20:30,462 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [263843185] [2019-11-28 00:20:30,463 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 00:20:30,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:20:30,569 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:30,570 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [263843185] [2019-11-28 00:20:30,571 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 00:20:30,571 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-28 00:20:30,571 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2092887462] [2019-11-28 00:20:30,572 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-28 00:20:30,572 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 00:20:30,572 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-28 00:20:30,573 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-28 00:20:30,573 INFO L87 Difference]: Start difference. First operand 161 states and 214 transitions. Second operand 5 states. [2019-11-28 00:20:30,850 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 00:20:30,851 INFO L93 Difference]: Finished difference Result 818 states and 1098 transitions. [2019-11-28 00:20:30,851 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-11-28 00:20:30,851 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 32 [2019-11-28 00:20:30,852 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 00:20:30,855 INFO L225 Difference]: With dead ends: 818 [2019-11-28 00:20:30,855 INFO L226 Difference]: Without dead ends: 663 [2019-11-28 00:20:30,857 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2019-11-28 00:20:30,858 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 663 states. [2019-11-28 00:20:30,892 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 663 to 304. [2019-11-28 00:20:30,893 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 304 states. [2019-11-28 00:20:30,894 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 304 states to 304 states and 400 transitions. [2019-11-28 00:20:30,894 INFO L78 Accepts]: Start accepts. Automaton has 304 states and 400 transitions. Word has length 32 [2019-11-28 00:20:30,894 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 00:20:30,896 INFO L462 AbstractCegarLoop]: Abstraction has 304 states and 400 transitions. [2019-11-28 00:20:30,896 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-28 00:20:30,896 INFO L276 IsEmpty]: Start isEmpty. Operand 304 states and 400 transitions. [2019-11-28 00:20:30,898 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2019-11-28 00:20:30,899 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 00:20:30,899 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 00:20:30,899 INFO L410 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 00:20:30,899 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 00:20:30,899 INFO L82 PathProgramCache]: Analyzing trace with hash 1539369524, now seen corresponding path program 1 times [2019-11-28 00:20:30,900 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 00:20:30,900 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1823352629] [2019-11-28 00:20:30,900 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 00:20:30,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 00:20:31,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 00:20:31,076 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-28 00:20:31,076 INFO L475 BasicCegarLoop]: Counterexample might be feasible [2019-11-28 00:20:31,247 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 28.11 12:20:31 BoogieIcfgContainer [2019-11-28 00:20:31,248 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-11-28 00:20:31,248 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-11-28 00:20:31,248 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-11-28 00:20:31,249 INFO L275 PluginConnector]: Witness Printer initialized [2019-11-28 00:20:31,249 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:28" (3/4) ... [2019-11-28 00:20:31,253 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2019-11-28 00:20:31,417 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2019-11-28 00:20:31,417 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-11-28 00:20:31,425 INFO L168 Benchmark]: Toolchain (without parser) took 5151.55 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 211.8 MB). Free memory was 960.4 MB in the beginning and 1.1 GB in the end (delta: -154.7 MB). Peak memory consumption was 57.1 MB. Max. memory is 11.5 GB. [2019-11-28 00:20:31,425 INFO L168 Benchmark]: CDTParser took 0.29 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 00:20:31,426 INFO L168 Benchmark]: CACSL2BoogieTranslator took 671.30 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 129.0 MB). Free memory was 960.4 MB in the beginning and 1.1 GB in the end (delta: -150.2 MB). Peak memory consumption was 20.2 MB. Max. memory is 11.5 GB. [2019-11-28 00:20:31,426 INFO L168 Benchmark]: Boogie Procedure Inliner took 93.39 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.7 MB). Peak memory consumption was 6.7 MB. Max. memory is 11.5 GB. [2019-11-28 00:20:31,431 INFO L168 Benchmark]: Boogie Preprocessor took 83.48 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.7 MB). Peak memory consumption was 6.7 MB. Max. memory is 11.5 GB. [2019-11-28 00:20:31,431 INFO L168 Benchmark]: RCFGBuilder took 1126.57 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 85.4 MB). Peak memory consumption was 85.4 MB. Max. memory is 11.5 GB. [2019-11-28 00:20:31,432 INFO L168 Benchmark]: TraceAbstraction took 3001.86 ms. Allocated memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 82.8 MB). Free memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: -118.9 MB). There was no memory consumed. Max. memory is 11.5 GB. [2019-11-28 00:20:31,432 INFO L168 Benchmark]: Witness Printer took 168.88 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: 15.7 MB). Peak memory consumption was 15.7 MB. Max. memory is 11.5 GB. [2019-11-28 00:20:31,438 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.29 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 671.30 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 129.0 MB). Free memory was 960.4 MB in the beginning and 1.1 GB in the end (delta: -150.2 MB). Peak memory consumption was 20.2 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 93.39 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.7 MB). Peak memory consumption was 6.7 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 83.48 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.7 MB). Peak memory consumption was 6.7 MB. Max. memory is 11.5 GB. * RCFGBuilder took 1126.57 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 85.4 MB). Peak memory consumption was 85.4 MB. Max. memory is 11.5 GB. * TraceAbstraction took 3001.86 ms. Allocated memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 82.8 MB). Free memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: -118.9 MB). There was no memory consumed. Max. memory is 11.5 GB. * Witness Printer took 168.88 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: 15.7 MB). Peak memory consumption was 15.7 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 506]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L159] int pumpRunning = 0; [L160] int systemActive = 1; [L399] int waterLevel = 1; [L400] int methaneLevelCritical = 0; [L511] int cleanupTimeShifts = 4; [L802] static struct __ACC__ERR *head = (struct __ACC__ERR *)0; VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=0, systemActive=1, waterLevel=1] [L584] int retValue_acc ; [L585] int tmp ; VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=0, systemActive=1, waterLevel=1] [L69] int retValue_acc ; [L72] retValue_acc = 1 [L73] return (retValue_acc); VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=0, systemActive=1, waterLevel=1] [L591] tmp = valid_product() [L593] COND TRUE \read(tmp) VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=0, systemActive=1, waterLevel=1] [L84] int splverifierCounter ; [L85] int tmp ; [L86] int tmp___0 ; [L87] int tmp___1 ; [L88] int tmp___2 ; [L91] splverifierCounter = 0 VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=0, systemActive=1, waterLevel=1] [L93] COND TRUE 1 VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=0, systemActive=1, waterLevel=1] [L95] COND TRUE splverifierCounter < 4 VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=0, systemActive=1, waterLevel=1] [L101] tmp = __VERIFIER_nondet_int() [L103] COND TRUE \read(tmp) VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=0, systemActive=1, waterLevel=1] [L417] COND TRUE waterLevel < 2 [L418] waterLevel = waterLevel + 1 VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=0, systemActive=1, waterLevel=2] [L111] tmp___0 = __VERIFIER_nondet_int() [L113] COND TRUE \read(tmp___0) VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=0, systemActive=1, waterLevel=2] [L429] COND FALSE !(\read(methaneLevelCritical)) [L432] methaneLevelCritical = 1 VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=1, pumpRunning=0, systemActive=1, waterLevel=2] [L121] tmp___2 = __VERIFIER_nondet_int() [L123] COND TRUE \read(tmp___2) VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=1, pumpRunning=0, systemActive=1, waterLevel=2] [L167] COND FALSE !(\read(pumpRunning)) VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=1, pumpRunning=0, systemActive=1, waterLevel=2] [L174] COND TRUE \read(systemActive) [L248] int tmp ; VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=1, pumpRunning=0, systemActive=1, waterLevel=2] [L251] COND FALSE !(\read(pumpRunning)) [L222] int tmp ; VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=1, pumpRunning=0, systemActive=1, waterLevel=2] [L225] COND FALSE !(\read(pumpRunning)) [L196] int tmp ; VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=1, pumpRunning=0, systemActive=1, waterLevel=2] [L199] COND TRUE ! pumpRunning [L345] int retValue_acc ; [L346] int tmp ; [L347] int tmp___0 ; [L479] int retValue_acc ; VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=1, pumpRunning=0, systemActive=1, waterLevel=2] [L482] COND FALSE !(waterLevel < 2) [L486] retValue_acc = 0 [L487] return (retValue_acc); VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=1, pumpRunning=0, systemActive=1, waterLevel=2] [L351] tmp = isHighWaterSensorDry() [L353] COND FALSE !(\read(tmp)) [L356] tmp___0 = 1 VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=1, pumpRunning=0, systemActive=1, waterLevel=2] [L358] retValue_acc = tmp___0 [L359] return (retValue_acc); VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=1, pumpRunning=0, systemActive=1, waterLevel=2] [L201] tmp = isHighWaterLevel() [L203] COND TRUE \read(tmp) [L276] pumpRunning = 1 VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=1, pumpRunning=1, systemActive=1, waterLevel=2] [L608] int tmp ; [L609] int tmp___0 ; [L438] int retValue_acc ; [L441] retValue_acc = methaneLevelCritical [L442] return (retValue_acc); VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=1, pumpRunning=1, systemActive=1, waterLevel=2] [L613] tmp = isMethaneLevelCritical() [L615] COND TRUE \read(tmp) [L300] int retValue_acc ; [L303] retValue_acc = pumpRunning [L304] return (retValue_acc); VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=1, pumpRunning=1, systemActive=1, waterLevel=2] [L617] tmp___0 = isPumpRunning() [L619] COND TRUE \read(tmp___0) VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=1, pumpRunning=1, systemActive=1, waterLevel=2] [L506] __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, 191 locations, 3 error locations. Result: UNSAFE, OverallTime: 2.7s, OverallIterations: 10, TraceHistogramMax: 1, AutomataDifference: 1.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 1183 SDtfs, 1480 SDslu, 1720 SDs, 0 SdLazy, 217 SolverSat, 53 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.3s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 47 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=304occurred 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, 743 StatesRemovedByMinimization, 6 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 0.5s InterpolantComputationTime, 263 NumberOfCodeBlocks, 263 NumberOfCodeBlocksAsserted, 10 NumberOfCheckSat, 221 ConstructedInterpolants, 0 QuantifiedInterpolants, 15338 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...