./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/product-lines/minepump_spec1_product53.cil.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version f6fb2bb1 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_product53.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 c24c1e7ee4ec00cdeabebf427b1fca35e12bb483 ............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................. Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE --- Real Ultimate output --- This is Ultimate 0.1.24-f6fb2bb [2019-11-19 18:57:07,421 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-19 18:57:07,423 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-19 18:57:07,436 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-19 18:57:07,437 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-19 18:57:07,438 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-19 18:57:07,440 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-19 18:57:07,442 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-19 18:57:07,444 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-19 18:57:07,445 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-19 18:57:07,446 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-19 18:57:07,447 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-19 18:57:07,447 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-19 18:57:07,449 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-19 18:57:07,450 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-19 18:57:07,451 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-19 18:57:07,452 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-19 18:57:07,453 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-19 18:57:07,455 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-19 18:57:07,457 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-19 18:57:07,458 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-19 18:57:07,460 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-19 18:57:07,461 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-19 18:57:07,462 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-19 18:57:07,464 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-19 18:57:07,465 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-19 18:57:07,465 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-19 18:57:07,466 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-19 18:57:07,466 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-19 18:57:07,467 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-19 18:57:07,468 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-19 18:57:07,469 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-19 18:57:07,469 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-19 18:57:07,470 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-19 18:57:07,471 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-19 18:57:07,472 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-19 18:57:07,472 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-19 18:57:07,473 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-19 18:57:07,473 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-19 18:57:07,474 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-19 18:57:07,475 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-19 18:57:07,476 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2019-11-19 18:57:07,500 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-19 18:57:07,500 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-19 18:57:07,502 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-19 18:57:07,502 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-19 18:57:07,502 INFO L138 SettingsManager]: * Use SBE=true [2019-11-19 18:57:07,502 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-19 18:57:07,503 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-19 18:57:07,503 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-19 18:57:07,503 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-19 18:57:07,503 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-19 18:57:07,504 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-11-19 18:57:07,505 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-19 18:57:07,505 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-11-19 18:57:07,505 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-19 18:57:07,505 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-19 18:57:07,506 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-19 18:57:07,506 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-11-19 18:57:07,506 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-19 18:57:07,506 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-19 18:57:07,506 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-19 18:57:07,507 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-11-19 18:57:07,507 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-19 18:57:07,507 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-19 18:57:07,508 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-19 18:57:07,508 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-11-19 18:57:07,508 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-11-19 18:57:07,508 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-11-19 18:57:07,508 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-11-19 18:57:07,509 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 -> c24c1e7ee4ec00cdeabebf427b1fca35e12bb483 [2019-11-19 18:57:07,824 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-19 18:57:07,842 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-19 18:57:07,847 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-19 18:57:07,849 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-19 18:57:07,849 INFO L275 PluginConnector]: CDTParser initialized [2019-11-19 18:57:07,851 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/product-lines/minepump_spec1_product53.cil.c [2019-11-19 18:57:07,925 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d0e56f381/00dc4332449b4b9bac4611535ccdfc64/FLAG90c5298e8 [2019-11-19 18:57:08,511 INFO L306 CDTParser]: Found 1 translation units. [2019-11-19 18:57:08,512 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/product-lines/minepump_spec1_product53.cil.c [2019-11-19 18:57:08,524 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d0e56f381/00dc4332449b4b9bac4611535ccdfc64/FLAG90c5298e8 [2019-11-19 18:57:08,847 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d0e56f381/00dc4332449b4b9bac4611535ccdfc64 [2019-11-19 18:57:08,851 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-19 18:57:08,853 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-11-19 18:57:08,854 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-19 18:57:08,854 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-19 18:57:08,858 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-19 18:57:08,858 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 06:57:08" (1/1) ... [2019-11-19 18:57:08,864 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5097dbde and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 06:57:08, skipping insertion in model container [2019-11-19 18:57:08,864 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 06:57:08" (1/1) ... [2019-11-19 18:57:08,874 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-11-19 18:57:08,949 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-11-19 18:57:09,409 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-19 18:57:09,431 INFO L188 MainTranslator]: Completed pre-run [2019-11-19 18:57:09,531 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-19 18:57:09,569 INFO L192 MainTranslator]: Completed translation [2019-11-19 18:57:09,569 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 06:57:09 WrapperNode [2019-11-19 18:57:09,569 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-19 18:57:09,570 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-11-19 18:57:09,570 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-11-19 18:57:09,571 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-11-19 18:57:09,579 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 06:57:09" (1/1) ... [2019-11-19 18:57:09,599 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 06:57:09" (1/1) ... [2019-11-19 18:57:09,680 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-11-19 18:57:09,681 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-19 18:57:09,681 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-19 18:57:09,681 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-19 18:57:09,691 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 06:57:09" (1/1) ... [2019-11-19 18:57:09,691 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 06:57:09" (1/1) ... [2019-11-19 18:57:09,698 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 06:57:09" (1/1) ... [2019-11-19 18:57:09,699 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 06:57:09" (1/1) ... [2019-11-19 18:57:09,717 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 06:57:09" (1/1) ... [2019-11-19 18:57:09,730 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 06:57:09" (1/1) ... [2019-11-19 18:57:09,735 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 06:57:09" (1/1) ... [2019-11-19 18:57:09,743 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-19 18:57:09,744 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-19 18:57:09,744 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-19 18:57:09,744 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-19 18:57:09,745 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 06:57:09" (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-19 18:57:09,831 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-11-19 18:57:09,831 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2019-11-19 18:57:09,831 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-19 18:57:09,831 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-19 18:57:10,881 INFO L280 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-19 18:57:10,882 INFO L285 CfgBuilder]: Removed 276 assume(true) statements. [2019-11-19 18:57:10,883 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 06:57:10 BoogieIcfgContainer [2019-11-19 18:57:10,884 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-19 18:57:10,887 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-11-19 18:57:10,887 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-11-19 18:57:10,891 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-11-19 18:57:10,891 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 19.11 06:57:08" (1/3) ... [2019-11-19 18:57:10,893 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6b3ea53e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.11 06:57:10, skipping insertion in model container [2019-11-19 18:57:10,893 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 06:57:09" (2/3) ... [2019-11-19 18:57:10,894 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6b3ea53e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.11 06:57:10, skipping insertion in model container [2019-11-19 18:57:10,894 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 06:57:10" (3/3) ... [2019-11-19 18:57:10,898 INFO L109 eAbstractionObserver]: Analyzing ICFG minepump_spec1_product53.cil.c [2019-11-19 18:57:10,910 INFO L153 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-11-19 18:57:10,919 INFO L165 ceAbstractionStarter]: Appying trace abstraction to program that has 3 error locations. [2019-11-19 18:57:10,932 INFO L249 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2019-11-19 18:57:10,970 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-11-19 18:57:10,970 INFO L374 AbstractCegarLoop]: Hoare is true [2019-11-19 18:57:10,971 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-11-19 18:57:10,971 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-19 18:57:10,971 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-19 18:57:10,971 INFO L378 AbstractCegarLoop]: Difference is false [2019-11-19 18:57:10,972 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-19 18:57:10,972 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-11-19 18:57:11,005 INFO L276 IsEmpty]: Start isEmpty. Operand 189 states. [2019-11-19 18:57:11,015 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-11-19 18:57:11,015 INFO L402 BasicCegarLoop]: Found error trace [2019-11-19 18:57:11,016 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-19 18:57:11,018 INFO L410 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-19 18:57:11,026 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 18:57:11,027 INFO L82 PathProgramCache]: Analyzing trace with hash 2002794138, now seen corresponding path program 1 times [2019-11-19 18:57:11,037 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 18:57:11,038 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [800961878] [2019-11-19 18:57:11,038 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 18:57:11,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 18:57:11,314 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-19 18:57:11,315 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [800961878] [2019-11-19 18:57:11,316 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-19 18:57:11,317 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-19 18:57:11,318 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2087781605] [2019-11-19 18:57:11,324 INFO L442 AbstractCegarLoop]: Interpolant automaton has 2 states [2019-11-19 18:57:11,325 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-19 18:57:11,339 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2019-11-19 18:57:11,340 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-11-19 18:57:11,343 INFO L87 Difference]: Start difference. First operand 189 states. Second operand 2 states. [2019-11-19 18:57:11,404 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-19 18:57:11,404 INFO L93 Difference]: Finished difference Result 372 states and 569 transitions. [2019-11-19 18:57:11,405 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2019-11-19 18:57:11,406 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 16 [2019-11-19 18:57:11,407 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-19 18:57:11,421 INFO L225 Difference]: With dead ends: 372 [2019-11-19 18:57:11,422 INFO L226 Difference]: Without dead ends: 185 [2019-11-19 18:57:11,426 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-19 18:57:11,447 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 185 states. [2019-11-19 18:57:11,481 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 185 to 185. [2019-11-19 18:57:11,483 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 185 states. [2019-11-19 18:57:11,486 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 185 states to 185 states and 276 transitions. [2019-11-19 18:57:11,488 INFO L78 Accepts]: Start accepts. Automaton has 185 states and 276 transitions. Word has length 16 [2019-11-19 18:57:11,488 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-19 18:57:11,488 INFO L462 AbstractCegarLoop]: Abstraction has 185 states and 276 transitions. [2019-11-19 18:57:11,489 INFO L463 AbstractCegarLoop]: Interpolant automaton has 2 states. [2019-11-19 18:57:11,489 INFO L276 IsEmpty]: Start isEmpty. Operand 185 states and 276 transitions. [2019-11-19 18:57:11,490 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-11-19 18:57:11,490 INFO L402 BasicCegarLoop]: Found error trace [2019-11-19 18:57:11,490 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-19 18:57:11,491 INFO L410 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-19 18:57:11,491 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 18:57:11,491 INFO L82 PathProgramCache]: Analyzing trace with hash 956037241, now seen corresponding path program 1 times [2019-11-19 18:57:11,492 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 18:57:11,492 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [687672667] [2019-11-19 18:57:11,492 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 18:57:11,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 18:57:11,620 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-19 18:57:11,621 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [687672667] [2019-11-19 18:57:11,621 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-19 18:57:11,621 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-19 18:57:11,621 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2014509677] [2019-11-19 18:57:11,623 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-19 18:57:11,624 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-19 18:57:11,624 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-19 18:57:11,624 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-19 18:57:11,625 INFO L87 Difference]: Start difference. First operand 185 states and 276 transitions. Second operand 3 states. [2019-11-19 18:57:11,641 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-19 18:57:11,641 INFO L93 Difference]: Finished difference Result 185 states and 276 transitions. [2019-11-19 18:57:11,642 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-19 18:57:11,642 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 17 [2019-11-19 18:57:11,643 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-19 18:57:11,644 INFO L225 Difference]: With dead ends: 185 [2019-11-19 18:57:11,644 INFO L226 Difference]: Without dead ends: 71 [2019-11-19 18:57:11,646 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-19 18:57:11,646 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states. [2019-11-19 18:57:11,653 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 71. [2019-11-19 18:57:11,654 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 71 states. [2019-11-19 18:57:11,655 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 105 transitions. [2019-11-19 18:57:11,655 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 105 transitions. Word has length 17 [2019-11-19 18:57:11,655 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-19 18:57:11,656 INFO L462 AbstractCegarLoop]: Abstraction has 71 states and 105 transitions. [2019-11-19 18:57:11,656 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-19 18:57:11,656 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 105 transitions. [2019-11-19 18:57:11,657 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-11-19 18:57:11,657 INFO L402 BasicCegarLoop]: Found error trace [2019-11-19 18:57:11,658 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-19 18:57:11,658 INFO L410 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-19 18:57:11,658 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 18:57:11,659 INFO L82 PathProgramCache]: Analyzing trace with hash 748559286, now seen corresponding path program 1 times [2019-11-19 18:57:11,659 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 18:57:11,659 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1729234485] [2019-11-19 18:57:11,660 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 18:57:11,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 18:57:11,778 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-19 18:57:11,778 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1729234485] [2019-11-19 18:57:11,779 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-19 18:57:11,779 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-19 18:57:11,779 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2120153850] [2019-11-19 18:57:11,780 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-19 18:57:11,780 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-19 18:57:11,780 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-19 18:57:11,780 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-11-19 18:57:11,781 INFO L87 Difference]: Start difference. First operand 71 states and 105 transitions. Second operand 6 states. [2019-11-19 18:57:11,879 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-19 18:57:11,880 INFO L93 Difference]: Finished difference Result 136 states and 204 transitions. [2019-11-19 18:57:11,880 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-19 18:57:11,881 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 22 [2019-11-19 18:57:11,881 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-19 18:57:11,882 INFO L225 Difference]: With dead ends: 136 [2019-11-19 18:57:11,882 INFO L226 Difference]: Without dead ends: 71 [2019-11-19 18:57:11,883 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2019-11-19 18:57:11,884 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states. [2019-11-19 18:57:11,896 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 71. [2019-11-19 18:57:11,897 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 71 states. [2019-11-19 18:57:11,897 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 104 transitions. [2019-11-19 18:57:11,898 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 104 transitions. Word has length 22 [2019-11-19 18:57:11,898 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-19 18:57:11,898 INFO L462 AbstractCegarLoop]: Abstraction has 71 states and 104 transitions. [2019-11-19 18:57:11,898 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-19 18:57:11,899 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 104 transitions. [2019-11-19 18:57:11,900 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-11-19 18:57:11,901 INFO L402 BasicCegarLoop]: Found error trace [2019-11-19 18:57:11,901 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-19 18:57:11,902 INFO L410 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-19 18:57:11,902 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 18:57:11,902 INFO L82 PathProgramCache]: Analyzing trace with hash -682519882, now seen corresponding path program 1 times [2019-11-19 18:57:11,902 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 18:57:11,903 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1868278912] [2019-11-19 18:57:11,903 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 18:57:11,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 18:57:12,031 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-19 18:57:12,031 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1868278912] [2019-11-19 18:57:12,032 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-19 18:57:12,032 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-19 18:57:12,032 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [836388948] [2019-11-19 18:57:12,033 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-19 18:57:12,033 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-19 18:57:12,033 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-19 18:57:12,033 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-19 18:57:12,034 INFO L87 Difference]: Start difference. First operand 71 states and 104 transitions. Second operand 3 states. [2019-11-19 18:57:12,082 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-19 18:57:12,082 INFO L93 Difference]: Finished difference Result 145 states and 214 transitions. [2019-11-19 18:57:12,083 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-19 18:57:12,083 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 25 [2019-11-19 18:57:12,083 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-19 18:57:12,084 INFO L225 Difference]: With dead ends: 145 [2019-11-19 18:57:12,084 INFO L226 Difference]: Without dead ends: 80 [2019-11-19 18:57:12,085 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-19 18:57:12,086 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states. [2019-11-19 18:57:12,094 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 78. [2019-11-19 18:57:12,094 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 78 states. [2019-11-19 18:57:12,095 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 110 transitions. [2019-11-19 18:57:12,095 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 110 transitions. Word has length 25 [2019-11-19 18:57:12,096 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-19 18:57:12,096 INFO L462 AbstractCegarLoop]: Abstraction has 78 states and 110 transitions. [2019-11-19 18:57:12,096 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-19 18:57:12,096 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 110 transitions. [2019-11-19 18:57:12,097 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2019-11-19 18:57:12,097 INFO L402 BasicCegarLoop]: Found error trace [2019-11-19 18:57:12,097 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-19 18:57:12,098 INFO L410 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-19 18:57:12,098 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 18:57:12,098 INFO L82 PathProgramCache]: Analyzing trace with hash -1459548505, now seen corresponding path program 1 times [2019-11-19 18:57:12,098 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 18:57:12,099 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [721274560] [2019-11-19 18:57:12,099 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 18:57:12,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 18:57:12,183 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-19 18:57:12,183 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [721274560] [2019-11-19 18:57:12,184 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-19 18:57:12,184 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-19 18:57:12,184 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [586936495] [2019-11-19 18:57:12,186 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-19 18:57:12,186 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-19 18:57:12,186 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-19 18:57:12,187 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-19 18:57:12,187 INFO L87 Difference]: Start difference. First operand 78 states and 110 transitions. Second operand 5 states. [2019-11-19 18:57:12,301 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-19 18:57:12,302 INFO L93 Difference]: Finished difference Result 204 states and 285 transitions. [2019-11-19 18:57:12,302 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-19 18:57:12,302 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 31 [2019-11-19 18:57:12,302 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-19 18:57:12,304 INFO L225 Difference]: With dead ends: 204 [2019-11-19 18:57:12,304 INFO L226 Difference]: Without dead ends: 132 [2019-11-19 18:57:12,305 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-19 18:57:12,307 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 132 states. [2019-11-19 18:57:12,324 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 132 to 87. [2019-11-19 18:57:12,324 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 87 states. [2019-11-19 18:57:12,325 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 119 transitions. [2019-11-19 18:57:12,325 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 119 transitions. Word has length 31 [2019-11-19 18:57:12,326 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-19 18:57:12,327 INFO L462 AbstractCegarLoop]: Abstraction has 87 states and 119 transitions. [2019-11-19 18:57:12,327 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-19 18:57:12,328 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 119 transitions. [2019-11-19 18:57:12,328 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2019-11-19 18:57:12,329 INFO L402 BasicCegarLoop]: Found error trace [2019-11-19 18:57:12,329 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-19 18:57:12,330 INFO L410 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-19 18:57:12,330 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 18:57:12,330 INFO L82 PathProgramCache]: Analyzing trace with hash 1202962538, now seen corresponding path program 1 times [2019-11-19 18:57:12,330 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 18:57:12,331 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1252184713] [2019-11-19 18:57:12,331 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 18:57:12,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 18:57:12,438 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-19 18:57:12,439 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1252184713] [2019-11-19 18:57:12,439 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-19 18:57:12,439 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-19 18:57:12,439 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1606935265] [2019-11-19 18:57:12,440 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-19 18:57:12,440 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-19 18:57:12,440 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-19 18:57:12,441 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-19 18:57:12,441 INFO L87 Difference]: Start difference. First operand 87 states and 119 transitions. Second operand 5 states. [2019-11-19 18:57:12,545 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-19 18:57:12,545 INFO L93 Difference]: Finished difference Result 431 states and 600 transitions. [2019-11-19 18:57:12,545 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-11-19 18:57:12,546 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 31 [2019-11-19 18:57:12,546 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-19 18:57:12,548 INFO L225 Difference]: With dead ends: 431 [2019-11-19 18:57:12,548 INFO L226 Difference]: Without dead ends: 350 [2019-11-19 18:57:12,549 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-19 18:57:12,550 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 350 states. [2019-11-19 18:57:12,568 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 350 to 162. [2019-11-19 18:57:12,568 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 162 states. [2019-11-19 18:57:12,569 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 162 states to 162 states and 221 transitions. [2019-11-19 18:57:12,569 INFO L78 Accepts]: Start accepts. Automaton has 162 states and 221 transitions. Word has length 31 [2019-11-19 18:57:12,569 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-19 18:57:12,570 INFO L462 AbstractCegarLoop]: Abstraction has 162 states and 221 transitions. [2019-11-19 18:57:12,570 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-19 18:57:12,570 INFO L276 IsEmpty]: Start isEmpty. Operand 162 states and 221 transitions. [2019-11-19 18:57:12,571 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2019-11-19 18:57:12,571 INFO L402 BasicCegarLoop]: Found error trace [2019-11-19 18:57:12,572 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-19 18:57:12,572 INFO L410 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-19 18:57:12,572 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 18:57:12,572 INFO L82 PathProgramCache]: Analyzing trace with hash 552949620, now seen corresponding path program 1 times [2019-11-19 18:57:12,573 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 18:57:12,573 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1060901171] [2019-11-19 18:57:12,573 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 18:57:12,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 18:57:12,631 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-19 18:57:12,631 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1060901171] [2019-11-19 18:57:12,631 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-19 18:57:12,632 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-19 18:57:12,632 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [755406671] [2019-11-19 18:57:12,632 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-19 18:57:12,633 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-19 18:57:12,633 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-19 18:57:12,633 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-19 18:57:12,634 INFO L87 Difference]: Start difference. First operand 162 states and 221 transitions. Second operand 5 states. [2019-11-19 18:57:12,787 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-19 18:57:12,787 INFO L93 Difference]: Finished difference Result 470 states and 642 transitions. [2019-11-19 18:57:12,788 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-11-19 18:57:12,788 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 32 [2019-11-19 18:57:12,788 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-19 18:57:12,791 INFO L225 Difference]: With dead ends: 470 [2019-11-19 18:57:12,791 INFO L226 Difference]: Without dead ends: 468 [2019-11-19 18:57:12,792 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-19 18:57:12,792 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 468 states. [2019-11-19 18:57:12,808 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 468 to 162. [2019-11-19 18:57:12,808 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 162 states. [2019-11-19 18:57:12,809 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 162 states to 162 states and 220 transitions. [2019-11-19 18:57:12,809 INFO L78 Accepts]: Start accepts. Automaton has 162 states and 220 transitions. Word has length 32 [2019-11-19 18:57:12,809 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-19 18:57:12,810 INFO L462 AbstractCegarLoop]: Abstraction has 162 states and 220 transitions. [2019-11-19 18:57:12,810 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-19 18:57:12,810 INFO L276 IsEmpty]: Start isEmpty. Operand 162 states and 220 transitions. [2019-11-19 18:57:12,811 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2019-11-19 18:57:12,811 INFO L402 BasicCegarLoop]: Found error trace [2019-11-19 18:57:12,811 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-19 18:57:12,812 INFO L410 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-19 18:57:12,812 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 18:57:12,812 INFO L82 PathProgramCache]: Analyzing trace with hash 1792378863, now seen corresponding path program 1 times [2019-11-19 18:57:12,813 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 18:57:12,813 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [458399810] [2019-11-19 18:57:12,813 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 18:57:12,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 18:57:12,872 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-19 18:57:12,873 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [458399810] [2019-11-19 18:57:12,873 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-19 18:57:12,873 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-11-19 18:57:12,873 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1344960107] [2019-11-19 18:57:12,874 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-19 18:57:12,874 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-19 18:57:12,874 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-19 18:57:12,875 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-11-19 18:57:12,875 INFO L87 Difference]: Start difference. First operand 162 states and 220 transitions. Second operand 6 states. [2019-11-19 18:57:13,007 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-19 18:57:13,009 INFO L93 Difference]: Finished difference Result 428 states and 574 transitions. [2019-11-19 18:57:13,010 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-11-19 18:57:13,010 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 32 [2019-11-19 18:57:13,010 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-19 18:57:13,013 INFO L225 Difference]: With dead ends: 428 [2019-11-19 18:57:13,013 INFO L226 Difference]: Without dead ends: 272 [2019-11-19 18:57:13,014 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-19 18:57:13,015 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 272 states. [2019-11-19 18:57:13,036 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 272 to 174. [2019-11-19 18:57:13,036 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 174 states. [2019-11-19 18:57:13,037 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 174 states to 174 states and 232 transitions. [2019-11-19 18:57:13,037 INFO L78 Accepts]: Start accepts. Automaton has 174 states and 232 transitions. Word has length 32 [2019-11-19 18:57:13,038 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-19 18:57:13,038 INFO L462 AbstractCegarLoop]: Abstraction has 174 states and 232 transitions. [2019-11-19 18:57:13,038 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-19 18:57:13,038 INFO L276 IsEmpty]: Start isEmpty. Operand 174 states and 232 transitions. [2019-11-19 18:57:13,072 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2019-11-19 18:57:13,072 INFO L402 BasicCegarLoop]: Found error trace [2019-11-19 18:57:13,072 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-19 18:57:13,072 INFO L410 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-19 18:57:13,077 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 18:57:13,077 INFO L82 PathProgramCache]: Analyzing trace with hash 2050544301, now seen corresponding path program 1 times [2019-11-19 18:57:13,077 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 18:57:13,078 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1686766993] [2019-11-19 18:57:13,078 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 18:57:13,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 18:57:13,143 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-19 18:57:13,143 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1686766993] [2019-11-19 18:57:13,143 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-19 18:57:13,144 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-19 18:57:13,145 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1103075445] [2019-11-19 18:57:13,145 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-19 18:57:13,145 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-19 18:57:13,146 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-19 18:57:13,146 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-19 18:57:13,146 INFO L87 Difference]: Start difference. First operand 174 states and 232 transitions. Second operand 3 states. [2019-11-19 18:57:13,190 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-19 18:57:13,191 INFO L93 Difference]: Finished difference Result 394 states and 524 transitions. [2019-11-19 18:57:13,191 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-19 18:57:13,191 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 32 [2019-11-19 18:57:13,192 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-19 18:57:13,193 INFO L225 Difference]: With dead ends: 394 [2019-11-19 18:57:13,193 INFO L226 Difference]: Without dead ends: 226 [2019-11-19 18:57:13,194 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-19 18:57:13,194 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 226 states. [2019-11-19 18:57:13,214 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 226 to 226. [2019-11-19 18:57:13,214 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 226 states. [2019-11-19 18:57:13,215 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 226 states to 226 states and 294 transitions. [2019-11-19 18:57:13,215 INFO L78 Accepts]: Start accepts. Automaton has 226 states and 294 transitions. Word has length 32 [2019-11-19 18:57:13,215 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-19 18:57:13,215 INFO L462 AbstractCegarLoop]: Abstraction has 226 states and 294 transitions. [2019-11-19 18:57:13,216 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-19 18:57:13,216 INFO L276 IsEmpty]: Start isEmpty. Operand 226 states and 294 transitions. [2019-11-19 18:57:13,221 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2019-11-19 18:57:13,222 INFO L402 BasicCegarLoop]: Found error trace [2019-11-19 18:57:13,222 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-19 18:57:13,222 INFO L410 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-19 18:57:13,223 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 18:57:13,223 INFO L82 PathProgramCache]: Analyzing trace with hash 979497771, now seen corresponding path program 1 times [2019-11-19 18:57:13,223 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 18:57:13,223 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1797931947] [2019-11-19 18:57:13,224 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 18:57:13,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-19 18:57:13,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-19 18:57:13,932 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-19 18:57:13,933 INFO L475 BasicCegarLoop]: Counterexample might be feasible [2019-11-19 18:57:14,051 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 19.11 06:57:14 BoogieIcfgContainer [2019-11-19 18:57:14,051 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-11-19 18:57:14,052 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-11-19 18:57:14,052 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-11-19 18:57:14,052 INFO L275 PluginConnector]: Witness Printer initialized [2019-11-19 18:57:14,053 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 06:57:10" (3/4) ... [2019-11-19 18:57:14,055 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2019-11-19 18:57:14,234 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2019-11-19 18:57:14,234 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-11-19 18:57:14,240 INFO L168 Benchmark]: Toolchain (without parser) took 5383.39 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 212.9 MB). Free memory was 956.3 MB in the beginning and 1.0 GB in the end (delta: -44.0 MB). Peak memory consumption was 168.9 MB. Max. memory is 11.5 GB. [2019-11-19 18:57:14,241 INFO L168 Benchmark]: CDTParser took 0.22 ms. Allocated memory is still 1.0 GB. Free memory is still 981.8 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-19 18:57:14,242 INFO L168 Benchmark]: CACSL2BoogieTranslator took 716.04 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 132.6 MB). Free memory was 956.3 MB in the beginning and 1.1 GB in the end (delta: -157.8 MB). Peak memory consumption was 27.3 MB. Max. memory is 11.5 GB. [2019-11-19 18:57:14,242 INFO L168 Benchmark]: Boogie Procedure Inliner took 110.44 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.6 MB). Peak memory consumption was 6.6 MB. Max. memory is 11.5 GB. [2019-11-19 18:57:14,243 INFO L168 Benchmark]: Boogie Preprocessor took 62.35 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: 13.2 MB). Peak memory consumption was 13.2 MB. Max. memory is 11.5 GB. [2019-11-19 18:57:14,243 INFO L168 Benchmark]: RCFGBuilder took 1140.29 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 77.2 MB). Peak memory consumption was 77.2 MB. Max. memory is 11.5 GB. [2019-11-19 18:57:14,246 INFO L168 Benchmark]: TraceAbstraction took 3164.52 ms. Allocated memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 80.2 MB). Free memory was 1.0 GB in the beginning and 1.0 GB in the end (delta: 1.2 MB). Peak memory consumption was 81.4 MB. Max. memory is 11.5 GB. [2019-11-19 18:57:14,249 INFO L168 Benchmark]: Witness Printer took 182.64 ms. Allocated memory is still 1.2 GB. Free memory was 1.0 GB in the beginning and 1.0 GB in the end (delta: 15.5 MB). Peak memory consumption was 15.5 MB. Max. memory is 11.5 GB. [2019-11-19 18:57:14,252 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.22 ms. Allocated memory is still 1.0 GB. Free memory is still 981.8 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 716.04 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 132.6 MB). Free memory was 956.3 MB in the beginning and 1.1 GB in the end (delta: -157.8 MB). Peak memory consumption was 27.3 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 110.44 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.6 MB). Peak memory consumption was 6.6 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 62.35 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: 13.2 MB). Peak memory consumption was 13.2 MB. Max. memory is 11.5 GB. * RCFGBuilder took 1140.29 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 77.2 MB). Peak memory consumption was 77.2 MB. Max. memory is 11.5 GB. * TraceAbstraction took 3164.52 ms. Allocated memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 80.2 MB). Free memory was 1.0 GB in the beginning and 1.0 GB in the end (delta: 1.2 MB). Peak memory consumption was 81.4 MB. Max. memory is 11.5 GB. * Witness Printer took 182.64 ms. Allocated memory is still 1.2 GB. Free memory was 1.0 GB in the beginning and 1.0 GB in the end (delta: 15.5 MB). Peak memory consumption was 15.5 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 73]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L247] static struct __ACC__ERR *head = (struct __ACC__ERR *)0; [L444] int cleanupTimeShifts = 4; [L554] int pumpRunning = 0; [L555] int systemActive = 1; [L878] int waterLevel = 1; [L879] int methaneLevelCritical = 0; [L525] int retValue_acc ; [L526] int tmp ; VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=0, systemActive=1, waterLevel=1] [L868] int retValue_acc ; [L871] retValue_acc = 1 [L872] return (retValue_acc); VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=0, systemActive=1, waterLevel=1] [L532] tmp = valid_product() [L534] COND TRUE \read(tmp) VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=0, systemActive=1, waterLevel=1] [L778] int splverifierCounter ; [L779] int tmp ; [L780] int tmp___0 ; [L781] int tmp___1 ; [L782] int tmp___2 ; [L785] splverifierCounter = 0 VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=0, systemActive=1, waterLevel=1] [L787] COND TRUE 1 VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=0, systemActive=1, waterLevel=1] [L789] COND TRUE splverifierCounter < 4 VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=0, systemActive=1, waterLevel=1] [L795] tmp = __VERIFIER_nondet_int() [L797] COND TRUE \read(tmp) VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=0, systemActive=1, waterLevel=1] [L896] COND TRUE waterLevel < 2 [L897] waterLevel = waterLevel + 1 VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=0, systemActive=1, waterLevel=2] [L805] tmp___0 = __VERIFIER_nondet_int() [L807] COND TRUE \read(tmp___0) VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=0, systemActive=1, waterLevel=2] [L908] COND FALSE !(\read(methaneLevelCritical)) [L911] methaneLevelCritical = 1 VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=1, pumpRunning=0, systemActive=1, waterLevel=2] [L815] tmp___2 = __VERIFIER_nondet_int() [L817] COND TRUE \read(tmp___2) VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=1, pumpRunning=0, systemActive=1, waterLevel=2] [L561] COND FALSE !(\read(pumpRunning)) VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=1, pumpRunning=0, systemActive=1, waterLevel=2] [L568] COND TRUE \read(systemActive) [L642] int tmp ; VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=1, pumpRunning=0, systemActive=1, waterLevel=2] [L645] COND FALSE !(\read(pumpRunning)) [L616] int tmp ; VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=1, pumpRunning=0, systemActive=1, waterLevel=2] [L619] COND FALSE !(\read(pumpRunning)) [L590] int tmp ; VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=1, pumpRunning=0, systemActive=1, waterLevel=2] [L593] COND TRUE ! pumpRunning [L739] int retValue_acc ; [L740] int tmp ; [L741] int tmp___0 ; [L958] int retValue_acc ; VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=1, pumpRunning=0, systemActive=1, waterLevel=2] [L961] COND FALSE !(waterLevel < 2) [L965] retValue_acc = 0 [L966] return (retValue_acc); VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=1, pumpRunning=0, systemActive=1, waterLevel=2] [L745] tmp = isHighWaterSensorDry() [L747] COND FALSE !(\read(tmp)) [L750] tmp___0 = 1 VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=1, pumpRunning=0, systemActive=1, waterLevel=2] [L752] retValue_acc = tmp___0 [L753] return (retValue_acc); VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=1, pumpRunning=0, systemActive=1, waterLevel=2] [L595] tmp = isHighWaterLevel() [L597] COND TRUE \read(tmp) [L670] pumpRunning = 1 VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=1, pumpRunning=1, systemActive=1, waterLevel=2] [L44] int tmp ; [L45] int tmp___0 ; [L917] int retValue_acc ; [L920] retValue_acc = methaneLevelCritical [L921] return (retValue_acc); VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=1, pumpRunning=1, systemActive=1, waterLevel=2] [L49] tmp = isMethaneLevelCritical() [L51] COND TRUE \read(tmp) [L694] int retValue_acc ; [L697] retValue_acc = pumpRunning [L698] return (retValue_acc); VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=1, pumpRunning=1, systemActive=1, waterLevel=2] [L53] tmp___0 = isPumpRunning() [L55] COND TRUE \read(tmp___0) VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=1, pumpRunning=1, systemActive=1, waterLevel=2] [L73] __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, 189 locations, 3 error locations. Result: UNSAFE, OverallTime: 3.0s, OverallIterations: 10, TraceHistogramMax: 1, AutomataDifference: 0.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 1135 SDtfs, 1663 SDslu, 1257 SDs, 0 SdLazy, 203 SolverSat, 50 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.2s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 55 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=226occurred 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, 639 StatesRemovedByMinimization, 5 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.7s SatisfiabilityAnalysisTime, 0.5s InterpolantComputationTime, 271 NumberOfCodeBlocks, 271 NumberOfCodeBlocksAsserted, 10 NumberOfCheckSat, 229 ConstructedInterpolants, 0 QuantifiedInterpolants, 13180 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...