./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/product-lines/minepump_spec4_product34.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_spec4_product34.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 feddb53df5c889a09349b532f3a03633c4161684 .............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................. 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:26:52,299 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-28 17:26:52,300 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-28 17:26:52,312 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-28 17:26:52,312 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-28 17:26:52,313 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-28 17:26:52,315 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-28 17:26:52,317 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-28 17:26:52,319 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-28 17:26:52,320 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-28 17:26:52,321 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-28 17:26:52,322 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-28 17:26:52,323 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-28 17:26:52,324 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-28 17:26:52,325 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-28 17:26:52,326 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-28 17:26:52,327 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-28 17:26:52,328 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-28 17:26:52,330 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-28 17:26:52,332 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-28 17:26:52,334 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-28 17:26:52,336 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-28 17:26:52,337 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-28 17:26:52,338 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-28 17:26:52,341 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-28 17:26:52,342 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-28 17:26:52,342 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-28 17:26:52,343 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-28 17:26:52,344 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-28 17:26:52,345 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-28 17:26:52,345 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-28 17:26:52,346 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-28 17:26:52,347 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-28 17:26:52,348 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-28 17:26:52,349 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-28 17:26:52,350 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-28 17:26:52,350 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-28 17:26:52,351 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-28 17:26:52,351 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-28 17:26:52,352 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-28 17:26:52,353 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-28 17:26:52,354 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:26:52,377 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-28 17:26:52,377 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-28 17:26:52,379 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-28 17:26:52,380 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-28 17:26:52,380 INFO L138 SettingsManager]: * Use SBE=true [2019-11-28 17:26:52,380 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-28 17:26:52,380 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-28 17:26:52,381 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-28 17:26:52,382 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-28 17:26:52,382 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-28 17:26:52,384 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-11-28 17:26:52,384 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-28 17:26:52,384 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-11-28 17:26:52,385 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-28 17:26:52,385 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-28 17:26:52,385 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-28 17:26:52,385 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-11-28 17:26:52,385 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-28 17:26:52,386 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-28 17:26:52,386 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-28 17:26:52,386 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-11-28 17:26:52,387 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-28 17:26:52,387 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-28 17:26:52,387 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-28 17:26:52,388 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-11-28 17:26:52,388 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-11-28 17:26:52,388 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-11-28 17:26:52,388 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-11-28 17:26:52,388 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2019-11-28 17:26:52,389 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 -> feddb53df5c889a09349b532f3a03633c4161684 [2019-11-28 17:26:52,722 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-28 17:26:52,745 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-28 17:26:52,749 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-28 17:26:52,751 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-28 17:26:52,752 INFO L275 PluginConnector]: CDTParser initialized [2019-11-28 17:26:52,753 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/product-lines/minepump_spec4_product34.cil.c [2019-11-28 17:26:52,817 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d3f3ca875/073869a4274a427e8661a53ab2e18504/FLAG6517f9e2a [2019-11-28 17:26:53,372 INFO L306 CDTParser]: Found 1 translation units. [2019-11-28 17:26:53,373 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/product-lines/minepump_spec4_product34.cil.c [2019-11-28 17:26:53,389 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d3f3ca875/073869a4274a427e8661a53ab2e18504/FLAG6517f9e2a [2019-11-28 17:26:53,665 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d3f3ca875/073869a4274a427e8661a53ab2e18504 [2019-11-28 17:26:53,668 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-28 17:26:53,670 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-11-28 17:26:53,671 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-28 17:26:53,672 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-28 17:26:53,675 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-28 17:26:53,677 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 05:26:53" (1/1) ... [2019-11-28 17:26:53,680 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@ce269f4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 05:26:53, skipping insertion in model container [2019-11-28 17:26:53,680 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 05:26:53" (1/1) ... [2019-11-28 17:26:53,688 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-11-28 17:26:53,727 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-11-28 17:26:54,141 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-28 17:26:54,163 INFO L203 MainTranslator]: Completed pre-run [2019-11-28 17:26:54,272 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-28 17:26:54,314 INFO L208 MainTranslator]: Completed translation [2019-11-28 17:26:54,315 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 05:26:54 WrapperNode [2019-11-28 17:26:54,315 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-28 17:26:54,316 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-11-28 17:26:54,316 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-11-28 17:26:54,317 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-11-28 17:26:54,326 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:26:54" (1/1) ... [2019-11-28 17:26:54,350 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:26:54" (1/1) ... [2019-11-28 17:26:54,385 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-11-28 17:26:54,386 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-28 17:26:54,386 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-28 17:26:54,386 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-28 17:26:54,394 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 05:26:54" (1/1) ... [2019-11-28 17:26:54,395 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 05:26:54" (1/1) ... [2019-11-28 17:26:54,399 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 05:26:54" (1/1) ... [2019-11-28 17:26:54,399 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 05:26:54" (1/1) ... [2019-11-28 17:26:54,409 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 05:26:54" (1/1) ... [2019-11-28 17:26:54,417 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 05:26:54" (1/1) ... [2019-11-28 17:26:54,420 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 05:26:54" (1/1) ... [2019-11-28 17:26:54,424 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-28 17:26:54,425 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-28 17:26:54,425 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-28 17:26:54,425 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-28 17:26:54,426 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 05:26:54" (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:26:54,496 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-11-28 17:26:54,496 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2019-11-28 17:26:54,496 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-28 17:26:54,497 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-28 17:26:55,338 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-28 17:26:55,340 INFO L287 CfgBuilder]: Removed 98 assume(true) statements. [2019-11-28 17:26:55,341 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 05:26:55 BoogieIcfgContainer [2019-11-28 17:26:55,341 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-28 17:26:55,343 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-11-28 17:26:55,343 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-11-28 17:26:55,347 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-11-28 17:26:55,347 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 28.11 05:26:53" (1/3) ... [2019-11-28 17:26:55,349 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3bac3306 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.11 05:26:55, skipping insertion in model container [2019-11-28 17:26:55,349 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 05:26:54" (2/3) ... [2019-11-28 17:26:55,349 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3bac3306 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.11 05:26:55, skipping insertion in model container [2019-11-28 17:26:55,349 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 05:26:55" (3/3) ... [2019-11-28 17:26:55,360 INFO L109 eAbstractionObserver]: Analyzing ICFG minepump_spec4_product34.cil.c [2019-11-28 17:26:55,371 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-11-28 17:26:55,380 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 3 error locations. [2019-11-28 17:26:55,390 INFO L249 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2019-11-28 17:26:55,416 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-11-28 17:26:55,416 INFO L374 AbstractCegarLoop]: Hoare is true [2019-11-28 17:26:55,417 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-11-28 17:26:55,417 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-28 17:26:55,417 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-28 17:26:55,417 INFO L378 AbstractCegarLoop]: Difference is false [2019-11-28 17:26:55,417 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-28 17:26:55,418 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-11-28 17:26:55,433 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states. [2019-11-28 17:26:55,442 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-11-28 17:26:55,443 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 17:26:55,444 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:26:55,444 INFO L410 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 17:26:55,449 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 17:26:55,449 INFO L82 PathProgramCache]: Analyzing trace with hash 1424204181, now seen corresponding path program 1 times [2019-11-28 17:26:55,456 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 17:26:55,457 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [752617318] [2019-11-28 17:26:55,457 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 17:26:55,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:26:55,816 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:26:55,817 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [752617318] [2019-11-28 17:26:55,818 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 17:26:55,819 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-28 17:26:55,820 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [448576326] [2019-11-28 17:26:55,826 INFO L442 AbstractCegarLoop]: Interpolant automaton has 2 states [2019-11-28 17:26:55,827 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 17:26:55,847 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2019-11-28 17:26:55,848 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-11-28 17:26:55,852 INFO L87 Difference]: Start difference. First operand 78 states. Second operand 2 states. [2019-11-28 17:26:55,887 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 17:26:55,888 INFO L93 Difference]: Finished difference Result 150 states and 227 transitions. [2019-11-28 17:26:55,888 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2019-11-28 17:26:55,890 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 16 [2019-11-28 17:26:55,890 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 17:26:55,907 INFO L225 Difference]: With dead ends: 150 [2019-11-28 17:26:55,907 INFO L226 Difference]: Without dead ends: 74 [2019-11-28 17:26:55,911 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:26:55,935 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74 states. [2019-11-28 17:26:55,958 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74 to 74. [2019-11-28 17:26:55,960 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 74 states. [2019-11-28 17:26:55,962 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 105 transitions. [2019-11-28 17:26:55,964 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 105 transitions. Word has length 16 [2019-11-28 17:26:55,965 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 17:26:55,965 INFO L462 AbstractCegarLoop]: Abstraction has 74 states and 105 transitions. [2019-11-28 17:26:55,965 INFO L463 AbstractCegarLoop]: Interpolant automaton has 2 states. [2019-11-28 17:26:55,966 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 105 transitions. [2019-11-28 17:26:55,967 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-11-28 17:26:55,967 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 17:26:55,967 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:26:55,968 INFO L410 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 17:26:55,968 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 17:26:55,969 INFO L82 PathProgramCache]: Analyzing trace with hash -631654862, now seen corresponding path program 1 times [2019-11-28 17:26:55,969 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 17:26:55,969 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [788974409] [2019-11-28 17:26:55,970 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 17:26:56,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:26:56,128 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:26:56,130 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [788974409] [2019-11-28 17:26:56,130 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 17:26:56,130 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-28 17:26:56,130 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [439920912] [2019-11-28 17:26:56,132 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-28 17:26:56,133 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 17:26:56,133 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-28 17:26:56,133 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 17:26:56,134 INFO L87 Difference]: Start difference. First operand 74 states and 105 transitions. Second operand 3 states. [2019-11-28 17:26:56,155 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 17:26:56,155 INFO L93 Difference]: Finished difference Result 74 states and 105 transitions. [2019-11-28 17:26:56,156 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-28 17:26:56,156 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 17 [2019-11-28 17:26:56,157 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 17:26:56,158 INFO L225 Difference]: With dead ends: 74 [2019-11-28 17:26:56,159 INFO L226 Difference]: Without dead ends: 34 [2019-11-28 17:26:56,161 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:26:56,161 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2019-11-28 17:26:56,169 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 34. [2019-11-28 17:26:56,169 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34 states. [2019-11-28 17:26:56,170 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 48 transitions. [2019-11-28 17:26:56,170 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 48 transitions. Word has length 17 [2019-11-28 17:26:56,170 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 17:26:56,171 INFO L462 AbstractCegarLoop]: Abstraction has 34 states and 48 transitions. [2019-11-28 17:26:56,171 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-28 17:26:56,171 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 48 transitions. [2019-11-28 17:26:56,172 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-11-28 17:26:56,173 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 17:26:56,173 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:26:56,173 INFO L410 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 17:26:56,174 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 17:26:56,174 INFO L82 PathProgramCache]: Analyzing trace with hash -964945646, now seen corresponding path program 1 times [2019-11-28 17:26:56,175 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 17:26:56,175 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1729055343] [2019-11-28 17:26:56,176 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 17:26:56,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:26:56,290 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:26:56,291 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1729055343] [2019-11-28 17:26:56,291 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 17:26:56,291 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-28 17:26:56,292 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [616804461] [2019-11-28 17:26:56,292 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-28 17:26:56,292 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 17:26:56,293 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-28 17:26:56,293 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-28 17:26:56,293 INFO L87 Difference]: Start difference. First operand 34 states and 48 transitions. Second operand 5 states. [2019-11-28 17:26:56,351 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 17:26:56,351 INFO L93 Difference]: Finished difference Result 62 states and 90 transitions. [2019-11-28 17:26:56,352 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-28 17:26:56,352 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 22 [2019-11-28 17:26:56,352 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 17:26:56,353 INFO L225 Difference]: With dead ends: 62 [2019-11-28 17:26:56,353 INFO L226 Difference]: Without dead ends: 34 [2019-11-28 17:26:56,354 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:26:56,354 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2019-11-28 17:26:56,358 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 34. [2019-11-28 17:26:56,358 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34 states. [2019-11-28 17:26:56,359 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 47 transitions. [2019-11-28 17:26:56,359 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 47 transitions. Word has length 22 [2019-11-28 17:26:56,360 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 17:26:56,360 INFO L462 AbstractCegarLoop]: Abstraction has 34 states and 47 transitions. [2019-11-28 17:26:56,360 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-28 17:26:56,360 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 47 transitions. [2019-11-28 17:26:56,361 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2019-11-28 17:26:56,361 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 17:26:56,362 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:26:56,362 INFO L410 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 17:26:56,362 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 17:26:56,362 INFO L82 PathProgramCache]: Analyzing trace with hash -952202930, now seen corresponding path program 1 times [2019-11-28 17:26:56,363 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 17:26:56,363 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [292752956] [2019-11-28 17:26:56,363 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 17:26:56,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:26:56,414 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:26:56,414 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [292752956] [2019-11-28 17:26:56,415 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 17:26:56,415 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-28 17:26:56,415 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [629273813] [2019-11-28 17:26:56,416 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-28 17:26:56,416 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 17:26:56,416 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-28 17:26:56,417 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 17:26:56,417 INFO L87 Difference]: Start difference. First operand 34 states and 47 transitions. Second operand 3 states. [2019-11-28 17:26:56,458 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 17:26:56,458 INFO L93 Difference]: Finished difference Result 83 states and 118 transitions. [2019-11-28 17:26:56,459 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-28 17:26:56,459 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 23 [2019-11-28 17:26:56,460 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 17:26:56,460 INFO L225 Difference]: With dead ends: 83 [2019-11-28 17:26:56,461 INFO L226 Difference]: Without dead ends: 55 [2019-11-28 17:26:56,461 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:26:56,464 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2019-11-28 17:26:56,473 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 53. [2019-11-28 17:26:56,475 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 53 states. [2019-11-28 17:26:56,476 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 74 transitions. [2019-11-28 17:26:56,479 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 74 transitions. Word has length 23 [2019-11-28 17:26:56,481 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 17:26:56,481 INFO L462 AbstractCegarLoop]: Abstraction has 53 states and 74 transitions. [2019-11-28 17:26:56,481 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-28 17:26:56,482 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 74 transitions. [2019-11-28 17:26:56,484 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2019-11-28 17:26:56,484 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 17:26:56,485 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] [2019-11-28 17:26:56,485 INFO L410 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 17:26:56,486 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 17:26:56,486 INFO L82 PathProgramCache]: Analyzing trace with hash -2049720417, now seen corresponding path program 1 times [2019-11-28 17:26:56,486 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 17:26:56,487 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1660416906] [2019-11-28 17:26:56,487 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 17:26:56,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:26:56,564 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:26:56,564 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1660416906] [2019-11-28 17:26:56,564 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 17:26:56,565 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-28 17:26:56,565 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1182523654] [2019-11-28 17:26:56,565 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-28 17:26:56,566 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 17:26:56,566 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-28 17:26:56,566 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-28 17:26:56,567 INFO L87 Difference]: Start difference. First operand 53 states and 74 transitions. Second operand 5 states. [2019-11-28 17:26:56,647 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 17:26:56,647 INFO L93 Difference]: Finished difference Result 139 states and 194 transitions. [2019-11-28 17:26:56,649 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-28 17:26:56,649 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 29 [2019-11-28 17:26:56,649 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 17:26:56,650 INFO L225 Difference]: With dead ends: 139 [2019-11-28 17:26:56,651 INFO L226 Difference]: Without dead ends: 92 [2019-11-28 17:26:56,652 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:26:56,654 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92 states. [2019-11-28 17:26:56,665 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92 to 56. [2019-11-28 17:26:56,665 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 56 states. [2019-11-28 17:26:56,669 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 77 transitions. [2019-11-28 17:26:56,669 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 77 transitions. Word has length 29 [2019-11-28 17:26:56,669 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 17:26:56,670 INFO L462 AbstractCegarLoop]: Abstraction has 56 states and 77 transitions. [2019-11-28 17:26:56,670 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-28 17:26:56,670 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 77 transitions. [2019-11-28 17:26:56,672 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2019-11-28 17:26:56,672 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 17:26:56,673 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] [2019-11-28 17:26:56,673 INFO L410 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 17:26:56,673 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 17:26:56,674 INFO L82 PathProgramCache]: Analyzing trace with hash 612790626, now seen corresponding path program 1 times [2019-11-28 17:26:56,674 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 17:26:56,674 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [574464626] [2019-11-28 17:26:56,674 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 17:26:56,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:26:56,783 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:26:56,784 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [574464626] [2019-11-28 17:26:56,784 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 17:26:56,785 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-11-28 17:26:56,785 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1896268140] [2019-11-28 17:26:56,785 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-11-28 17:26:56,787 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 17:26:56,787 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-11-28 17:26:56,787 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2019-11-28 17:26:56,788 INFO L87 Difference]: Start difference. First operand 56 states and 77 transitions. Second operand 8 states. [2019-11-28 17:26:57,160 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 17:26:57,160 INFO L93 Difference]: Finished difference Result 347 states and 497 transitions. [2019-11-28 17:26:57,161 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-11-28 17:26:57,161 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 29 [2019-11-28 17:26:57,162 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 17:26:57,164 INFO L225 Difference]: With dead ends: 347 [2019-11-28 17:26:57,164 INFO L226 Difference]: Without dead ends: 297 [2019-11-28 17:26:57,170 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=71, Invalid=169, Unknown=0, NotChecked=0, Total=240 [2019-11-28 17:26:57,172 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 297 states. [2019-11-28 17:26:57,212 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 297 to 140. [2019-11-28 17:26:57,213 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 140 states. [2019-11-28 17:26:57,214 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 140 states to 140 states and 190 transitions. [2019-11-28 17:26:57,214 INFO L78 Accepts]: Start accepts. Automaton has 140 states and 190 transitions. Word has length 29 [2019-11-28 17:26:57,215 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 17:26:57,215 INFO L462 AbstractCegarLoop]: Abstraction has 140 states and 190 transitions. [2019-11-28 17:26:57,215 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-11-28 17:26:57,215 INFO L276 IsEmpty]: Start isEmpty. Operand 140 states and 190 transitions. [2019-11-28 17:26:57,217 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2019-11-28 17:26:57,217 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 17:26:57,217 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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:26:57,218 INFO L410 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 17:26:57,218 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 17:26:57,218 INFO L82 PathProgramCache]: Analyzing trace with hash -230943976, now seen corresponding path program 1 times [2019-11-28 17:26:57,219 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 17:26:57,219 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [913812596] [2019-11-28 17:26:57,219 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 17:26:57,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:26:57,294 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-11-28 17:26:57,294 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [913812596] [2019-11-28 17:26:57,294 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 17:26:57,295 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-11-28 17:26:57,295 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2088984737] [2019-11-28 17:26:57,295 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-28 17:26:57,296 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 17:26:57,296 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-28 17:26:57,296 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-11-28 17:26:57,297 INFO L87 Difference]: Start difference. First operand 140 states and 190 transitions. Second operand 6 states. [2019-11-28 17:26:57,384 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 17:26:57,384 INFO L93 Difference]: Finished difference Result 325 states and 442 transitions. [2019-11-28 17:26:57,384 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-11-28 17:26:57,385 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 44 [2019-11-28 17:26:57,385 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 17:26:57,386 INFO L225 Difference]: With dead ends: 325 [2019-11-28 17:26:57,387 INFO L226 Difference]: Without dead ends: 191 [2019-11-28 17:26:57,388 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=34, Invalid=56, Unknown=0, NotChecked=0, Total=90 [2019-11-28 17:26:57,388 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 191 states. [2019-11-28 17:26:57,404 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 191 to 120. [2019-11-28 17:26:57,404 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 120 states. [2019-11-28 17:26:57,405 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 120 states to 120 states and 160 transitions. [2019-11-28 17:26:57,405 INFO L78 Accepts]: Start accepts. Automaton has 120 states and 160 transitions. Word has length 44 [2019-11-28 17:26:57,405 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 17:26:57,405 INFO L462 AbstractCegarLoop]: Abstraction has 120 states and 160 transitions. [2019-11-28 17:26:57,406 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-28 17:26:57,406 INFO L276 IsEmpty]: Start isEmpty. Operand 120 states and 160 transitions. [2019-11-28 17:26:57,407 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2019-11-28 17:26:57,407 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 17:26:57,408 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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:26:57,408 INFO L410 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 17:26:57,408 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 17:26:57,409 INFO L82 PathProgramCache]: Analyzing trace with hash -187398120, now seen corresponding path program 1 times [2019-11-28 17:26:57,409 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 17:26:57,409 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [477458899] [2019-11-28 17:26:57,409 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 17:26:57,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:26:57,493 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 11 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 17:26:57,494 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [477458899] [2019-11-28 17:26:57,494 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1536167729] [2019-11-28 17:26:57,494 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-28 17:26:57,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:26:57,644 INFO L264 TraceCheckSpWp]: Trace formula consists of 379 conjuncts, 6 conjunts are in the unsatisfiable core [2019-11-28 17:26:57,653 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 17:26:57,720 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 11 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 17:26:57,720 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-28 17:26:57,721 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 8 [2019-11-28 17:26:57,721 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1518012856] [2019-11-28 17:26:57,723 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-11-28 17:26:57,724 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 17:26:57,724 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-11-28 17:26:57,725 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2019-11-28 17:26:57,726 INFO L87 Difference]: Start difference. First operand 120 states and 160 transitions. Second operand 8 states. [2019-11-28 17:26:57,983 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 17:26:57,984 INFO L93 Difference]: Finished difference Result 412 states and 570 transitions. [2019-11-28 17:26:57,984 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-11-28 17:26:57,985 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 45 [2019-11-28 17:26:57,986 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 17:26:57,988 INFO L225 Difference]: With dead ends: 412 [2019-11-28 17:26:57,989 INFO L226 Difference]: Without dead ends: 321 [2019-11-28 17:26:57,990 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 49 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 27 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=68, Invalid=142, Unknown=0, NotChecked=0, Total=210 [2019-11-28 17:26:57,991 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 321 states. [2019-11-28 17:26:58,024 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 321 to 159. [2019-11-28 17:26:58,024 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 159 states. [2019-11-28 17:26:58,025 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 159 states to 159 states and 211 transitions. [2019-11-28 17:26:58,026 INFO L78 Accepts]: Start accepts. Automaton has 159 states and 211 transitions. Word has length 45 [2019-11-28 17:26:58,028 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 17:26:58,028 INFO L462 AbstractCegarLoop]: Abstraction has 159 states and 211 transitions. [2019-11-28 17:26:58,028 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-11-28 17:26:58,028 INFO L276 IsEmpty]: Start isEmpty. Operand 159 states and 211 transitions. [2019-11-28 17:26:58,034 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2019-11-28 17:26:58,035 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 17:26:58,035 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 17:26:58,239 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-28 17:26:58,240 INFO L410 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 17:26:58,240 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 17:26:58,241 INFO L82 PathProgramCache]: Analyzing trace with hash 774082429, now seen corresponding path program 2 times [2019-11-28 17:26:58,241 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 17:26:58,242 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1397999274] [2019-11-28 17:26:58,242 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 17:26:58,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 17:26:58,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 17:26:58,436 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-28 17:26:58,436 INFO L475 BasicCegarLoop]: Counterexample might be feasible [2019-11-28 17:26:58,559 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 28.11 05:26:58 BoogieIcfgContainer [2019-11-28 17:26:58,559 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-11-28 17:26:58,560 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-11-28 17:26:58,560 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-11-28 17:26:58,560 INFO L275 PluginConnector]: Witness Printer initialized [2019-11-28 17:26:58,561 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 05:26:55" (3/4) ... [2019-11-28 17:26:58,566 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2019-11-28 17:26:58,706 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2019-11-28 17:26:58,706 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-11-28 17:26:58,709 INFO L168 Benchmark]: Toolchain (without parser) took 5038.34 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 174.6 MB). Free memory was 959.0 MB in the beginning and 1.1 GB in the end (delta: -145.1 MB). Peak memory consumption was 29.5 MB. Max. memory is 11.5 GB. [2019-11-28 17:26:58,709 INFO L168 Benchmark]: CDTParser took 0.76 ms. Allocated memory is still 1.0 GB. Free memory is still 987.2 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-28 17:26:58,710 INFO L168 Benchmark]: CACSL2BoogieTranslator took 644.14 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 72.9 MB). Free memory was 959.0 MB in the beginning and 1.1 GB in the end (delta: -93.4 MB). Peak memory consumption was 27.4 MB. Max. memory is 11.5 GB. [2019-11-28 17:26:58,710 INFO L168 Benchmark]: Boogie Procedure Inliner took 69.74 ms. Allocated memory is still 1.1 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-28 17:26:58,710 INFO L168 Benchmark]: Boogie Preprocessor took 38.14 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 7.1 MB). Peak memory consumption was 7.1 MB. Max. memory is 11.5 GB. [2019-11-28 17:26:58,711 INFO L168 Benchmark]: RCFGBuilder took 916.98 ms. Allocated memory is still 1.1 GB. Free memory was 1.0 GB in the beginning and 991.2 MB in the end (delta: 54.1 MB). Peak memory consumption was 54.1 MB. Max. memory is 11.5 GB. [2019-11-28 17:26:58,711 INFO L168 Benchmark]: TraceAbstraction took 3217.06 ms. Allocated memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: 101.7 MB). Free memory was 991.2 MB in the beginning and 1.1 GB in the end (delta: -138.8 MB). There was no memory consumed. Max. memory is 11.5 GB. [2019-11-28 17:26:58,711 INFO L168 Benchmark]: Witness Printer took 146.69 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: 25.9 MB). Peak memory consumption was 25.9 MB. Max. memory is 11.5 GB. [2019-11-28 17:26:58,713 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.76 ms. Allocated memory is still 1.0 GB. Free memory is still 987.2 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 644.14 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 72.9 MB). Free memory was 959.0 MB in the beginning and 1.1 GB in the end (delta: -93.4 MB). Peak memory consumption was 27.4 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 69.74 ms. Allocated memory is still 1.1 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * Boogie Preprocessor took 38.14 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 7.1 MB). Peak memory consumption was 7.1 MB. Max. memory is 11.5 GB. * RCFGBuilder took 916.98 ms. Allocated memory is still 1.1 GB. Free memory was 1.0 GB in the beginning and 991.2 MB in the end (delta: 54.1 MB). Peak memory consumption was 54.1 MB. Max. memory is 11.5 GB. * TraceAbstraction took 3217.06 ms. Allocated memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: 101.7 MB). Free memory was 991.2 MB in the beginning and 1.1 GB in the end (delta: -138.8 MB). There was no memory consumed. Max. memory is 11.5 GB. * Witness Printer took 146.69 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: 25.9 MB). Peak memory consumption was 25.9 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 540]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L69] int cleanupTimeShifts = 4; [L282] int pumpRunning = 0; [L283] int systemActive = 1; [L442] int waterLevel = 1; [L443] int methaneLevelCritical = 0; [L714] static struct __ACC__ERR *head = (struct __ACC__ERR *)0; VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=0, systemActive=1, waterLevel=1] [L150] int retValue_acc ; [L151] int tmp ; VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=0, systemActive=1, waterLevel=1] [L199] int retValue_acc ; [L202] retValue_acc = 1 [L203] return (retValue_acc); VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=0, systemActive=1, waterLevel=1] [L157] tmp = valid_product() [L159] COND TRUE \read(tmp) VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=0, systemActive=1, waterLevel=1] [L210] int splverifierCounter ; [L211] int tmp ; [L212] int tmp___0 ; [L213] int tmp___1 ; [L214] int tmp___2 ; [L217] splverifierCounter = 0 VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=0, systemActive=1, waterLevel=1] [L219] COND TRUE 1 VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=0, systemActive=1, waterLevel=1] [L221] COND TRUE splverifierCounter < 4 VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=0, systemActive=1, waterLevel=1] [L227] tmp = __VERIFIER_nondet_int() [L229] COND TRUE \read(tmp) VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=0, systemActive=1, waterLevel=1] [L460] COND TRUE waterLevel < 2 [L461] waterLevel = waterLevel + 1 VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=0, systemActive=1, waterLevel=2] [L237] tmp___0 = __VERIFIER_nondet_int() [L239] COND FALSE !(\read(tmp___0)) VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=0, systemActive=1, waterLevel=2] [L247] tmp___2 = __VERIFIER_nondet_int() [L249] COND TRUE \read(tmp___2) [L437] systemActive = 1 VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=0, systemActive=1, waterLevel=2] [L289] COND FALSE !(\read(pumpRunning)) VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=0, systemActive=1, waterLevel=2] [L296] COND TRUE \read(systemActive) [L318] int tmp ; VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=0, systemActive=1, waterLevel=2] [L321] COND TRUE ! pumpRunning [L415] int retValue_acc ; [L416] int tmp ; [L417] int tmp___0 ; [L522] int retValue_acc ; VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=0, systemActive=1, waterLevel=2] [L525] COND FALSE !(waterLevel < 2) [L529] retValue_acc = 0 [L530] return (retValue_acc); VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=0, systemActive=1, waterLevel=2] [L421] tmp = isHighWaterSensorDry() [L423] COND FALSE !(\read(tmp)) [L426] tmp___0 = 1 VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=0, systemActive=1, waterLevel=2] [L428] retValue_acc = tmp___0 [L429] return (retValue_acc); VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=0, systemActive=1, waterLevel=2] [L323] tmp = isHighWaterLevel() [L325] COND TRUE \read(tmp) [L346] pumpRunning = 1 VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=1, systemActive=1, waterLevel=2] [L44] int tmp ; [L45] int tmp___0 ; [L513] int retValue_acc ; [L516] retValue_acc = waterLevel [L517] return (retValue_acc); VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=1, systemActive=1, waterLevel=2] [L49] tmp = getWaterLevel() [L51] COND FALSE !(tmp == 0) VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=1, systemActive=1, waterLevel=2] [L219] COND TRUE 1 VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=1, systemActive=1, waterLevel=2] [L221] COND TRUE splverifierCounter < 4 VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=1, systemActive=1, waterLevel=2] [L227] tmp = __VERIFIER_nondet_int() [L229] COND FALSE !(\read(tmp)) VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=1, systemActive=1, waterLevel=2] [L237] tmp___0 = __VERIFIER_nondet_int() [L239] COND FALSE !(\read(tmp___0)) VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=1, systemActive=1, waterLevel=2] [L247] tmp___2 = __VERIFIER_nondet_int() [L249] COND TRUE \read(tmp___2) [L437] systemActive = 1 VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=1, systemActive=1, waterLevel=2] [L289] COND TRUE \read(pumpRunning) VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=1, systemActive=1, waterLevel=2] [L448] COND TRUE waterLevel > 0 [L449] waterLevel = waterLevel - 1 VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=1, systemActive=1, waterLevel=1] [L296] COND TRUE \read(systemActive) [L318] int tmp ; VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=1, systemActive=1, waterLevel=1] [L321] COND FALSE !(! pumpRunning) VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=1, systemActive=1, waterLevel=1] [L44] int tmp ; [L45] int tmp___0 ; [L513] int retValue_acc ; [L516] retValue_acc = waterLevel [L517] return (retValue_acc); VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=1, systemActive=1, waterLevel=1] [L49] tmp = getWaterLevel() [L51] COND FALSE !(tmp == 0) VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=1, systemActive=1, waterLevel=1] [L219] COND TRUE 1 VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=1, systemActive=1, waterLevel=1] [L221] COND TRUE splverifierCounter < 4 VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=1, systemActive=1, waterLevel=1] [L227] tmp = __VERIFIER_nondet_int() [L229] COND FALSE !(\read(tmp)) VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=1, systemActive=1, waterLevel=1] [L237] tmp___0 = __VERIFIER_nondet_int() [L239] COND FALSE !(\read(tmp___0)) VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=1, systemActive=1, waterLevel=1] [L247] tmp___2 = __VERIFIER_nondet_int() [L249] COND TRUE \read(tmp___2) [L437] systemActive = 1 VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=1, systemActive=1, waterLevel=1] [L289] COND TRUE \read(pumpRunning) VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=1, systemActive=1, waterLevel=1] [L448] COND TRUE waterLevel > 0 [L449] waterLevel = waterLevel - 1 VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=1, systemActive=1, waterLevel=0] [L296] COND TRUE \read(systemActive) [L318] int tmp ; VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=1, systemActive=1, waterLevel=0] [L321] COND FALSE !(! pumpRunning) VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=1, systemActive=1, waterLevel=0] [L44] int tmp ; [L45] int tmp___0 ; [L513] int retValue_acc ; [L516] retValue_acc = waterLevel [L517] return (retValue_acc); VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=1, systemActive=1, waterLevel=0] [L49] tmp = getWaterLevel() [L51] COND TRUE tmp == 0 [L370] int retValue_acc ; [L373] retValue_acc = pumpRunning [L374] return (retValue_acc); VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=1, systemActive=1, waterLevel=0] [L53] tmp___0 = isPumpRunning() [L55] COND TRUE \read(tmp___0) VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=1, systemActive=1, waterLevel=0] [L540] __VERIFIER_error() VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=1, systemActive=1, waterLevel=0] - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 78 locations, 3 error locations. Result: UNSAFE, OverallTime: 3.0s, OverallIterations: 9, TraceHistogramMax: 3, AutomataDifference: 1.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 552 SDtfs, 1019 SDslu, 1121 SDs, 0 SdLazy, 205 SolverSat, 46 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.3s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 116 GetRequests, 69 SyntacticMatches, 0 SemanticMatches, 47 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 52 ImplicationChecksByTransitivity, 0.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=159occurred in iteration=8, 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, 8 MinimizatonAttempts, 428 StatesRemovedByMinimization, 5 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 0.6s InterpolantComputationTime, 330 NumberOfCodeBlocks, 330 NumberOfCodeBlocksAsserted, 10 NumberOfCheckSat, 261 ConstructedInterpolants, 0 QuantifiedInterpolants, 16395 SizeOfPredicates, 4 NumberOfNonLiveVariables, 379 ConjunctsInSsa, 6 ConjunctsInUnsatCore, 9 InterpolantComputations, 7 PerfectInterpolantSequences, 36/42 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...