./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/product-lines/minepump_spec1_product36.cil.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version f470102c Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx12G -Xms1G -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/product-lines/minepump_spec1_product36.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 9eb4b34c09edb6dce3c64c5d30aa92b31214d915 .......................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE --- Real Ultimate output --- This is Ultimate 0.1.25-f470102 [2019-11-28 17:24:22,056 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-28 17:24:22,058 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-28 17:24:22,070 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-28 17:24:22,071 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-28 17:24:22,072 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-28 17:24:22,074 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-28 17:24:22,076 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-28 17:24:22,079 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-28 17:24:22,080 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-28 17:24:22,082 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-28 17:24:22,083 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-28 17:24:22,083 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-28 17:24:22,091 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-28 17:24:22,092 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-28 17:24:22,093 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-28 17:24:22,095 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-28 17:24:22,098 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-28 17:24:22,100 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-28 17:24:22,104 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-28 17:24:22,106 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-28 17:24:22,108 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-28 17:24:22,109 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-28 17:24:22,110 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-28 17:24:22,115 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-28 17:24:22,115 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-28 17:24:22,115 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-28 17:24:22,117 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-28 17:24:22,118 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-28 17:24:22,119 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-28 17:24:22,120 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-28 17:24:22,121 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-28 17:24:22,121 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-28 17:24:22,122 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-28 17:24:22,125 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-28 17:24:22,126 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-28 17:24:22,127 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-28 17:24:22,127 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-28 17:24:22,127 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-28 17:24:22,129 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-28 17:24:22,131 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-28 17:24:22,131 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2019-11-28 17:24:22,166 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-28 17:24:22,169 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-28 17:24:22,170 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-28 17:24:22,171 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-28 17:24:22,171 INFO L138 SettingsManager]: * Use SBE=true [2019-11-28 17:24:22,171 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-28 17:24:22,171 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-28 17:24:22,172 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-28 17:24:22,172 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-28 17:24:22,172 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-28 17:24:22,172 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-11-28 17:24:22,172 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-28 17:24:22,173 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-11-28 17:24:22,174 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-28 17:24:22,174 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-28 17:24:22,174 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-28 17:24:22,174 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-11-28 17:24:22,175 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-28 17:24:22,175 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-28 17:24:22,175 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-28 17:24:22,176 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-11-28 17:24:22,176 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-28 17:24:22,176 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-28 17:24:22,176 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-28 17:24:22,176 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-11-28 17:24:22,177 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-11-28 17:24:22,177 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-11-28 17:24:22,177 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-11-28 17:24:22,177 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2019-11-28 17:24:22,177 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 -> 9eb4b34c09edb6dce3c64c5d30aa92b31214d915 [2019-11-28 17:24:22,497 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-28 17:24:22,517 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-28 17:24:22,523 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-28 17:24:22,524 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-28 17:24:22,525 INFO L275 PluginConnector]: CDTParser initialized [2019-11-28 17:24:22,526 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/product-lines/minepump_spec1_product36.cil.c [2019-11-28 17:24:22,605 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/05cc8b021/6abc558fc761443dbdbf1929f99e460a/FLAG96125e0bc [2019-11-28 17:24:23,183 INFO L306 CDTParser]: Found 1 translation units. [2019-11-28 17:24:23,191 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/product-lines/minepump_spec1_product36.cil.c [2019-11-28 17:24:23,205 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/05cc8b021/6abc558fc761443dbdbf1929f99e460a/FLAG96125e0bc [2019-11-28 17:24:23,445 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/05cc8b021/6abc558fc761443dbdbf1929f99e460a [2019-11-28 17:24:23,449 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-28 17:24:23,451 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-11-28 17:24:23,452 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-28 17:24:23,452 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-28 17:24:23,456 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-28 17:24:23,457 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 05:24:23" (1/1) ... [2019-11-28 17:24:23,460 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3939ed9e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 05:24:23, skipping insertion in model container [2019-11-28 17:24:23,461 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 05:24:23" (1/1) ... [2019-11-28 17:24:23,471 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-11-28 17:24:23,535 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-11-28 17:24:23,963 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-28 17:24:23,983 INFO L203 MainTranslator]: Completed pre-run [2019-11-28 17:24:24,082 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-28 17:24:24,120 INFO L208 MainTranslator]: Completed translation [2019-11-28 17:24:24,120 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 05:24:24 WrapperNode [2019-11-28 17:24:24,120 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-28 17:24:24,121 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-11-28 17:24:24,121 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-11-28 17:24:24,121 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-11-28 17:24:24,130 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 05:24:24" (1/1) ... [2019-11-28 17:24:24,163 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 05:24:24" (1/1) ... [2019-11-28 17:24:24,203 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-11-28 17:24:24,204 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-28 17:24:24,204 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-28 17:24:24,204 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-28 17:24:24,212 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 05:24:24" (1/1) ... [2019-11-28 17:24:24,212 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 05:24:24" (1/1) ... [2019-11-28 17:24:24,216 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 05:24:24" (1/1) ... [2019-11-28 17:24:24,216 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 05:24:24" (1/1) ... [2019-11-28 17:24:24,226 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 05:24:24" (1/1) ... [2019-11-28 17:24:24,233 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 05:24:24" (1/1) ... [2019-11-28 17:24:24,236 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 05:24:24" (1/1) ... [2019-11-28 17:24:24,240 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-28 17:24:24,241 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-28 17:24:24,241 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-28 17:24:24,241 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-28 17:24:24,242 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 05:24: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 17:24:24,306 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-11-28 17:24:24,306 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2019-11-28 17:24:24,306 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-28 17:24:24,307 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-28 17:24:25,058 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-28 17:24:25,059 INFO L287 CfgBuilder]: Removed 102 assume(true) statements. [2019-11-28 17:24:25,060 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 05:24:25 BoogieIcfgContainer [2019-11-28 17:24:25,060 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-28 17:24:25,062 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-11-28 17:24:25,062 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-11-28 17:24:25,065 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-11-28 17:24:25,066 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 28.11 05:24:23" (1/3) ... [2019-11-28 17:24:25,067 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@23419bf4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.11 05:24:25, skipping insertion in model container [2019-11-28 17:24:25,067 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 05:24:24" (2/3) ... [2019-11-28 17:24:25,068 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@23419bf4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.11 05:24:25, skipping insertion in model container [2019-11-28 17:24:25,068 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 05:24:25" (3/3) ... [2019-11-28 17:24:25,070 INFO L109 eAbstractionObserver]: Analyzing ICFG minepump_spec1_product36.cil.c [2019-11-28 17:24:25,081 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-11-28 17:24:25,089 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 3 error locations. [2019-11-28 17:24:25,102 INFO L249 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2019-11-28 17:24:25,125 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-11-28 17:24:25,125 INFO L374 AbstractCegarLoop]: Hoare is true [2019-11-28 17:24:25,125 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-11-28 17:24:25,126 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-28 17:24:25,126 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-28 17:24:25,126 INFO L378 AbstractCegarLoop]: Difference is false [2019-11-28 17:24:25,126 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-28 17:24:25,126 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-11-28 17:24:25,142 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states. [2019-11-28 17:24:25,149 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-11-28 17:24:25,149 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 17:24:25,150 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 17:24:25,151 INFO L410 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 17:24:25,157 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 17:24:25,157 INFO L82 PathProgramCache]: Analyzing trace with hash -502845476, now seen corresponding path program 1 times [2019-11-28 17:24:25,165 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 17:24:25,165 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [918902704] [2019-11-28 17:24:25,166 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 17:24:25,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:24:25,403 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 17:24:25,404 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [918902704] [2019-11-28 17:24:25,406 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 17:24:25,406 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-28 17:24:25,407 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1014477895] [2019-11-28 17:24:25,414 INFO L442 AbstractCegarLoop]: Interpolant automaton has 2 states [2019-11-28 17:24:25,414 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 17:24:25,427 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2019-11-28 17:24:25,428 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-11-28 17:24:25,430 INFO L87 Difference]: Start difference. First operand 80 states. Second operand 2 states. [2019-11-28 17:24:25,468 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 17:24:25,469 INFO L93 Difference]: Finished difference Result 154 states and 233 transitions. [2019-11-28 17:24:25,469 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2019-11-28 17:24:25,470 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 16 [2019-11-28 17:24:25,471 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 17:24:25,482 INFO L225 Difference]: With dead ends: 154 [2019-11-28 17:24:25,482 INFO L226 Difference]: Without dead ends: 76 [2019-11-28 17:24:25,486 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-11-28 17:24:25,503 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76 states. [2019-11-28 17:24:25,524 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 76. [2019-11-28 17:24:25,526 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 76 states. [2019-11-28 17:24:25,528 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 108 transitions. [2019-11-28 17:24:25,532 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 108 transitions. Word has length 16 [2019-11-28 17:24:25,532 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 17:24:25,532 INFO L462 AbstractCegarLoop]: Abstraction has 76 states and 108 transitions. [2019-11-28 17:24:25,533 INFO L463 AbstractCegarLoop]: Interpolant automaton has 2 states. [2019-11-28 17:24:25,533 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 108 transitions. [2019-11-28 17:24:25,535 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-11-28 17:24:25,535 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 17:24:25,536 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 17:24:25,536 INFO L410 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 17:24:25,536 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 17:24:25,538 INFO L82 PathProgramCache]: Analyzing trace with hash -1549602373, now seen corresponding path program 1 times [2019-11-28 17:24:25,538 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 17:24:25,539 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1555299573] [2019-11-28 17:24:25,539 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 17:24:25,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:24:25,693 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 17:24:25,696 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1555299573] [2019-11-28 17:24:25,696 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 17:24:25,696 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-28 17:24:25,697 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1248380343] [2019-11-28 17:24:25,698 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-28 17:24:25,700 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 17:24:25,700 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-28 17:24:25,701 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 17:24:25,701 INFO L87 Difference]: Start difference. First operand 76 states and 108 transitions. Second operand 3 states. [2019-11-28 17:24:25,719 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 17:24:25,719 INFO L93 Difference]: Finished difference Result 76 states and 108 transitions. [2019-11-28 17:24:25,720 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-28 17:24:25,720 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 17 [2019-11-28 17:24:25,721 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 17:24:25,721 INFO L225 Difference]: With dead ends: 76 [2019-11-28 17:24:25,722 INFO L226 Difference]: Without dead ends: 36 [2019-11-28 17:24:25,723 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 17:24:25,723 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2019-11-28 17:24:25,728 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 36. [2019-11-28 17:24:25,728 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36 states. [2019-11-28 17:24:25,729 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 51 transitions. [2019-11-28 17:24:25,729 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 51 transitions. Word has length 17 [2019-11-28 17:24:25,730 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 17:24:25,730 INFO L462 AbstractCegarLoop]: Abstraction has 36 states and 51 transitions. [2019-11-28 17:24:25,730 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-28 17:24:25,730 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 51 transitions. [2019-11-28 17:24:25,731 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-11-28 17:24:25,731 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 17:24:25,731 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 17:24:25,732 INFO L410 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 17:24:25,732 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 17:24:25,732 INFO L82 PathProgramCache]: Analyzing trace with hash 1499295122, now seen corresponding path program 1 times [2019-11-28 17:24:25,733 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 17:24:25,733 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1179106979] [2019-11-28 17:24:25,733 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 17:24:25,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:24:25,833 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 17:24:25,833 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1179106979] [2019-11-28 17:24:25,834 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 17:24:25,834 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-28 17:24:25,835 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1141355944] [2019-11-28 17:24:25,835 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-28 17:24:25,835 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 17:24:25,836 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-28 17:24:25,836 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 17:24:25,836 INFO L87 Difference]: Start difference. First operand 36 states and 51 transitions. Second operand 3 states. [2019-11-28 17:24:25,888 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 17:24:25,889 INFO L93 Difference]: Finished difference Result 96 states and 141 transitions. [2019-11-28 17:24:25,889 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-28 17:24:25,890 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 22 [2019-11-28 17:24:25,890 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 17:24:25,891 INFO L225 Difference]: With dead ends: 96 [2019-11-28 17:24:25,891 INFO L226 Difference]: Without dead ends: 66 [2019-11-28 17:24:25,892 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 17:24:25,893 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states. [2019-11-28 17:24:25,901 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 62. [2019-11-28 17:24:25,902 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 62 states. [2019-11-28 17:24:25,903 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 91 transitions. [2019-11-28 17:24:25,904 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 91 transitions. Word has length 22 [2019-11-28 17:24:25,904 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 17:24:25,904 INFO L462 AbstractCegarLoop]: Abstraction has 62 states and 91 transitions. [2019-11-28 17:24:25,907 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-28 17:24:25,907 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 91 transitions. [2019-11-28 17:24:25,908 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2019-11-28 17:24:25,908 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 17:24:25,908 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 17:24:25,909 INFO L410 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 17:24:25,909 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 17:24:25,909 INFO L82 PathProgramCache]: Analyzing trace with hash -1870150441, now seen corresponding path program 1 times [2019-11-28 17:24:25,909 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 17:24:25,910 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [17045661] [2019-11-28 17:24:25,910 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 17:24:25,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:24:26,033 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 17:24:26,034 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [17045661] [2019-11-28 17:24:26,035 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 17:24:26,035 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-28 17:24:26,035 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1945899910] [2019-11-28 17:24:26,037 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-28 17:24:26,038 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 17:24:26,039 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-28 17:24:26,039 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 17:24:26,039 INFO L87 Difference]: Start difference. First operand 62 states and 91 transitions. Second operand 3 states. [2019-11-28 17:24:26,095 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 17:24:26,095 INFO L93 Difference]: Finished difference Result 159 states and 238 transitions. [2019-11-28 17:24:26,098 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-28 17:24:26,098 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 23 [2019-11-28 17:24:26,099 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 17:24:26,102 INFO L225 Difference]: With dead ends: 159 [2019-11-28 17:24:26,102 INFO L226 Difference]: Without dead ends: 103 [2019-11-28 17:24:26,103 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 17:24:26,104 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 103 states. [2019-11-28 17:24:26,116 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 103 to 101. [2019-11-28 17:24:26,116 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 101 states. [2019-11-28 17:24:26,117 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 147 transitions. [2019-11-28 17:24:26,117 INFO L78 Accepts]: Start accepts. Automaton has 101 states and 147 transitions. Word has length 23 [2019-11-28 17:24:26,118 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 17:24:26,118 INFO L462 AbstractCegarLoop]: Abstraction has 101 states and 147 transitions. [2019-11-28 17:24:26,118 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-28 17:24:26,118 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 147 transitions. [2019-11-28 17:24:26,119 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-11-28 17:24:26,119 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 17:24:26,120 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 17:24:26,120 INFO L410 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 17:24:26,120 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 17:24:26,120 INFO L82 PathProgramCache]: Analyzing trace with hash 944519591, now seen corresponding path program 1 times [2019-11-28 17:24:26,121 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 17:24:26,121 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [770862136] [2019-11-28 17:24:26,121 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 17:24:26,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:24:26,200 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 17:24:26,200 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [770862136] [2019-11-28 17:24:26,201 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 17:24:26,201 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-28 17:24:26,201 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1988242645] [2019-11-28 17:24:26,202 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-28 17:24:26,202 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 17:24:26,202 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-28 17:24:26,204 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-28 17:24:26,205 INFO L87 Difference]: Start difference. First operand 101 states and 147 transitions. Second operand 5 states. [2019-11-28 17:24:26,336 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 17:24:26,338 INFO L93 Difference]: Finished difference Result 501 states and 748 transitions. [2019-11-28 17:24:26,339 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-11-28 17:24:26,339 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 25 [2019-11-28 17:24:26,339 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 17:24:26,343 INFO L225 Difference]: With dead ends: 501 [2019-11-28 17:24:26,344 INFO L226 Difference]: Without dead ends: 406 [2019-11-28 17:24:26,345 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2019-11-28 17:24:26,348 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 406 states. [2019-11-28 17:24:26,395 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 406 to 186. [2019-11-28 17:24:26,395 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 186 states. [2019-11-28 17:24:26,398 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 186 states to 186 states and 267 transitions. [2019-11-28 17:24:26,399 INFO L78 Accepts]: Start accepts. Automaton has 186 states and 267 transitions. Word has length 25 [2019-11-28 17:24:26,399 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 17:24:26,399 INFO L462 AbstractCegarLoop]: Abstraction has 186 states and 267 transitions. [2019-11-28 17:24:26,399 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-28 17:24:26,399 INFO L276 IsEmpty]: Start isEmpty. Operand 186 states and 267 transitions. [2019-11-28 17:24:26,403 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2019-11-28 17:24:26,403 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 17:24:26,404 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 17:24:26,404 INFO L410 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 17:24:26,404 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 17:24:26,405 INFO L82 PathProgramCache]: Analyzing trace with hash 740712497, now seen corresponding path program 1 times [2019-11-28 17:24:26,406 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 17:24:26,406 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1624542507] [2019-11-28 17:24:26,406 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 17:24:26,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:24:26,521 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 17:24:26,521 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1624542507] [2019-11-28 17:24:26,522 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 17:24:26,522 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-28 17:24:26,522 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [367910964] [2019-11-28 17:24:26,523 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-28 17:24:26,523 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 17:24:26,523 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-28 17:24:26,524 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-28 17:24:26,524 INFO L87 Difference]: Start difference. First operand 186 states and 267 transitions. Second operand 5 states. [2019-11-28 17:24:26,669 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 17:24:26,669 INFO L93 Difference]: Finished difference Result 524 states and 758 transitions. [2019-11-28 17:24:26,670 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-11-28 17:24:26,670 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 26 [2019-11-28 17:24:26,670 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 17:24:26,673 INFO L225 Difference]: With dead ends: 524 [2019-11-28 17:24:26,674 INFO L226 Difference]: Without dead ends: 522 [2019-11-28 17:24:26,675 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2019-11-28 17:24:26,676 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 522 states. [2019-11-28 17:24:26,701 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 522 to 186. [2019-11-28 17:24:26,701 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 186 states. [2019-11-28 17:24:26,702 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 186 states to 186 states and 265 transitions. [2019-11-28 17:24:26,703 INFO L78 Accepts]: Start accepts. Automaton has 186 states and 265 transitions. Word has length 26 [2019-11-28 17:24:26,703 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 17:24:26,703 INFO L462 AbstractCegarLoop]: Abstraction has 186 states and 265 transitions. [2019-11-28 17:24:26,703 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-28 17:24:26,704 INFO L276 IsEmpty]: Start isEmpty. Operand 186 states and 265 transitions. [2019-11-28 17:24:26,705 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2019-11-28 17:24:26,705 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 17:24:26,705 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 17:24:26,706 INFO L410 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 17:24:26,706 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 17:24:26,706 INFO L82 PathProgramCache]: Analyzing trace with hash 2030628178, now seen corresponding path program 1 times [2019-11-28 17:24:26,706 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 17:24:26,707 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [789486219] [2019-11-28 17:24:26,707 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 17:24:26,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:24:26,762 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 17:24:26,763 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [789486219] [2019-11-28 17:24:26,763 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 17:24:26,763 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-28 17:24:26,763 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [360556545] [2019-11-28 17:24:26,764 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-28 17:24:26,764 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 17:24:26,764 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-28 17:24:26,765 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-28 17:24:26,765 INFO L87 Difference]: Start difference. First operand 186 states and 265 transitions. Second operand 5 states. [2019-11-28 17:24:26,837 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 17:24:26,837 INFO L93 Difference]: Finished difference Result 510 states and 719 transitions. [2019-11-28 17:24:26,838 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-28 17:24:26,838 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 30 [2019-11-28 17:24:26,838 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 17:24:26,840 INFO L225 Difference]: With dead ends: 510 [2019-11-28 17:24:26,840 INFO L226 Difference]: Without dead ends: 330 [2019-11-28 17:24:26,841 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2019-11-28 17:24:26,842 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 330 states. [2019-11-28 17:24:26,858 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 330 to 198. [2019-11-28 17:24:26,859 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 198 states. [2019-11-28 17:24:26,860 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 198 states to 198 states and 277 transitions. [2019-11-28 17:24:26,860 INFO L78 Accepts]: Start accepts. Automaton has 198 states and 277 transitions. Word has length 30 [2019-11-28 17:24:26,860 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 17:24:26,860 INFO L462 AbstractCegarLoop]: Abstraction has 198 states and 277 transitions. [2019-11-28 17:24:26,861 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-28 17:24:26,861 INFO L276 IsEmpty]: Start isEmpty. Operand 198 states and 277 transitions. [2019-11-28 17:24:26,862 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2019-11-28 17:24:26,862 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 17:24:26,862 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 17:24:26,862 INFO L410 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 17:24:26,863 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 17:24:26,863 INFO L82 PathProgramCache]: Analyzing trace with hash 1637601168, now seen corresponding path program 1 times [2019-11-28 17:24:26,863 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 17:24:26,863 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [909486543] [2019-11-28 17:24:26,863 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 17:24:26,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:24:26,915 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 17:24:26,916 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [909486543] [2019-11-28 17:24:26,916 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 17:24:26,916 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-28 17:24:26,917 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2002611554] [2019-11-28 17:24:26,917 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-28 17:24:26,917 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 17:24:26,918 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-28 17:24:26,918 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-28 17:24:26,918 INFO L87 Difference]: Start difference. First operand 198 states and 277 transitions. Second operand 4 states. [2019-11-28 17:24:26,967 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 17:24:26,967 INFO L93 Difference]: Finished difference Result 486 states and 674 transitions. [2019-11-28 17:24:26,968 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-28 17:24:26,968 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 30 [2019-11-28 17:24:26,969 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 17:24:26,970 INFO L225 Difference]: With dead ends: 486 [2019-11-28 17:24:26,971 INFO L226 Difference]: Without dead ends: 294 [2019-11-28 17:24:26,972 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 17:24:26,972 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 294 states. [2019-11-28 17:24:26,991 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 294 to 206. [2019-11-28 17:24:26,992 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 206 states. [2019-11-28 17:24:26,993 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 206 states to 206 states and 285 transitions. [2019-11-28 17:24:26,993 INFO L78 Accepts]: Start accepts. Automaton has 206 states and 285 transitions. Word has length 30 [2019-11-28 17:24:26,993 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 17:24:26,993 INFO L462 AbstractCegarLoop]: Abstraction has 206 states and 285 transitions. [2019-11-28 17:24:26,994 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-28 17:24:26,994 INFO L276 IsEmpty]: Start isEmpty. Operand 206 states and 285 transitions. [2019-11-28 17:24:26,995 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2019-11-28 17:24:26,995 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 17:24:26,995 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 17:24:26,995 INFO L410 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 17:24:26,996 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 17:24:26,996 INFO L82 PathProgramCache]: Analyzing trace with hash 1895766606, now seen corresponding path program 1 times [2019-11-28 17:24:26,996 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 17:24:26,997 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [328193672] [2019-11-28 17:24:26,997 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 17:24:27,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:24:27,033 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 17:24:27,034 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [328193672] [2019-11-28 17:24:27,034 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 17:24:27,034 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-28 17:24:27,034 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [743224530] [2019-11-28 17:24:27,035 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-28 17:24:27,035 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 17:24:27,035 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-28 17:24:27,035 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 17:24:27,035 INFO L87 Difference]: Start difference. First operand 206 states and 285 transitions. Second operand 3 states. [2019-11-28 17:24:27,084 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 17:24:27,084 INFO L93 Difference]: Finished difference Result 506 states and 694 transitions. [2019-11-28 17:24:27,085 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-28 17:24:27,085 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 30 [2019-11-28 17:24:27,085 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 17:24:27,087 INFO L225 Difference]: With dead ends: 506 [2019-11-28 17:24:27,087 INFO L226 Difference]: Without dead ends: 306 [2019-11-28 17:24:27,088 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 17:24:27,088 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 306 states. [2019-11-28 17:24:27,115 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 306 to 306. [2019-11-28 17:24:27,116 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 306 states. [2019-11-28 17:24:27,117 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 306 states to 306 states and 407 transitions. [2019-11-28 17:24:27,117 INFO L78 Accepts]: Start accepts. Automaton has 306 states and 407 transitions. Word has length 30 [2019-11-28 17:24:27,118 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 17:24:27,118 INFO L462 AbstractCegarLoop]: Abstraction has 306 states and 407 transitions. [2019-11-28 17:24:27,118 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-28 17:24:27,118 INFO L276 IsEmpty]: Start isEmpty. Operand 306 states and 407 transitions. [2019-11-28 17:24:27,119 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2019-11-28 17:24:27,119 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 17:24:27,119 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 17:24:27,120 INFO L410 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 17:24:27,120 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 17:24:27,120 INFO L82 PathProgramCache]: Analyzing trace with hash -112049588, now seen corresponding path program 1 times [2019-11-28 17:24:27,120 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 17:24:27,121 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [890119120] [2019-11-28 17:24:27,121 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 17:24:27,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 17:24:27,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 17:24:27,304 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-28 17:24:27,305 INFO L475 BasicCegarLoop]: Counterexample might be feasible [2019-11-28 17:24:27,448 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 28.11 05:24:27 BoogieIcfgContainer [2019-11-28 17:24:27,453 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-11-28 17:24:27,454 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-11-28 17:24:27,454 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-11-28 17:24:27,454 INFO L275 PluginConnector]: Witness Printer initialized [2019-11-28 17:24:27,455 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 05:24:25" (3/4) ... [2019-11-28 17:24:27,457 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2019-11-28 17:24:27,622 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2019-11-28 17:24:27,622 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-11-28 17:24:27,624 INFO L168 Benchmark]: Toolchain (without parser) took 4173.68 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 219.2 MB). Free memory was 960.4 MB in the beginning and 1.2 GB in the end (delta: -235.5 MB). Peak memory consumption was 294.4 MB. Max. memory is 11.5 GB. [2019-11-28 17:24:27,625 INFO L168 Benchmark]: CDTParser took 0.84 ms. Allocated memory is still 1.0 GB. Free memory is still 987.2 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-28 17:24:27,626 INFO L168 Benchmark]: CACSL2BoogieTranslator took 669.14 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 151.0 MB). Free memory was 960.4 MB in the beginning and 1.1 GB in the end (delta: -172.5 MB). Peak memory consumption was 25.7 MB. Max. memory is 11.5 GB. [2019-11-28 17:24:27,626 INFO L168 Benchmark]: Boogie Procedure Inliner took 82.60 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.6 MB). Peak memory consumption was 6.6 MB. Max. memory is 11.5 GB. [2019-11-28 17:24:27,627 INFO L168 Benchmark]: Boogie Preprocessor took 36.41 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-28 17:24:27,628 INFO L168 Benchmark]: RCFGBuilder took 819.74 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: 51.5 MB). Peak memory consumption was 51.5 MB. Max. memory is 11.5 GB. [2019-11-28 17:24:27,628 INFO L168 Benchmark]: TraceAbstraction took 2391.37 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 831.1 MB in the end (delta: 243.7 MB). Peak memory consumption was 243.7 MB. Max. memory is 11.5 GB. [2019-11-28 17:24:27,629 INFO L168 Benchmark]: Witness Printer took 168.59 ms. Allocated memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 68.2 MB). Free memory was 831.1 MB in the beginning and 1.2 GB in the end (delta: -364.8 MB). Peak memory consumption was 14.1 MB. Max. memory is 11.5 GB. [2019-11-28 17:24:27,632 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.84 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 669.14 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 151.0 MB). Free memory was 960.4 MB in the beginning and 1.1 GB in the end (delta: -172.5 MB). Peak memory consumption was 25.7 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 82.60 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.6 MB). Peak memory consumption was 6.6 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 36.41 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 819.74 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: 51.5 MB). Peak memory consumption was 51.5 MB. Max. memory is 11.5 GB. * TraceAbstraction took 2391.37 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 831.1 MB in the end (delta: 243.7 MB). Peak memory consumption was 243.7 MB. Max. memory is 11.5 GB. * Witness Printer took 168.59 ms. Allocated memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 68.2 MB). Free memory was 831.1 MB in the beginning and 1.2 GB in the end (delta: -364.8 MB). Peak memory consumption was 14.1 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 44]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L60] int pumpRunning = 0; [L61] int systemActive = 1; [L239] int waterLevel = 1; [L240] int methaneLevelCritical = 0; [L610] static struct __ACC__ERR *head = (struct __ACC__ERR *)0; [L833] int cleanupTimeShifts = 4; VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=0, systemActive=1, waterLevel=1] [L906] int retValue_acc ; [L907] int tmp ; VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=0, systemActive=1, waterLevel=1] [L432] int retValue_acc ; [L435] retValue_acc = 1 [L436] return (retValue_acc); VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=0, systemActive=1, waterLevel=1] [L913] tmp = valid_product() [L915] COND TRUE \read(tmp) VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=0, systemActive=1, waterLevel=1] [L335] int splverifierCounter ; [L336] int tmp ; [L337] int tmp___0 ; [L338] int tmp___1 ; [L339] int tmp___2 ; [L342] splverifierCounter = 0 VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=0, systemActive=1, waterLevel=1] [L344] COND TRUE 1 VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=0, systemActive=1, waterLevel=1] [L346] COND TRUE splverifierCounter < 4 VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=0, systemActive=1, waterLevel=1] [L352] tmp = __VERIFIER_nondet_int() [L354] COND TRUE \read(tmp) VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=0, systemActive=1, waterLevel=1] [L257] COND TRUE waterLevel < 2 [L258] waterLevel = waterLevel + 1 VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=0, systemActive=1, waterLevel=2] [L362] tmp___0 = __VERIFIER_nondet_int() [L364] COND TRUE \read(tmp___0) VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=0, systemActive=1, waterLevel=2] [L269] COND FALSE !(\read(methaneLevelCritical)) [L272] methaneLevelCritical = 1 VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=1, pumpRunning=0, systemActive=1, waterLevel=2] [L372] tmp___2 = __VERIFIER_nondet_int() [L374] COND TRUE \read(tmp___2) [L231] systemActive = 1 VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=1, pumpRunning=0, systemActive=1, waterLevel=2] [L68] COND FALSE !(\read(pumpRunning)) VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=1, pumpRunning=0, systemActive=1, waterLevel=2] [L75] COND TRUE \read(systemActive) [L97] int tmp ; VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=1, pumpRunning=0, systemActive=1, waterLevel=2] [L100] COND TRUE ! pumpRunning [L194] int retValue_acc ; [L195] int tmp ; [L196] int tmp___0 ; [L319] int retValue_acc ; VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=1, pumpRunning=0, systemActive=1, waterLevel=2] [L322] COND FALSE !(waterLevel < 2) [L326] retValue_acc = 0 [L327] return (retValue_acc); VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=1, pumpRunning=0, systemActive=1, waterLevel=2] [L200] tmp = isHighWaterSensorDry() [L202] COND FALSE !(\read(tmp)) [L205] tmp___0 = 1 VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=1, pumpRunning=0, systemActive=1, waterLevel=2] [L207] retValue_acc = tmp___0 [L208] return (retValue_acc); VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=1, pumpRunning=0, systemActive=1, waterLevel=2] [L102] tmp = isHighWaterLevel() [L104] COND TRUE \read(tmp) [L125] pumpRunning = 1 VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=1, pumpRunning=1, systemActive=1, waterLevel=2] [L808] int tmp ; [L809] int tmp___0 ; [L278] int retValue_acc ; [L281] retValue_acc = methaneLevelCritical [L282] return (retValue_acc); VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=1, pumpRunning=1, systemActive=1, waterLevel=2] [L813] tmp = isMethaneLevelCritical() [L815] COND TRUE \read(tmp) [L149] int retValue_acc ; [L152] retValue_acc = pumpRunning [L153] return (retValue_acc); VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=1, pumpRunning=1, systemActive=1, waterLevel=2] [L817] tmp___0 = isPumpRunning() [L819] COND TRUE \read(tmp___0) VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=1, pumpRunning=1, systemActive=1, waterLevel=2] [L44] __VERIFIER_error() VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=1, pumpRunning=1, systemActive=1, waterLevel=2] - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 80 locations, 3 error locations. Result: UNSAFE, OverallTime: 2.1s, OverallIterations: 10, TraceHistogramMax: 1, AutomataDifference: 0.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 628 SDtfs, 711 SDslu, 859 SDs, 0 SdLazy, 107 SolverSat, 20 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.1s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 43 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=306occurred 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, 782 StatesRemovedByMinimization, 6 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 0.5s InterpolantComputationTime, 250 NumberOfCodeBlocks, 250 NumberOfCodeBlocksAsserted, 10 NumberOfCheckSat, 210 ConstructedInterpolants, 0 QuantifiedInterpolants, 9524 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...