./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/product-lines/minepump_spec1_product37.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_product37.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 a4cdc62a5b5efdfba89a3280823bf73bd08d347a ............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................ 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,240 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-28 17:24:22,242 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-28 17:24:22,255 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-28 17:24:22,255 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-28 17:24:22,257 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-28 17:24:22,258 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-28 17:24:22,260 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-28 17:24:22,262 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-28 17:24:22,263 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-28 17:24:22,265 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-28 17:24:22,266 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-28 17:24:22,266 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-28 17:24:22,268 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-28 17:24:22,269 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-28 17:24:22,270 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-28 17:24:22,271 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-28 17:24:22,272 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-28 17:24:22,274 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-28 17:24:22,276 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-28 17:24:22,278 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-28 17:24:22,279 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-28 17:24:22,281 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-28 17:24:22,281 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-28 17:24:22,284 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-28 17:24:22,284 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-28 17:24:22,284 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-28 17:24:22,286 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-28 17:24:22,286 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-28 17:24:22,287 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-28 17:24:22,287 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-28 17:24:22,288 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-28 17:24:22,289 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-28 17:24:22,290 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-28 17:24:22,291 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-28 17:24:22,292 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-28 17:24:22,292 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-28 17:24:22,293 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-28 17:24:22,293 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-28 17:24:22,294 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-28 17:24:22,295 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-28 17:24:22,296 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,311 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-28 17:24:22,311 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-28 17:24:22,313 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-28 17:24:22,313 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-28 17:24:22,313 INFO L138 SettingsManager]: * Use SBE=true [2019-11-28 17:24:22,314 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-28 17:24:22,314 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-28 17:24:22,314 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-28 17:24:22,315 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-28 17:24:22,315 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-28 17:24:22,315 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-11-28 17:24:22,315 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-28 17:24:22,316 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-11-28 17:24:22,316 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-28 17:24:22,316 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-28 17:24:22,316 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-28 17:24:22,317 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-11-28 17:24:22,317 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-28 17:24:22,317 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-28 17:24:22,318 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-28 17:24:22,318 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-11-28 17:24:22,318 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-28 17:24:22,318 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-28 17:24:22,319 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-28 17:24:22,319 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-11-28 17:24:22,319 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-11-28 17:24:22,320 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-11-28 17:24:22,320 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-11-28 17:24:22,320 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2019-11-28 17:24:22,320 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 -> a4cdc62a5b5efdfba89a3280823bf73bd08d347a [2019-11-28 17:24:22,631 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-28 17:24:22,644 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-28 17:24:22,648 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-28 17:24:22,650 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-28 17:24:22,651 INFO L275 PluginConnector]: CDTParser initialized [2019-11-28 17:24:22,651 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/product-lines/minepump_spec1_product37.cil.c [2019-11-28 17:24:22,722 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9e89512d8/758d72f875e142f48ee8ee3aff17f112/FLAG662654851 [2019-11-28 17:24:23,257 INFO L306 CDTParser]: Found 1 translation units. [2019-11-28 17:24:23,258 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/product-lines/minepump_spec1_product37.cil.c [2019-11-28 17:24:23,272 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9e89512d8/758d72f875e142f48ee8ee3aff17f112/FLAG662654851 [2019-11-28 17:24:23,546 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9e89512d8/758d72f875e142f48ee8ee3aff17f112 [2019-11-28 17:24:23,550 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-28 17:24:23,552 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-11-28 17:24:23,553 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-28 17:24:23,553 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-28 17:24:23,558 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-28 17:24:23,559 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,562 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2f4f4d53 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,562 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,572 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-11-28 17:24:23,616 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-11-28 17:24:24,033 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-28 17:24:24,046 INFO L203 MainTranslator]: Completed pre-run [2019-11-28 17:24:24,166 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-28 17:24:24,203 INFO L208 MainTranslator]: Completed translation [2019-11-28 17:24:24,204 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,204 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-28 17:24:24,205 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-11-28 17:24:24,205 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-11-28 17:24:24,205 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-11-28 17:24:24,212 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,234 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,285 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-11-28 17:24:24,286 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-28 17:24:24,286 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-28 17:24:24,286 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-28 17:24:24,297 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,298 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,303 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,303 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,316 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,326 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,329 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,335 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-28 17:24:24,336 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-28 17:24:24,336 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-28 17:24:24,336 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-28 17:24:24,337 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,415 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-11-28 17:24:24,415 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2019-11-28 17:24:24,415 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-28 17:24:24,416 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-28 17:24:25,328 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-28 17:24:25,328 INFO L287 CfgBuilder]: Removed 156 assume(true) statements. [2019-11-28 17:24:25,330 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,330 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-28 17:24:25,332 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-11-28 17:24:25,332 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-11-28 17:24:25,335 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-11-28 17:24:25,336 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,337 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2726000 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,337 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,338 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2726000 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,338 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,340 INFO L109 eAbstractionObserver]: Analyzing ICFG minepump_spec1_product37.cil.c [2019-11-28 17:24:25,353 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-11-28 17:24:25,361 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 3 error locations. [2019-11-28 17:24:25,374 INFO L249 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2019-11-28 17:24:25,401 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-11-28 17:24:25,402 INFO L374 AbstractCegarLoop]: Hoare is true [2019-11-28 17:24:25,402 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-11-28 17:24:25,402 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-28 17:24:25,404 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-28 17:24:25,405 INFO L378 AbstractCegarLoop]: Difference is false [2019-11-28 17:24:25,405 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-28 17:24:25,405 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-11-28 17:24:25,424 INFO L276 IsEmpty]: Start isEmpty. Operand 111 states. [2019-11-28 17:24:25,432 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-11-28 17:24:25,432 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 17:24:25,433 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,433 INFO L410 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 17:24:25,440 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 17:24:25,440 INFO L82 PathProgramCache]: Analyzing trace with hash 2109695399, now seen corresponding path program 1 times [2019-11-28 17:24:25,450 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 17:24:25,450 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [680566005] [2019-11-28 17:24:25,450 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 17:24:25,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:24:25,712 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,713 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [680566005] [2019-11-28 17:24:25,714 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 17:24:25,714 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-28 17:24:25,715 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1005556542] [2019-11-28 17:24:25,720 INFO L442 AbstractCegarLoop]: Interpolant automaton has 2 states [2019-11-28 17:24:25,720 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 17:24:25,734 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2019-11-28 17:24:25,735 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-11-28 17:24:25,737 INFO L87 Difference]: Start difference. First operand 111 states. Second operand 2 states. [2019-11-28 17:24:25,770 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 17:24:25,771 INFO L93 Difference]: Finished difference Result 216 states and 329 transitions. [2019-11-28 17:24:25,771 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2019-11-28 17:24:25,772 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 16 [2019-11-28 17:24:25,773 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 17:24:25,785 INFO L225 Difference]: With dead ends: 216 [2019-11-28 17:24:25,785 INFO L226 Difference]: Without dead ends: 107 [2019-11-28 17:24:25,789 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,809 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 107 states. [2019-11-28 17:24:25,836 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 107 to 107. [2019-11-28 17:24:25,837 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 107 states. [2019-11-28 17:24:25,840 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107 states to 107 states and 156 transitions. [2019-11-28 17:24:25,842 INFO L78 Accepts]: Start accepts. Automaton has 107 states and 156 transitions. Word has length 16 [2019-11-28 17:24:25,842 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 17:24:25,842 INFO L462 AbstractCegarLoop]: Abstraction has 107 states and 156 transitions. [2019-11-28 17:24:25,843 INFO L463 AbstractCegarLoop]: Interpolant automaton has 2 states. [2019-11-28 17:24:25,843 INFO L276 IsEmpty]: Start isEmpty. Operand 107 states and 156 transitions. [2019-11-28 17:24:25,844 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-11-28 17:24:25,844 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 17:24:25,844 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,845 INFO L410 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 17:24:25,845 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 17:24:25,845 INFO L82 PathProgramCache]: Analyzing trace with hash 1093063509, now seen corresponding path program 1 times [2019-11-28 17:24:25,846 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 17:24:25,846 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1130169579] [2019-11-28 17:24:25,846 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 17:24:25,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:24:25,981 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,982 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1130169579] [2019-11-28 17:24:25,983 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 17:24:25,983 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-28 17:24:25,983 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1343673744] [2019-11-28 17:24:25,985 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-28 17:24:25,985 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 17:24:25,986 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-28 17:24:25,986 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 17:24:25,986 INFO L87 Difference]: Start difference. First operand 107 states and 156 transitions. Second operand 3 states. [2019-11-28 17:24:25,999 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 17:24:26,000 INFO L93 Difference]: Finished difference Result 107 states and 156 transitions. [2019-11-28 17:24:26,000 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-28 17:24:26,001 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 17 [2019-11-28 17:24:26,001 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 17:24:26,002 INFO L225 Difference]: With dead ends: 107 [2019-11-28 17:24:26,002 INFO L226 Difference]: Without dead ends: 45 [2019-11-28 17:24:26,004 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:26,004 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2019-11-28 17:24:26,009 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 45. [2019-11-28 17:24:26,009 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45 states. [2019-11-28 17:24:26,010 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 65 transitions. [2019-11-28 17:24:26,011 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 65 transitions. Word has length 17 [2019-11-28 17:24:26,011 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 17:24:26,011 INFO L462 AbstractCegarLoop]: Abstraction has 45 states and 65 transitions. [2019-11-28 17:24:26,012 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-28 17:24:26,012 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 65 transitions. [2019-11-28 17:24:26,013 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-11-28 17:24:26,013 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 17:24:26,013 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:26,014 INFO L410 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 17:24:26,014 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 17:24:26,014 INFO L82 PathProgramCache]: Analyzing trace with hash -720159228, now seen corresponding path program 1 times [2019-11-28 17:24:26,015 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 17:24:26,015 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [969418344] [2019-11-28 17:24:26,015 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 17:24:26,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:24:26,108 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,109 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [969418344] [2019-11-28 17:24:26,109 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 17:24:26,109 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-28 17:24:26,109 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1036001032] [2019-11-28 17:24:26,110 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-28 17:24:26,111 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 17:24:26,111 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-28 17:24:26,111 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 17:24:26,111 INFO L87 Difference]: Start difference. First operand 45 states and 65 transitions. Second operand 3 states. [2019-11-28 17:24:26,135 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 17:24:26,139 INFO L93 Difference]: Finished difference Result 84 states and 124 transitions. [2019-11-28 17:24:26,141 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-28 17:24:26,142 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 22 [2019-11-28 17:24:26,142 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 17:24:26,144 INFO L225 Difference]: With dead ends: 84 [2019-11-28 17:24:26,146 INFO L226 Difference]: Without dead ends: 45 [2019-11-28 17:24:26,148 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,148 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2019-11-28 17:24:26,158 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 45. [2019-11-28 17:24:26,160 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45 states. [2019-11-28 17:24:26,160 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 64 transitions. [2019-11-28 17:24:26,161 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 64 transitions. Word has length 22 [2019-11-28 17:24:26,161 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 17:24:26,162 INFO L462 AbstractCegarLoop]: Abstraction has 45 states and 64 transitions. [2019-11-28 17:24:26,162 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-28 17:24:26,163 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 64 transitions. [2019-11-28 17:24:26,164 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2019-11-28 17:24:26,165 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 17:24:26,165 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 17:24:26,166 INFO L410 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 17:24:26,166 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 17:24:26,167 INFO L82 PathProgramCache]: Analyzing trace with hash 2091202829, now seen corresponding path program 1 times [2019-11-28 17:24:26,167 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 17:24:26,167 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [157103928] [2019-11-28 17:24:26,168 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 17:24:26,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:24:26,296 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,297 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [157103928] [2019-11-28 17:24:26,297 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 17:24:26,297 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-28 17:24:26,298 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1693103837] [2019-11-28 17:24:26,298 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-28 17:24:26,298 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 17:24:26,298 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-28 17:24:26,301 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 17:24:26,301 INFO L87 Difference]: Start difference. First operand 45 states and 64 transitions. Second operand 3 states. [2019-11-28 17:24:26,355 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 17:24:26,355 INFO L93 Difference]: Finished difference Result 105 states and 152 transitions. [2019-11-28 17:24:26,356 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-28 17:24:26,356 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 24 [2019-11-28 17:24:26,357 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 17:24:26,357 INFO L225 Difference]: With dead ends: 105 [2019-11-28 17:24:26,358 INFO L226 Difference]: Without dead ends: 66 [2019-11-28 17:24:26,359 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,359 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states. [2019-11-28 17:24:26,366 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 64. [2019-11-28 17:24:26,367 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 64 states. [2019-11-28 17:24:26,368 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 90 transitions. [2019-11-28 17:24:26,368 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 90 transitions. Word has length 24 [2019-11-28 17:24:26,369 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 17:24:26,369 INFO L462 AbstractCegarLoop]: Abstraction has 64 states and 90 transitions. [2019-11-28 17:24:26,369 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-28 17:24:26,369 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 90 transitions. [2019-11-28 17:24:26,372 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2019-11-28 17:24:26,373 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 17:24:26,373 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,373 INFO L410 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 17:24:26,374 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 17:24:26,374 INFO L82 PathProgramCache]: Analyzing trace with hash -1013899842, now seen corresponding path program 1 times [2019-11-28 17:24:26,375 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 17:24:26,375 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1940879003] [2019-11-28 17:24:26,376 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 17:24:26,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:24:26,489 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,490 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1940879003] [2019-11-28 17:24:26,490 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 17:24:26,490 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-28 17:24:26,491 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1098227988] [2019-11-28 17:24:26,491 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-28 17:24:26,491 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 17:24:26,491 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-28 17:24:26,492 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-28 17:24:26,492 INFO L87 Difference]: Start difference. First operand 64 states and 90 transitions. Second operand 5 states. [2019-11-28 17:24:26,598 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 17:24:26,598 INFO L93 Difference]: Finished difference Result 171 states and 239 transitions. [2019-11-28 17:24:26,599 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-28 17:24:26,599 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 30 [2019-11-28 17:24:26,599 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 17:24:26,601 INFO L225 Difference]: With dead ends: 171 [2019-11-28 17:24:26,601 INFO L226 Difference]: Without dead ends: 113 [2019-11-28 17:24:26,602 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,603 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 113 states. [2019-11-28 17:24:26,611 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 113 to 70. [2019-11-28 17:24:26,611 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 70 states. [2019-11-28 17:24:26,612 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 96 transitions. [2019-11-28 17:24:26,613 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 96 transitions. Word has length 30 [2019-11-28 17:24:26,613 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 17:24:26,613 INFO L462 AbstractCegarLoop]: Abstraction has 70 states and 96 transitions. [2019-11-28 17:24:26,614 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-28 17:24:26,614 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 96 transitions. [2019-11-28 17:24:26,615 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2019-11-28 17:24:26,615 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 17:24:26,616 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,616 INFO L410 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 17:24:26,616 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 17:24:26,617 INFO L82 PathProgramCache]: Analyzing trace with hash 1648611201, now seen corresponding path program 1 times [2019-11-28 17:24:26,617 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 17:24:26,618 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [638375207] [2019-11-28 17:24:26,618 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 17:24:26,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:24:26,773 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,774 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [638375207] [2019-11-28 17:24:26,774 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 17:24:26,774 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-28 17:24:26,775 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [754702957] [2019-11-28 17:24:26,775 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-28 17:24:26,776 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 17:24:26,776 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-28 17:24:26,776 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-28 17:24:26,776 INFO L87 Difference]: Start difference. First operand 70 states and 96 transitions. Second operand 5 states. [2019-11-28 17:24:26,919 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 17:24:26,919 INFO L93 Difference]: Finished difference Result 344 states and 483 transitions. [2019-11-28 17:24:26,920 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-11-28 17:24:26,920 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 30 [2019-11-28 17:24:26,920 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 17:24:26,922 INFO L225 Difference]: With dead ends: 344 [2019-11-28 17:24:26,923 INFO L226 Difference]: Without dead ends: 280 [2019-11-28 17:24:26,924 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 17:24:26,925 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 280 states. [2019-11-28 17:24:26,943 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 280 to 128. [2019-11-28 17:24:26,943 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 128 states. [2019-11-28 17:24:26,944 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 128 states to 128 states and 175 transitions. [2019-11-28 17:24:26,944 INFO L78 Accepts]: Start accepts. Automaton has 128 states and 175 transitions. Word has length 30 [2019-11-28 17:24:26,945 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 17:24:26,945 INFO L462 AbstractCegarLoop]: Abstraction has 128 states and 175 transitions. [2019-11-28 17:24:26,945 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-28 17:24:26,945 INFO L276 IsEmpty]: Start isEmpty. Operand 128 states and 175 transitions. [2019-11-28 17:24:26,946 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2019-11-28 17:24:26,947 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 17:24:26,947 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 17:24:26,947 INFO L410 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 17:24:26,947 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 17:24:26,948 INFO L82 PathProgramCache]: Analyzing trace with hash -1974587593, now seen corresponding path program 1 times [2019-11-28 17:24:26,948 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 17:24:26,948 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [788090875] [2019-11-28 17:24:26,949 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 17:24:26,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:24:27,045 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,046 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [788090875] [2019-11-28 17:24:27,046 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 17:24:27,047 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-28 17:24:27,047 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [838905348] [2019-11-28 17:24:27,047 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-28 17:24:27,053 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 17:24:27,053 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-28 17:24:27,054 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-28 17:24:27,054 INFO L87 Difference]: Start difference. First operand 128 states and 175 transitions. Second operand 5 states. [2019-11-28 17:24:27,235 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 17:24:27,235 INFO L93 Difference]: Finished difference Result 366 states and 502 transitions. [2019-11-28 17:24:27,235 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-11-28 17:24:27,236 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 31 [2019-11-28 17:24:27,236 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 17:24:27,238 INFO L225 Difference]: With dead ends: 366 [2019-11-28 17:24:27,238 INFO L226 Difference]: Without dead ends: 364 [2019-11-28 17:24:27,239 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:27,242 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 364 states. [2019-11-28 17:24:27,267 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 364 to 128. [2019-11-28 17:24:27,268 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 128 states. [2019-11-28 17:24:27,269 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 128 states to 128 states and 174 transitions. [2019-11-28 17:24:27,269 INFO L78 Accepts]: Start accepts. Automaton has 128 states and 174 transitions. Word has length 31 [2019-11-28 17:24:27,269 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 17:24:27,269 INFO L462 AbstractCegarLoop]: Abstraction has 128 states and 174 transitions. [2019-11-28 17:24:27,270 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-28 17:24:27,270 INFO L276 IsEmpty]: Start isEmpty. Operand 128 states and 174 transitions. [2019-11-28 17:24:27,271 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2019-11-28 17:24:27,271 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 17:24:27,271 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,272 INFO L410 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 17:24:27,272 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 17:24:27,272 INFO L82 PathProgramCache]: Analyzing trace with hash -735158350, now seen corresponding path program 1 times [2019-11-28 17:24:27,272 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 17:24:27,273 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [884576241] [2019-11-28 17:24:27,273 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 17:24:27,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:24:27,323 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,323 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [884576241] [2019-11-28 17:24:27,324 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 17:24:27,324 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-28 17:24:27,324 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1843912253] [2019-11-28 17:24:27,325 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-28 17:24:27,325 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 17:24:27,325 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-28 17:24:27,325 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-28 17:24:27,326 INFO L87 Difference]: Start difference. First operand 128 states and 174 transitions. Second operand 4 states. [2019-11-28 17:24:27,380 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 17:24:27,380 INFO L93 Difference]: Finished difference Result 308 states and 416 transitions. [2019-11-28 17:24:27,380 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-28 17:24:27,381 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 31 [2019-11-28 17:24:27,381 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 17:24:27,382 INFO L225 Difference]: With dead ends: 308 [2019-11-28 17:24:27,382 INFO L226 Difference]: Without dead ends: 186 [2019-11-28 17:24:27,384 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:27,384 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 186 states. [2019-11-28 17:24:27,397 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 186 to 136. [2019-11-28 17:24:27,398 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 136 states. [2019-11-28 17:24:27,398 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 136 states to 136 states and 182 transitions. [2019-11-28 17:24:27,399 INFO L78 Accepts]: Start accepts. Automaton has 136 states and 182 transitions. Word has length 31 [2019-11-28 17:24:27,399 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 17:24:27,399 INFO L462 AbstractCegarLoop]: Abstraction has 136 states and 182 transitions. [2019-11-28 17:24:27,399 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-28 17:24:27,399 INFO L276 IsEmpty]: Start isEmpty. Operand 136 states and 182 transitions. [2019-11-28 17:24:27,401 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2019-11-28 17:24:27,401 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 17:24:27,401 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,401 INFO L410 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 17:24:27,401 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 17:24:27,402 INFO L82 PathProgramCache]: Analyzing trace with hash -476992912, now seen corresponding path program 1 times [2019-11-28 17:24:27,402 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 17:24:27,402 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [181890682] [2019-11-28 17:24:27,403 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 17:24:27,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:24:27,444 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,445 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [181890682] [2019-11-28 17:24:27,445 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 17:24:27,445 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-28 17:24:27,446 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [312729796] [2019-11-28 17:24:27,446 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-28 17:24:27,446 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 17:24:27,446 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-28 17:24:27,447 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 17:24:27,447 INFO L87 Difference]: Start difference. First operand 136 states and 182 transitions. Second operand 3 states. [2019-11-28 17:24:27,478 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 17:24:27,479 INFO L93 Difference]: Finished difference Result 316 states and 422 transitions. [2019-11-28 17:24:27,479 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-28 17:24:27,479 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 31 [2019-11-28 17:24:27,480 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 17:24:27,481 INFO L225 Difference]: With dead ends: 316 [2019-11-28 17:24:27,481 INFO L226 Difference]: Without dead ends: 186 [2019-11-28 17:24:27,482 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 17:24:27,482 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 186 states. [2019-11-28 17:24:27,496 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 186 to 186. [2019-11-28 17:24:27,496 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 186 states. [2019-11-28 17:24:27,497 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 186 states to 186 states and 242 transitions. [2019-11-28 17:24:27,498 INFO L78 Accepts]: Start accepts. Automaton has 186 states and 242 transitions. Word has length 31 [2019-11-28 17:24:27,498 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 17:24:27,498 INFO L462 AbstractCegarLoop]: Abstraction has 186 states and 242 transitions. [2019-11-28 17:24:27,498 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-28 17:24:27,498 INFO L276 IsEmpty]: Start isEmpty. Operand 186 states and 242 transitions. [2019-11-28 17:24:27,499 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2019-11-28 17:24:27,499 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 17:24:27,500 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 17:24:27,500 INFO L410 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 17:24:27,500 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 17:24:27,500 INFO L82 PathProgramCache]: Analyzing trace with hash 1705214514, now seen corresponding path program 1 times [2019-11-28 17:24:27,500 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 17:24:27,501 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [84716265] [2019-11-28 17:24:27,501 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 17:24:27,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 17:24:27,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 17:24:27,651 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-28 17:24:27,652 INFO L475 BasicCegarLoop]: Counterexample might be feasible [2019-11-28 17:24:27,773 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,773 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-11-28 17:24:27,774 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-11-28 17:24:27,774 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-11-28 17:24:27,774 INFO L275 PluginConnector]: Witness Printer initialized [2019-11-28 17:24:27,775 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,778 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2019-11-28 17:24:27,885 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2019-11-28 17:24:27,885 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-11-28 17:24:27,887 INFO L168 Benchmark]: Toolchain (without parser) took 4335.45 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 145.2 MB). Free memory was 961.7 MB in the beginning and 820.1 MB in the end (delta: 141.5 MB). Peak memory consumption was 286.8 MB. Max. memory is 11.5 GB. [2019-11-28 17:24:27,888 INFO L168 Benchmark]: CDTParser took 0.30 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,889 INFO L168 Benchmark]: CACSL2BoogieTranslator took 651.51 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 145.2 MB). Free memory was 961.7 MB in the beginning and 1.1 GB in the end (delta: -166.2 MB). Peak memory consumption was 27.6 MB. Max. memory is 11.5 GB. [2019-11-28 17:24:27,889 INFO L168 Benchmark]: Boogie Procedure Inliner took 80.82 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: 1.7 MB). Peak memory consumption was 1.7 MB. Max. memory is 11.5 GB. [2019-11-28 17:24:27,890 INFO L168 Benchmark]: Boogie Preprocessor took 49.61 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.7 MB). Peak memory consumption was 6.7 MB. Max. memory is 11.5 GB. [2019-11-28 17:24:27,890 INFO L168 Benchmark]: RCFGBuilder took 994.71 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: 65.6 MB). Peak memory consumption was 65.6 MB. Max. memory is 11.5 GB. [2019-11-28 17:24:27,891 INFO L168 Benchmark]: TraceAbstraction took 2441.83 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 833.0 MB in the end (delta: 220.8 MB). Peak memory consumption was 220.8 MB. Max. memory is 11.5 GB. [2019-11-28 17:24:27,891 INFO L168 Benchmark]: Witness Printer took 111.26 ms. Allocated memory is still 1.2 GB. Free memory was 833.0 MB in the beginning and 820.1 MB in the end (delta: 12.9 MB). Peak memory consumption was 12.9 MB. Max. memory is 11.5 GB. [2019-11-28 17:24:27,894 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.30 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 651.51 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 145.2 MB). Free memory was 961.7 MB in the beginning and 1.1 GB in the end (delta: -166.2 MB). Peak memory consumption was 27.6 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 80.82 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: 1.7 MB). Peak memory consumption was 1.7 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 49.61 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 994.71 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: 65.6 MB). Peak memory consumption was 65.6 MB. Max. memory is 11.5 GB. * TraceAbstraction took 2441.83 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 833.0 MB in the end (delta: 220.8 MB). Peak memory consumption was 220.8 MB. Max. memory is 11.5 GB. * Witness Printer took 111.26 ms. Allocated memory is still 1.2 GB. Free memory was 833.0 MB in the beginning and 820.1 MB in the end (delta: 12.9 MB). Peak memory consumption was 12.9 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 543]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L209] static struct __ACC__ERR *head = (struct __ACC__ERR *)0; [L406] int cleanupTimeShifts = 4; [L588] int pumpRunning = 0; [L589] int systemActive = 1; [L832] int waterLevel = 1; [L833] int methaneLevelCritical = 0; VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=0, systemActive=1, waterLevel=1] [L487] int retValue_acc ; [L488] int tmp ; VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=0, systemActive=1, waterLevel=1] [L574] int retValue_acc ; [L577] retValue_acc = 1 [L578] return (retValue_acc); VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=0, systemActive=1, waterLevel=1] [L494] tmp = valid_product() [L496] COND TRUE \read(tmp) VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=0, systemActive=1, waterLevel=1] [L767] int splverifierCounter ; [L768] int tmp ; [L769] int tmp___0 ; [L770] int tmp___1 ; [L771] int tmp___2 ; [L774] splverifierCounter = 0 VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=0, systemActive=1, waterLevel=1] [L776] COND TRUE 1 VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=0, systemActive=1, waterLevel=1] [L778] COND TRUE splverifierCounter < 4 VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=0, systemActive=1, waterLevel=1] [L784] tmp = __VERIFIER_nondet_int() [L786] COND TRUE \read(tmp) VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=0, systemActive=1, waterLevel=1] [L850] COND TRUE waterLevel < 2 [L851] waterLevel = waterLevel + 1 VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=0, systemActive=1, waterLevel=2] [L794] tmp___0 = __VERIFIER_nondet_int() [L796] COND TRUE \read(tmp___0) VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=0, systemActive=1, waterLevel=2] [L862] COND FALSE !(\read(methaneLevelCritical)) [L865] methaneLevelCritical = 1 VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=1, pumpRunning=0, systemActive=1, waterLevel=2] [L804] tmp___2 = __VERIFIER_nondet_int() [L806] COND TRUE \read(tmp___2) VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=1, pumpRunning=0, systemActive=1, waterLevel=2] [L595] COND FALSE !(\read(pumpRunning)) VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=1, pumpRunning=0, systemActive=1, waterLevel=2] [L602] COND TRUE \read(systemActive) [L650] int tmp ; VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=1, pumpRunning=0, systemActive=1, waterLevel=2] [L653] COND FALSE !(\read(pumpRunning)) [L624] int tmp ; VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=1, pumpRunning=0, systemActive=1, waterLevel=2] [L627] COND TRUE ! pumpRunning [L747] int retValue_acc ; [L748] int tmp ; [L749] int tmp___0 ; [L912] int retValue_acc ; VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=1, pumpRunning=0, systemActive=1, waterLevel=2] [L915] COND FALSE !(waterLevel < 2) [L919] retValue_acc = 0 [L920] return (retValue_acc); VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=1, pumpRunning=0, systemActive=1, waterLevel=2] [L753] tmp = isHighWaterSensorDry() [L755] COND FALSE !(\read(tmp)) [L758] tmp___0 = 1 VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=1, pumpRunning=0, systemActive=1, waterLevel=2] [L760] retValue_acc = tmp___0 [L761] return (retValue_acc); VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=1, pumpRunning=0, systemActive=1, waterLevel=2] [L629] tmp = isHighWaterLevel() [L631] COND TRUE \read(tmp) [L678] pumpRunning = 1 VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=1, pumpRunning=1, systemActive=1, waterLevel=2] [L514] int tmp ; [L515] int tmp___0 ; [L871] int retValue_acc ; [L874] retValue_acc = methaneLevelCritical [L875] return (retValue_acc); VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=1, pumpRunning=1, systemActive=1, waterLevel=2] [L519] tmp = isMethaneLevelCritical() [L521] COND TRUE \read(tmp) [L702] int retValue_acc ; [L705] retValue_acc = pumpRunning [L706] return (retValue_acc); VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=1, pumpRunning=1, systemActive=1, waterLevel=2] [L523] tmp___0 = isPumpRunning() [L525] COND TRUE \read(tmp___0) VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=1, pumpRunning=1, systemActive=1, waterLevel=2] [L543] __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, 111 locations, 3 error locations. Result: UNSAFE, OverallTime: 2.2s, OverallIterations: 10, TraceHistogramMax: 1, AutomataDifference: 0.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 787 SDtfs, 819 SDslu, 960 SDs, 0 SdLazy, 146 SolverSat, 32 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.2s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 42 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=186occurred 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.1s AutomataMinimizationTime, 9 MinimizatonAttempts, 483 StatesRemovedByMinimization, 5 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 0.6s InterpolantComputationTime, 264 NumberOfCodeBlocks, 264 NumberOfCodeBlocksAsserted, 10 NumberOfCheckSat, 223 ConstructedInterpolants, 0 QuantifiedInterpolants, 11991 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...