./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/forester-heap/sll-01-2.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 30f4e4ab Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx12G -Xms1G -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/forester-heap/sll-01-2.i -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 31de2fb67e84e52bb7705ac8720e6b139fef2d91 ....................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE --- Real Ultimate output --- This is Ultimate 0.1.24-30f4e4a [2019-11-27 23:54:45,495 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-27 23:54:45,497 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-27 23:54:45,514 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-27 23:54:45,514 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-27 23:54:45,516 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-27 23:54:45,518 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-27 23:54:45,521 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-27 23:54:45,523 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-27 23:54:45,524 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-27 23:54:45,525 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-27 23:54:45,526 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-27 23:54:45,527 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-27 23:54:45,528 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-27 23:54:45,529 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-27 23:54:45,530 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-27 23:54:45,531 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-27 23:54:45,532 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-27 23:54:45,534 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-27 23:54:45,536 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-27 23:54:45,537 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-27 23:54:45,539 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-27 23:54:45,540 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-27 23:54:45,541 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-27 23:54:45,543 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-27 23:54:45,543 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-27 23:54:45,543 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-27 23:54:45,544 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-27 23:54:45,545 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-27 23:54:45,545 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-27 23:54:45,546 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-27 23:54:45,546 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-27 23:54:45,547 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-27 23:54:45,548 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-27 23:54:45,549 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-27 23:54:45,549 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-27 23:54:45,550 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-27 23:54:45,550 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-27 23:54:45,550 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-27 23:54:45,551 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-27 23:54:45,552 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-27 23:54:45,553 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2019-11-27 23:54:45,567 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-27 23:54:45,568 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-27 23:54:45,569 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-27 23:54:45,569 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-27 23:54:45,569 INFO L138 SettingsManager]: * Use SBE=true [2019-11-27 23:54:45,569 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-27 23:54:45,570 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-27 23:54:45,570 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-27 23:54:45,570 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-27 23:54:45,570 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-27 23:54:45,570 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-11-27 23:54:45,571 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-27 23:54:45,571 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-11-27 23:54:45,571 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-27 23:54:45,571 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-27 23:54:45,572 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-27 23:54:45,572 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-11-27 23:54:45,572 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-27 23:54:45,572 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-27 23:54:45,573 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-27 23:54:45,573 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-11-27 23:54:45,573 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-27 23:54:45,573 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-27 23:54:45,573 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-27 23:54:45,574 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-11-27 23:54:45,574 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-11-27 23:54:45,574 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-11-27 23:54:45,574 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-11-27 23:54:45,575 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 -> 31de2fb67e84e52bb7705ac8720e6b139fef2d91 [2019-11-27 23:54:45,873 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-27 23:54:45,886 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-27 23:54:45,890 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-27 23:54:45,891 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-27 23:54:45,892 INFO L275 PluginConnector]: CDTParser initialized [2019-11-27 23:54:45,894 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/forester-heap/sll-01-2.i [2019-11-27 23:54:45,963 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/aa6af9b6b/0fdaabb593f040c5a4828c970c7161e6/FLAG3b818bb1f [2019-11-27 23:54:46,489 INFO L306 CDTParser]: Found 1 translation units. [2019-11-27 23:54:46,490 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/forester-heap/sll-01-2.i [2019-11-27 23:54:46,504 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/aa6af9b6b/0fdaabb593f040c5a4828c970c7161e6/FLAG3b818bb1f [2019-11-27 23:54:46,835 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/aa6af9b6b/0fdaabb593f040c5a4828c970c7161e6 [2019-11-27 23:54:46,838 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-27 23:54:46,840 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-11-27 23:54:46,840 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-27 23:54:46,841 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-27 23:54:46,844 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-27 23:54:46,845 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.11 11:54:46" (1/1) ... [2019-11-27 23:54:46,848 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@16abc7cd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 11:54:46, skipping insertion in model container [2019-11-27 23:54:46,848 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.11 11:54:46" (1/1) ... [2019-11-27 23:54:46,854 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-11-27 23:54:46,911 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-11-27 23:54:47,289 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-27 23:54:47,297 INFO L203 MainTranslator]: Completed pre-run [2019-11-27 23:54:47,346 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-27 23:54:47,399 INFO L208 MainTranslator]: Completed translation [2019-11-27 23:54:47,399 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 11:54:47 WrapperNode [2019-11-27 23:54:47,400 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-27 23:54:47,401 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-11-27 23:54:47,401 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-11-27 23:54:47,401 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-11-27 23:54:47,409 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 11:54:47" (1/1) ... [2019-11-27 23:54:47,426 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 11:54:47" (1/1) ... [2019-11-27 23:54:47,458 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-11-27 23:54:47,460 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-27 23:54:47,460 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-27 23:54:47,461 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-27 23:54:47,470 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 11:54:47" (1/1) ... [2019-11-27 23:54:47,471 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 11:54:47" (1/1) ... [2019-11-27 23:54:47,481 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 11:54:47" (1/1) ... [2019-11-27 23:54:47,482 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 11:54:47" (1/1) ... [2019-11-27 23:54:47,492 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 11:54:47" (1/1) ... [2019-11-27 23:54:47,502 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 11:54:47" (1/1) ... [2019-11-27 23:54:47,505 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 11:54:47" (1/1) ... [2019-11-27 23:54:47,509 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-27 23:54:47,510 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-27 23:54:47,510 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-27 23:54:47,510 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-27 23:54:47,511 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 11:54:47" (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-27 23:54:47,574 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2019-11-27 23:54:47,575 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2019-11-27 23:54:47,575 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2019-11-27 23:54:47,575 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-11-27 23:54:47,576 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-27 23:54:47,576 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-27 23:54:48,124 INFO L292 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-27 23:54:48,125 INFO L297 CfgBuilder]: Removed 34 assume(true) statements. [2019-11-27 23:54:48,126 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.11 11:54:48 BoogieIcfgContainer [2019-11-27 23:54:48,126 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-27 23:54:48,127 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-11-27 23:54:48,128 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-11-27 23:54:48,131 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-11-27 23:54:48,131 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 27.11 11:54:46" (1/3) ... [2019-11-27 23:54:48,132 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2c71c924 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.11 11:54:48, skipping insertion in model container [2019-11-27 23:54:48,132 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 11:54:47" (2/3) ... [2019-11-27 23:54:48,133 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2c71c924 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.11 11:54:48, skipping insertion in model container [2019-11-27 23:54:48,133 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.11 11:54:48" (3/3) ... [2019-11-27 23:54:48,135 INFO L109 eAbstractionObserver]: Analyzing ICFG sll-01-2.i [2019-11-27 23:54:48,146 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-11-27 23:54:48,156 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 13 error locations. [2019-11-27 23:54:48,168 INFO L249 AbstractCegarLoop]: Starting to check reachability of 13 error locations. [2019-11-27 23:54:48,199 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-11-27 23:54:48,199 INFO L374 AbstractCegarLoop]: Hoare is true [2019-11-27 23:54:48,200 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-11-27 23:54:48,200 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-27 23:54:48,200 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-27 23:54:48,200 INFO L378 AbstractCegarLoop]: Difference is false [2019-11-27 23:54:48,201 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-27 23:54:48,201 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-11-27 23:54:48,230 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states. [2019-11-27 23:54:48,238 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2019-11-27 23:54:48,238 INFO L402 BasicCegarLoop]: Found error trace [2019-11-27 23:54:48,239 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2019-11-27 23:54:48,241 INFO L410 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-27 23:54:48,247 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-27 23:54:48,247 INFO L82 PathProgramCache]: Analyzing trace with hash 925700, now seen corresponding path program 1 times [2019-11-27 23:54:48,257 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-27 23:54:48,257 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [557842519] [2019-11-27 23:54:48,258 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-27 23:54:48,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-27 23:54:48,415 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-27 23:54:48,416 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [557842519] [2019-11-27 23:54:48,417 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-27 23:54:48,417 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-27 23:54:48,420 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [938387923] [2019-11-27 23:54:48,425 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-27 23:54:48,425 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-27 23:54:48,444 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-27 23:54:48,445 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-27 23:54:48,447 INFO L87 Difference]: Start difference. First operand 84 states. Second operand 3 states. [2019-11-27 23:54:48,548 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-27 23:54:48,549 INFO L93 Difference]: Finished difference Result 182 states and 300 transitions. [2019-11-27 23:54:48,550 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-27 23:54:48,552 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 4 [2019-11-27 23:54:48,552 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-27 23:54:48,568 INFO L225 Difference]: With dead ends: 182 [2019-11-27 23:54:48,569 INFO L226 Difference]: Without dead ends: 96 [2019-11-27 23:54:48,576 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-27 23:54:48,601 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96 states. [2019-11-27 23:54:48,633 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96 to 78. [2019-11-27 23:54:48,636 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 78 states. [2019-11-27 23:54:48,647 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 88 transitions. [2019-11-27 23:54:48,649 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 88 transitions. Word has length 4 [2019-11-27 23:54:48,650 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-27 23:54:48,650 INFO L462 AbstractCegarLoop]: Abstraction has 78 states and 88 transitions. [2019-11-27 23:54:48,651 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-27 23:54:48,651 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 88 transitions. [2019-11-27 23:54:48,652 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2019-11-27 23:54:48,652 INFO L402 BasicCegarLoop]: Found error trace [2019-11-27 23:54:48,652 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-27 23:54:48,653 INFO L410 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-27 23:54:48,653 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-27 23:54:48,654 INFO L82 PathProgramCache]: Analyzing trace with hash 261454926, now seen corresponding path program 1 times [2019-11-27 23:54:48,654 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-27 23:54:48,655 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [336465115] [2019-11-27 23:54:48,655 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-27 23:54:48,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-27 23:54:48,733 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-27 23:54:48,733 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [336465115] [2019-11-27 23:54:48,734 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-27 23:54:48,735 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-27 23:54:48,735 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [483526487] [2019-11-27 23:54:48,737 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-27 23:54:48,738 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-27 23:54:48,738 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-27 23:54:48,738 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-27 23:54:48,738 INFO L87 Difference]: Start difference. First operand 78 states and 88 transitions. Second operand 3 states. [2019-11-27 23:54:48,765 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-27 23:54:48,767 INFO L93 Difference]: Finished difference Result 81 states and 91 transitions. [2019-11-27 23:54:48,768 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-27 23:54:48,768 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 10 [2019-11-27 23:54:48,769 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-27 23:54:48,771 INFO L225 Difference]: With dead ends: 81 [2019-11-27 23:54:48,772 INFO L226 Difference]: Without dead ends: 79 [2019-11-27 23:54:48,773 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-27 23:54:48,773 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79 states. [2019-11-27 23:54:48,786 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79 to 79. [2019-11-27 23:54:48,788 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 79 states. [2019-11-27 23:54:48,789 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 89 transitions. [2019-11-27 23:54:48,791 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 89 transitions. Word has length 10 [2019-11-27 23:54:48,791 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-27 23:54:48,791 INFO L462 AbstractCegarLoop]: Abstraction has 79 states and 89 transitions. [2019-11-27 23:54:48,792 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-27 23:54:48,792 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 89 transitions. [2019-11-27 23:54:48,792 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2019-11-27 23:54:48,793 INFO L402 BasicCegarLoop]: Found error trace [2019-11-27 23:54:48,793 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-27 23:54:48,794 INFO L410 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-27 23:54:48,794 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-27 23:54:48,794 INFO L82 PathProgramCache]: Analyzing trace with hash 261456848, now seen corresponding path program 1 times [2019-11-27 23:54:48,795 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-27 23:54:48,795 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [628378192] [2019-11-27 23:54:48,795 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-27 23:54:48,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-27 23:54:48,878 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-27 23:54:48,878 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [628378192] [2019-11-27 23:54:48,878 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-27 23:54:48,879 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-27 23:54:48,879 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [906332017] [2019-11-27 23:54:48,879 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-27 23:54:48,880 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-27 23:54:48,880 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-27 23:54:48,880 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-27 23:54:48,881 INFO L87 Difference]: Start difference. First operand 79 states and 89 transitions. Second operand 4 states. [2019-11-27 23:54:48,975 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-27 23:54:48,976 INFO L93 Difference]: Finished difference Result 80 states and 90 transitions. [2019-11-27 23:54:48,976 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-27 23:54:48,977 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 10 [2019-11-27 23:54:48,977 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-27 23:54:48,978 INFO L225 Difference]: With dead ends: 80 [2019-11-27 23:54:48,978 INFO L226 Difference]: Without dead ends: 78 [2019-11-27 23:54:48,979 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-27 23:54:48,979 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2019-11-27 23:54:48,984 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 76. [2019-11-27 23:54:48,985 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 76 states. [2019-11-27 23:54:48,985 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 86 transitions. [2019-11-27 23:54:48,985 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 86 transitions. Word has length 10 [2019-11-27 23:54:48,986 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-27 23:54:48,986 INFO L462 AbstractCegarLoop]: Abstraction has 76 states and 86 transitions. [2019-11-27 23:54:48,986 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-27 23:54:48,987 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 86 transitions. [2019-11-27 23:54:48,987 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-11-27 23:54:48,987 INFO L402 BasicCegarLoop]: Found error trace [2019-11-27 23:54:48,988 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-27 23:54:48,988 INFO L410 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-27 23:54:48,988 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-27 23:54:48,989 INFO L82 PathProgramCache]: Analyzing trace with hash 1712619113, now seen corresponding path program 1 times [2019-11-27 23:54:48,989 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-27 23:54:48,989 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1080616405] [2019-11-27 23:54:48,990 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-27 23:54:49,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-27 23:54:49,037 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-27 23:54:49,037 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1080616405] [2019-11-27 23:54:49,039 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-27 23:54:49,039 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-27 23:54:49,039 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1229560000] [2019-11-27 23:54:49,040 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-27 23:54:49,040 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-27 23:54:49,040 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-27 23:54:49,040 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-27 23:54:49,041 INFO L87 Difference]: Start difference. First operand 76 states and 86 transitions. Second operand 3 states. [2019-11-27 23:54:49,108 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-27 23:54:49,108 INFO L93 Difference]: Finished difference Result 79 states and 90 transitions. [2019-11-27 23:54:49,108 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-27 23:54:49,109 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 15 [2019-11-27 23:54:49,109 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-27 23:54:49,110 INFO L225 Difference]: With dead ends: 79 [2019-11-27 23:54:49,110 INFO L226 Difference]: Without dead ends: 75 [2019-11-27 23:54:49,110 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-27 23:54:49,111 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75 states. [2019-11-27 23:54:49,115 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 72. [2019-11-27 23:54:49,116 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 72 states. [2019-11-27 23:54:49,116 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 82 transitions. [2019-11-27 23:54:49,116 INFO L78 Accepts]: Start accepts. Automaton has 72 states and 82 transitions. Word has length 15 [2019-11-27 23:54:49,117 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-27 23:54:49,117 INFO L462 AbstractCegarLoop]: Abstraction has 72 states and 82 transitions. [2019-11-27 23:54:49,117 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-27 23:54:49,117 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 82 transitions. [2019-11-27 23:54:49,118 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-11-27 23:54:49,118 INFO L402 BasicCegarLoop]: Found error trace [2019-11-27 23:54:49,118 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-27 23:54:49,118 INFO L410 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-27 23:54:49,119 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-27 23:54:49,119 INFO L82 PathProgramCache]: Analyzing trace with hash 1551589151, now seen corresponding path program 1 times [2019-11-27 23:54:49,119 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-27 23:54:49,119 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [499267075] [2019-11-27 23:54:49,120 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-27 23:54:49,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-27 23:54:49,162 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-27 23:54:49,162 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [499267075] [2019-11-27 23:54:49,162 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-27 23:54:49,163 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-27 23:54:49,163 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1319481954] [2019-11-27 23:54:49,163 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-27 23:54:49,163 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-27 23:54:49,164 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-27 23:54:49,164 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-27 23:54:49,164 INFO L87 Difference]: Start difference. First operand 72 states and 82 transitions. Second operand 4 states. [2019-11-27 23:54:49,268 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-27 23:54:49,269 INFO L93 Difference]: Finished difference Result 190 states and 215 transitions. [2019-11-27 23:54:49,270 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-27 23:54:49,270 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 16 [2019-11-27 23:54:49,270 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-27 23:54:49,271 INFO L225 Difference]: With dead ends: 190 [2019-11-27 23:54:49,271 INFO L226 Difference]: Without dead ends: 126 [2019-11-27 23:54:49,272 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-27 23:54:49,273 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 126 states. [2019-11-27 23:54:49,279 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 126 to 74. [2019-11-27 23:54:49,279 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 74 states. [2019-11-27 23:54:49,279 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 84 transitions. [2019-11-27 23:54:49,280 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 84 transitions. Word has length 16 [2019-11-27 23:54:49,280 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-27 23:54:49,280 INFO L462 AbstractCegarLoop]: Abstraction has 74 states and 84 transitions. [2019-11-27 23:54:49,280 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-27 23:54:49,280 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 84 transitions. [2019-11-27 23:54:49,281 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-11-27 23:54:49,281 INFO L402 BasicCegarLoop]: Found error trace [2019-11-27 23:54:49,281 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-27 23:54:49,282 INFO L410 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-27 23:54:49,282 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-27 23:54:49,282 INFO L82 PathProgramCache]: Analyzing trace with hash -2063319775, now seen corresponding path program 1 times [2019-11-27 23:54:49,282 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-27 23:54:49,283 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [56312665] [2019-11-27 23:54:49,283 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-27 23:54:49,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-27 23:54:49,335 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-27 23:54:49,335 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [56312665] [2019-11-27 23:54:49,335 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-27 23:54:49,336 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-27 23:54:49,336 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1695363810] [2019-11-27 23:54:49,336 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-27 23:54:49,337 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-27 23:54:49,337 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-27 23:54:49,337 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-27 23:54:49,338 INFO L87 Difference]: Start difference. First operand 74 states and 84 transitions. Second operand 5 states. [2019-11-27 23:54:49,438 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-27 23:54:49,438 INFO L93 Difference]: Finished difference Result 134 states and 150 transitions. [2019-11-27 23:54:49,439 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-27 23:54:49,439 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 16 [2019-11-27 23:54:49,439 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-27 23:54:49,440 INFO L225 Difference]: With dead ends: 134 [2019-11-27 23:54:49,440 INFO L226 Difference]: Without dead ends: 114 [2019-11-27 23:54:49,441 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 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-27 23:54:49,442 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 114 states. [2019-11-27 23:54:49,447 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 114 to 73. [2019-11-27 23:54:49,447 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 73 states. [2019-11-27 23:54:49,448 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 83 transitions. [2019-11-27 23:54:49,448 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 83 transitions. Word has length 16 [2019-11-27 23:54:49,448 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-27 23:54:49,448 INFO L462 AbstractCegarLoop]: Abstraction has 73 states and 83 transitions. [2019-11-27 23:54:49,448 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-27 23:54:49,449 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 83 transitions. [2019-11-27 23:54:49,449 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2019-11-27 23:54:49,450 INFO L402 BasicCegarLoop]: Found error trace [2019-11-27 23:54:49,450 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] [2019-11-27 23:54:49,450 INFO L410 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-27 23:54:49,450 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-27 23:54:49,451 INFO L82 PathProgramCache]: Analyzing trace with hash -940628020, now seen corresponding path program 1 times [2019-11-27 23:54:49,451 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-27 23:54:49,451 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [772415729] [2019-11-27 23:54:49,451 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-27 23:54:49,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-27 23:54:49,501 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-27 23:54:49,502 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [772415729] [2019-11-27 23:54:49,502 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-27 23:54:49,502 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-27 23:54:49,502 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [958195077] [2019-11-27 23:54:49,507 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-27 23:54:49,507 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-27 23:54:49,507 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-27 23:54:49,508 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-27 23:54:49,508 INFO L87 Difference]: Start difference. First operand 73 states and 83 transitions. Second operand 3 states. [2019-11-27 23:54:49,534 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-27 23:54:49,534 INFO L93 Difference]: Finished difference Result 139 states and 159 transitions. [2019-11-27 23:54:49,535 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-27 23:54:49,535 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 20 [2019-11-27 23:54:49,535 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-27 23:54:49,536 INFO L225 Difference]: With dead ends: 139 [2019-11-27 23:54:49,536 INFO L226 Difference]: Without dead ends: 97 [2019-11-27 23:54:49,537 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-27 23:54:49,538 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 97 states. [2019-11-27 23:54:49,545 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 97 to 76. [2019-11-27 23:54:49,546 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 76 states. [2019-11-27 23:54:49,547 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 87 transitions. [2019-11-27 23:54:49,547 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 87 transitions. Word has length 20 [2019-11-27 23:54:49,547 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-27 23:54:49,547 INFO L462 AbstractCegarLoop]: Abstraction has 76 states and 87 transitions. [2019-11-27 23:54:49,547 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-27 23:54:49,548 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 87 transitions. [2019-11-27 23:54:49,548 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-11-27 23:54:49,548 INFO L402 BasicCegarLoop]: Found error trace [2019-11-27 23:54:49,549 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] [2019-11-27 23:54:49,549 INFO L410 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-27 23:54:49,549 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-27 23:54:49,549 INFO L82 PathProgramCache]: Analyzing trace with hash 905291998, now seen corresponding path program 1 times [2019-11-27 23:54:49,550 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-27 23:54:49,550 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [22314834] [2019-11-27 23:54:49,551 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-27 23:54:49,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-27 23:54:49,605 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-27 23:54:49,605 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [22314834] [2019-11-27 23:54:49,605 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-27 23:54:49,606 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-27 23:54:49,607 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1384181077] [2019-11-27 23:54:49,607 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-27 23:54:49,607 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-27 23:54:49,608 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-27 23:54:49,608 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-27 23:54:49,608 INFO L87 Difference]: Start difference. First operand 76 states and 87 transitions. Second operand 3 states. [2019-11-27 23:54:49,635 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-27 23:54:49,635 INFO L93 Difference]: Finished difference Result 76 states and 87 transitions. [2019-11-27 23:54:49,636 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-27 23:54:49,636 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 21 [2019-11-27 23:54:49,636 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-27 23:54:49,637 INFO L225 Difference]: With dead ends: 76 [2019-11-27 23:54:49,637 INFO L226 Difference]: Without dead ends: 74 [2019-11-27 23:54:49,637 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-27 23:54:49,638 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74 states. [2019-11-27 23:54:49,642 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74 to 74. [2019-11-27 23:54:49,643 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 74 states. [2019-11-27 23:54:49,643 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 85 transitions. [2019-11-27 23:54:49,643 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 85 transitions. Word has length 21 [2019-11-27 23:54:49,644 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-27 23:54:49,644 INFO L462 AbstractCegarLoop]: Abstraction has 74 states and 85 transitions. [2019-11-27 23:54:49,644 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-27 23:54:49,644 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 85 transitions. [2019-11-27 23:54:49,645 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2019-11-27 23:54:49,645 INFO L402 BasicCegarLoop]: Found error trace [2019-11-27 23:54:49,645 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-27 23:54:49,645 INFO L410 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-27 23:54:49,646 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-27 23:54:49,646 INFO L82 PathProgramCache]: Analyzing trace with hash 886650935, now seen corresponding path program 1 times [2019-11-27 23:54:49,646 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-27 23:54:49,646 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [996926379] [2019-11-27 23:54:49,647 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-27 23:54:49,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-27 23:54:49,699 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-27 23:54:49,699 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [996926379] [2019-11-27 23:54:49,699 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-27 23:54:49,700 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-27 23:54:49,700 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1014907211] [2019-11-27 23:54:49,700 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-27 23:54:49,701 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-27 23:54:49,701 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-27 23:54:49,701 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-27 23:54:49,701 INFO L87 Difference]: Start difference. First operand 74 states and 85 transitions. Second operand 4 states. [2019-11-27 23:54:49,773 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-27 23:54:49,773 INFO L93 Difference]: Finished difference Result 75 states and 86 transitions. [2019-11-27 23:54:49,774 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-27 23:54:49,774 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 23 [2019-11-27 23:54:49,774 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-27 23:54:49,775 INFO L225 Difference]: With dead ends: 75 [2019-11-27 23:54:49,775 INFO L226 Difference]: Without dead ends: 73 [2019-11-27 23:54:49,776 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-27 23:54:49,776 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states. [2019-11-27 23:54:49,780 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 72. [2019-11-27 23:54:49,780 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 72 states. [2019-11-27 23:54:49,781 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 83 transitions. [2019-11-27 23:54:49,781 INFO L78 Accepts]: Start accepts. Automaton has 72 states and 83 transitions. Word has length 23 [2019-11-27 23:54:49,782 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-27 23:54:49,782 INFO L462 AbstractCegarLoop]: Abstraction has 72 states and 83 transitions. [2019-11-27 23:54:49,782 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-27 23:54:49,782 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 83 transitions. [2019-11-27 23:54:49,783 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2019-11-27 23:54:49,783 INFO L402 BasicCegarLoop]: Found error trace [2019-11-27 23:54:49,784 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-27 23:54:49,784 INFO L410 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-27 23:54:49,784 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-27 23:54:49,785 INFO L82 PathProgramCache]: Analyzing trace with hash 1458355201, now seen corresponding path program 1 times [2019-11-27 23:54:49,785 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-27 23:54:49,785 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1965552934] [2019-11-27 23:54:49,785 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-27 23:54:49,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-27 23:54:49,885 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-27 23:54:49,885 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1965552934] [2019-11-27 23:54:49,885 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-27 23:54:49,886 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-11-27 23:54:49,886 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2077269331] [2019-11-27 23:54:49,886 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-27 23:54:49,886 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-27 23:54:49,887 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-27 23:54:49,887 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-11-27 23:54:49,887 INFO L87 Difference]: Start difference. First operand 72 states and 83 transitions. Second operand 6 states. [2019-11-27 23:54:50,126 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-27 23:54:50,126 INFO L93 Difference]: Finished difference Result 178 states and 205 transitions. [2019-11-27 23:54:50,127 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-11-27 23:54:50,127 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 24 [2019-11-27 23:54:50,127 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-27 23:54:50,128 INFO L225 Difference]: With dead ends: 178 [2019-11-27 23:54:50,128 INFO L226 Difference]: Without dead ends: 135 [2019-11-27 23:54:50,129 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=28, Invalid=44, Unknown=0, NotChecked=0, Total=72 [2019-11-27 23:54:50,129 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 135 states. [2019-11-27 23:54:50,134 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 135 to 82. [2019-11-27 23:54:50,135 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 82 states. [2019-11-27 23:54:50,135 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 82 states and 94 transitions. [2019-11-27 23:54:50,136 INFO L78 Accepts]: Start accepts. Automaton has 82 states and 94 transitions. Word has length 24 [2019-11-27 23:54:50,136 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-27 23:54:50,136 INFO L462 AbstractCegarLoop]: Abstraction has 82 states and 94 transitions. [2019-11-27 23:54:50,136 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-27 23:54:50,136 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 94 transitions. [2019-11-27 23:54:50,137 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2019-11-27 23:54:50,137 INFO L402 BasicCegarLoop]: Found error trace [2019-11-27 23:54:50,138 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-27 23:54:50,138 INFO L410 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-27 23:54:50,138 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-27 23:54:50,138 INFO L82 PathProgramCache]: Analyzing trace with hash 1357759361, now seen corresponding path program 1 times [2019-11-27 23:54:50,139 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-27 23:54:50,139 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1042218300] [2019-11-27 23:54:50,139 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-27 23:54:50,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-27 23:54:50,474 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-27 23:54:50,475 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1042218300] [2019-11-27 23:54:50,475 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-27 23:54:50,475 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-11-27 23:54:50,475 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [498634888] [2019-11-27 23:54:50,476 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-11-27 23:54:50,476 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-27 23:54:50,476 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-11-27 23:54:50,476 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2019-11-27 23:54:50,477 INFO L87 Difference]: Start difference. First operand 82 states and 94 transitions. Second operand 8 states. [2019-11-27 23:54:51,122 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-27 23:54:51,122 INFO L93 Difference]: Finished difference Result 190 states and 217 transitions. [2019-11-27 23:54:51,123 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-11-27 23:54:51,123 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 24 [2019-11-27 23:54:51,123 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-27 23:54:51,126 INFO L225 Difference]: With dead ends: 190 [2019-11-27 23:54:51,126 INFO L226 Difference]: Without dead ends: 188 [2019-11-27 23:54:51,127 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 36 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=87, Invalid=185, Unknown=0, NotChecked=0, Total=272 [2019-11-27 23:54:51,127 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 188 states. [2019-11-27 23:54:51,134 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 188 to 102. [2019-11-27 23:54:51,134 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 102 states. [2019-11-27 23:54:51,135 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102 states to 102 states and 120 transitions. [2019-11-27 23:54:51,135 INFO L78 Accepts]: Start accepts. Automaton has 102 states and 120 transitions. Word has length 24 [2019-11-27 23:54:51,135 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-27 23:54:51,136 INFO L462 AbstractCegarLoop]: Abstraction has 102 states and 120 transitions. [2019-11-27 23:54:51,136 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-11-27 23:54:51,136 INFO L276 IsEmpty]: Start isEmpty. Operand 102 states and 120 transitions. [2019-11-27 23:54:51,137 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2019-11-27 23:54:51,137 INFO L402 BasicCegarLoop]: Found error trace [2019-11-27 23:54:51,137 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-27 23:54:51,138 INFO L410 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-27 23:54:51,138 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-27 23:54:51,138 INFO L82 PathProgramCache]: Analyzing trace with hash -545310703, now seen corresponding path program 1 times [2019-11-27 23:54:51,138 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-27 23:54:51,139 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1043518527] [2019-11-27 23:54:51,139 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-27 23:54:51,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-27 23:54:51,189 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-11-27 23:54:51,189 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1043518527] [2019-11-27 23:54:51,189 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-27 23:54:51,190 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-27 23:54:51,190 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1323053994] [2019-11-27 23:54:51,190 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-27 23:54:51,191 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-27 23:54:51,191 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-27 23:54:51,191 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-11-27 23:54:51,191 INFO L87 Difference]: Start difference. First operand 102 states and 120 transitions. Second operand 5 states. [2019-11-27 23:54:51,302 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-27 23:54:51,303 INFO L93 Difference]: Finished difference Result 149 states and 174 transitions. [2019-11-27 23:54:51,303 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-27 23:54:51,303 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 26 [2019-11-27 23:54:51,304 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-27 23:54:51,304 INFO L225 Difference]: With dead ends: 149 [2019-11-27 23:54:51,305 INFO L226 Difference]: Without dead ends: 131 [2019-11-27 23:54:51,305 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2019-11-27 23:54:51,306 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 131 states. [2019-11-27 23:54:51,311 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 131 to 123. [2019-11-27 23:54:51,312 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 123 states. [2019-11-27 23:54:51,312 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 123 states to 123 states and 149 transitions. [2019-11-27 23:54:51,313 INFO L78 Accepts]: Start accepts. Automaton has 123 states and 149 transitions. Word has length 26 [2019-11-27 23:54:51,313 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-27 23:54:51,313 INFO L462 AbstractCegarLoop]: Abstraction has 123 states and 149 transitions. [2019-11-27 23:54:51,313 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-27 23:54:51,313 INFO L276 IsEmpty]: Start isEmpty. Operand 123 states and 149 transitions. [2019-11-27 23:54:51,314 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2019-11-27 23:54:51,314 INFO L402 BasicCegarLoop]: Found error trace [2019-11-27 23:54:51,315 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-27 23:54:51,315 INFO L410 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-27 23:54:51,315 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-27 23:54:51,315 INFO L82 PathProgramCache]: Analyzing trace with hash 1566334865, now seen corresponding path program 1 times [2019-11-27 23:54:51,316 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-27 23:54:51,316 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2087208529] [2019-11-27 23:54:51,316 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-27 23:54:51,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-27 23:54:51,353 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-11-27 23:54:51,353 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2087208529] [2019-11-27 23:54:51,353 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-27 23:54:51,353 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-27 23:54:51,354 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1374751248] [2019-11-27 23:54:51,354 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-27 23:54:51,354 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-27 23:54:51,354 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-27 23:54:51,355 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-27 23:54:51,356 INFO L87 Difference]: Start difference. First operand 123 states and 149 transitions. Second operand 3 states. [2019-11-27 23:54:51,397 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-27 23:54:51,398 INFO L93 Difference]: Finished difference Result 123 states and 149 transitions. [2019-11-27 23:54:51,399 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-27 23:54:51,399 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 26 [2019-11-27 23:54:51,400 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-27 23:54:51,400 INFO L225 Difference]: With dead ends: 123 [2019-11-27 23:54:51,400 INFO L226 Difference]: Without dead ends: 121 [2019-11-27 23:54:51,401 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-27 23:54:51,401 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 121 states. [2019-11-27 23:54:51,406 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 121 to 121. [2019-11-27 23:54:51,406 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 121 states. [2019-11-27 23:54:51,407 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 121 states to 121 states and 147 transitions. [2019-11-27 23:54:51,407 INFO L78 Accepts]: Start accepts. Automaton has 121 states and 147 transitions. Word has length 26 [2019-11-27 23:54:51,407 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-27 23:54:51,407 INFO L462 AbstractCegarLoop]: Abstraction has 121 states and 147 transitions. [2019-11-27 23:54:51,407 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-27 23:54:51,408 INFO L276 IsEmpty]: Start isEmpty. Operand 121 states and 147 transitions. [2019-11-27 23:54:51,408 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-11-27 23:54:51,409 INFO L402 BasicCegarLoop]: Found error trace [2019-11-27 23:54:51,409 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] [2019-11-27 23:54:51,409 INFO L410 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-27 23:54:51,409 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-27 23:54:51,409 INFO L82 PathProgramCache]: Analyzing trace with hash -988757936, now seen corresponding path program 1 times [2019-11-27 23:54:51,409 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-27 23:54:51,413 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1189528030] [2019-11-27 23:54:51,413 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-27 23:54:51,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-27 23:54:51,600 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-27 23:54:51,601 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1189528030] [2019-11-27 23:54:51,601 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-27 23:54:51,601 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-11-27 23:54:51,602 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1120141326] [2019-11-27 23:54:51,604 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-11-27 23:54:51,604 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-27 23:54:51,604 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-11-27 23:54:51,604 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2019-11-27 23:54:51,604 INFO L87 Difference]: Start difference. First operand 121 states and 147 transitions. Second operand 8 states. [2019-11-27 23:54:52,091 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-27 23:54:52,091 INFO L93 Difference]: Finished difference Result 285 states and 334 transitions. [2019-11-27 23:54:52,092 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-11-27 23:54:52,092 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 27 [2019-11-27 23:54:52,092 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-27 23:54:52,094 INFO L225 Difference]: With dead ends: 285 [2019-11-27 23:54:52,094 INFO L226 Difference]: Without dead ends: 283 [2019-11-27 23:54:52,095 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=61, Invalid=121, Unknown=0, NotChecked=0, Total=182 [2019-11-27 23:54:52,095 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 283 states. [2019-11-27 23:54:52,103 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 283 to 128. [2019-11-27 23:54:52,103 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 128 states. [2019-11-27 23:54:52,103 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 128 states to 128 states and 154 transitions. [2019-11-27 23:54:52,104 INFO L78 Accepts]: Start accepts. Automaton has 128 states and 154 transitions. Word has length 27 [2019-11-27 23:54:52,104 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-27 23:54:52,104 INFO L462 AbstractCegarLoop]: Abstraction has 128 states and 154 transitions. [2019-11-27 23:54:52,104 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-11-27 23:54:52,104 INFO L276 IsEmpty]: Start isEmpty. Operand 128 states and 154 transitions. [2019-11-27 23:54:52,105 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2019-11-27 23:54:52,105 INFO L402 BasicCegarLoop]: Found error trace [2019-11-27 23:54:52,106 INFO L410 BasicCegarLoop]: trace histogram [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, 1, 1] [2019-11-27 23:54:52,106 INFO L410 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-27 23:54:52,106 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-27 23:54:52,106 INFO L82 PathProgramCache]: Analyzing trace with hash 2026653164, now seen corresponding path program 1 times [2019-11-27 23:54:52,107 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-27 23:54:52,107 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1629400800] [2019-11-27 23:54:52,107 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-27 23:54:52,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-27 23:54:52,155 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-27 23:54:52,155 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1629400800] [2019-11-27 23:54:52,156 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1160423414] [2019-11-27 23:54:52,156 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-27 23:54:52,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-27 23:54:52,220 INFO L255 TraceCheckSpWp]: Trace formula consists of 93 conjuncts, 17 conjunts are in the unsatisfiable core [2019-11-27 23:54:52,226 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-27 23:54:52,294 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2019-11-27 23:54:52,294 INFO L508 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-27 23:54:52,303 INFO L588 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-27 23:54:52,308 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2019-11-27 23:54:52,308 INFO L508 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-27 23:54:52,321 INFO L588 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-27 23:54:52,321 INFO L508 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-27 23:54:52,321 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:26, output treesize:18 [2019-11-27 23:54:52,353 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-27 23:54:52,356 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2019-11-27 23:54:52,356 INFO L508 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-27 23:54:52,368 INFO L588 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-27 23:54:52,372 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-27 23:54:52,375 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2019-11-27 23:54:52,375 INFO L508 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-27 23:54:52,385 INFO L588 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-27 23:54:52,386 INFO L508 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-27 23:54:52,386 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:44, output treesize:36 [2019-11-27 23:54:52,439 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 10 [2019-11-27 23:54:52,439 INFO L508 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-27 23:54:52,447 INFO L588 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-27 23:54:52,451 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-27 23:54:52,452 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 22 treesize of output 10 [2019-11-27 23:54:52,452 INFO L508 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-27 23:54:52,456 INFO L588 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-27 23:54:52,457 INFO L508 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-27 23:54:52,457 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:43, output treesize:7 [2019-11-27 23:54:52,463 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-27 23:54:52,463 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-27 23:54:52,464 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 6] total 8 [2019-11-27 23:54:52,464 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1197180736] [2019-11-27 23:54:52,464 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-11-27 23:54:52,464 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-27 23:54:52,465 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-11-27 23:54:52,465 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2019-11-27 23:54:52,465 INFO L87 Difference]: Start difference. First operand 128 states and 154 transitions. Second operand 8 states. [2019-11-27 23:54:52,759 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-27 23:54:52,760 INFO L93 Difference]: Finished difference Result 232 states and 272 transitions. [2019-11-27 23:54:52,760 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-11-27 23:54:52,760 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 29 [2019-11-27 23:54:52,760 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-27 23:54:52,761 INFO L225 Difference]: With dead ends: 232 [2019-11-27 23:54:52,762 INFO L226 Difference]: Without dead ends: 170 [2019-11-27 23:54:52,762 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 27 SyntacticMatches, 1 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=42, Invalid=90, Unknown=0, NotChecked=0, Total=132 [2019-11-27 23:54:52,763 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 170 states. [2019-11-27 23:54:52,770 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 170 to 130. [2019-11-27 23:54:52,770 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 130 states. [2019-11-27 23:54:52,771 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 130 states to 130 states and 154 transitions. [2019-11-27 23:54:52,771 INFO L78 Accepts]: Start accepts. Automaton has 130 states and 154 transitions. Word has length 29 [2019-11-27 23:54:52,771 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-27 23:54:52,771 INFO L462 AbstractCegarLoop]: Abstraction has 130 states and 154 transitions. [2019-11-27 23:54:52,772 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-11-27 23:54:52,772 INFO L276 IsEmpty]: Start isEmpty. Operand 130 states and 154 transitions. [2019-11-27 23:54:52,772 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2019-11-27 23:54:52,773 INFO L402 BasicCegarLoop]: Found error trace [2019-11-27 23:54:52,773 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-27 23:54:52,977 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-27 23:54:52,977 INFO L410 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-27 23:54:52,977 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-27 23:54:52,978 INFO L82 PathProgramCache]: Analyzing trace with hash -2133518130, now seen corresponding path program 1 times [2019-11-27 23:54:52,978 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-27 23:54:52,978 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [639121931] [2019-11-27 23:54:52,979 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-27 23:54:52,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-27 23:54:53,121 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-27 23:54:53,122 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [639121931] [2019-11-27 23:54:53,122 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1931359106] [2019-11-27 23:54:53,122 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-27 23:54:53,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-27 23:54:53,176 INFO L255 TraceCheckSpWp]: Trace formula consists of 95 conjuncts, 22 conjunts are in the unsatisfiable core [2019-11-27 23:54:53,179 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-27 23:54:53,268 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 23:54:53,285 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 8 [2019-11-27 23:54:53,286 INFO L508 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-27 23:54:53,290 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2019-11-27 23:54:53,291 INFO L508 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-27 23:54:53,302 INFO L588 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-27 23:54:53,306 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2019-11-27 23:54:53,307 INFO L508 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-11-27 23:54:53,311 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 8 [2019-11-27 23:54:53,311 INFO L508 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-11-27 23:54:53,317 INFO L588 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-27 23:54:53,317 INFO L508 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 2 xjuncts. [2019-11-27 23:54:53,317 INFO L221 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:47, output treesize:9 [2019-11-27 23:54:53,336 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-27 23:54:53,336 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-11-27 23:54:53,337 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [7] total 12 [2019-11-27 23:54:53,337 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [877232062] [2019-11-27 23:54:53,337 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-11-27 23:54:53,338 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-27 23:54:53,338 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-11-27 23:54:53,339 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=106, Unknown=0, NotChecked=0, Total=132 [2019-11-27 23:54:53,339 INFO L87 Difference]: Start difference. First operand 130 states and 154 transitions. Second operand 7 states. [2019-11-27 23:54:53,684 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-27 23:54:53,684 INFO L93 Difference]: Finished difference Result 193 states and 218 transitions. [2019-11-27 23:54:53,685 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-11-27 23:54:53,685 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 29 [2019-11-27 23:54:53,685 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-27 23:54:53,686 INFO L225 Difference]: With dead ends: 193 [2019-11-27 23:54:53,686 INFO L226 Difference]: Without dead ends: 173 [2019-11-27 23:54:53,687 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 25 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=48, Invalid=192, Unknown=0, NotChecked=0, Total=240 [2019-11-27 23:54:53,688 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 173 states. [2019-11-27 23:54:53,696 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 173 to 129. [2019-11-27 23:54:53,696 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 129 states. [2019-11-27 23:54:53,696 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 129 states to 129 states and 152 transitions. [2019-11-27 23:54:53,697 INFO L78 Accepts]: Start accepts. Automaton has 129 states and 152 transitions. Word has length 29 [2019-11-27 23:54:53,697 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-27 23:54:53,697 INFO L462 AbstractCegarLoop]: Abstraction has 129 states and 152 transitions. [2019-11-27 23:54:53,697 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-11-27 23:54:53,697 INFO L276 IsEmpty]: Start isEmpty. Operand 129 states and 152 transitions. [2019-11-27 23:54:53,698 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2019-11-27 23:54:53,698 INFO L402 BasicCegarLoop]: Found error trace [2019-11-27 23:54:53,698 INFO L410 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1] [2019-11-27 23:54:53,899 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-27 23:54:53,902 INFO L410 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-27 23:54:53,902 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-27 23:54:53,902 INFO L82 PathProgramCache]: Analyzing trace with hash 830518973, now seen corresponding path program 1 times [2019-11-27 23:54:53,903 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-27 23:54:53,903 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1787219345] [2019-11-27 23:54:53,903 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-27 23:54:53,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-27 23:54:54,042 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-27 23:54:54,043 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1787219345] [2019-11-27 23:54:54,043 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [399611729] [2019-11-27 23:54:54,043 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-27 23:54:54,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-27 23:54:54,126 INFO L255 TraceCheckSpWp]: Trace formula consists of 109 conjuncts, 22 conjunts are in the unsatisfiable core [2019-11-27 23:54:54,132 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-27 23:54:54,141 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2019-11-27 23:54:54,141 INFO L508 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-27 23:54:54,149 INFO L588 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-27 23:54:54,149 INFO L508 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-27 23:54:54,150 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:13, output treesize:9 [2019-11-27 23:54:54,228 INFO L404 ElimStorePlain]: Different costs {0=[|#memory_$Pointer$.base|], 2=[|#memory_$Pointer$.offset|]} [2019-11-27 23:54:54,232 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2019-11-27 23:54:54,233 INFO L508 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-27 23:54:54,243 INFO L588 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-27 23:54:54,256 INFO L343 Elim1Store]: treesize reduction 9, result has 10.0 percent of original size [2019-11-27 23:54:54,256 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 24 treesize of output 10 [2019-11-27 23:54:54,257 INFO L508 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-27 23:54:54,260 INFO L588 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-27 23:54:54,260 INFO L508 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-27 23:54:54,261 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:38, output treesize:7 [2019-11-27 23:54:54,264 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-27 23:54:54,264 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-27 23:54:54,264 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 7] total 10 [2019-11-27 23:54:54,264 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [520251109] [2019-11-27 23:54:54,265 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-11-27 23:54:54,265 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-27 23:54:54,265 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-11-27 23:54:54,265 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2019-11-27 23:54:54,266 INFO L87 Difference]: Start difference. First operand 129 states and 152 transitions. Second operand 10 states. [2019-11-27 23:54:54,554 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-27 23:54:54,555 INFO L93 Difference]: Finished difference Result 233 states and 265 transitions. [2019-11-27 23:54:54,555 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-11-27 23:54:54,555 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 32 [2019-11-27 23:54:54,555 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-27 23:54:54,556 INFO L225 Difference]: With dead ends: 233 [2019-11-27 23:54:54,556 INFO L226 Difference]: Without dead ends: 202 [2019-11-27 23:54:54,557 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=41, Invalid=115, Unknown=0, NotChecked=0, Total=156 [2019-11-27 23:54:54,557 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 202 states. [2019-11-27 23:54:54,564 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 202 to 146. [2019-11-27 23:54:54,564 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 146 states. [2019-11-27 23:54:54,565 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 146 states to 146 states and 177 transitions. [2019-11-27 23:54:54,565 INFO L78 Accepts]: Start accepts. Automaton has 146 states and 177 transitions. Word has length 32 [2019-11-27 23:54:54,565 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-27 23:54:54,565 INFO L462 AbstractCegarLoop]: Abstraction has 146 states and 177 transitions. [2019-11-27 23:54:54,565 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-11-27 23:54:54,566 INFO L276 IsEmpty]: Start isEmpty. Operand 146 states and 177 transitions. [2019-11-27 23:54:54,566 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2019-11-27 23:54:54,566 INFO L402 BasicCegarLoop]: Found error trace [2019-11-27 23:54:54,566 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-27 23:54:54,770 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-27 23:54:54,770 INFO L410 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-27 23:54:54,771 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-27 23:54:54,771 INFO L82 PathProgramCache]: Analyzing trace with hash -60835504, now seen corresponding path program 1 times [2019-11-27 23:54:54,772 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-27 23:54:54,772 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [837416349] [2019-11-27 23:54:54,772 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-27 23:54:54,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-27 23:54:54,807 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-27 23:54:54,807 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [837416349] [2019-11-27 23:54:54,807 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-27 23:54:54,807 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-27 23:54:54,808 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1291486392] [2019-11-27 23:54:54,808 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-27 23:54:54,808 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-27 23:54:54,808 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-27 23:54:54,808 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-27 23:54:54,808 INFO L87 Difference]: Start difference. First operand 146 states and 177 transitions. Second operand 3 states. [2019-11-27 23:54:54,827 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-27 23:54:54,828 INFO L93 Difference]: Finished difference Result 308 states and 380 transitions. [2019-11-27 23:54:54,828 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-27 23:54:54,828 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 32 [2019-11-27 23:54:54,828 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-27 23:54:54,829 INFO L225 Difference]: With dead ends: 308 [2019-11-27 23:54:54,829 INFO L226 Difference]: Without dead ends: 214 [2019-11-27 23:54:54,830 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-27 23:54:54,830 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 214 states. [2019-11-27 23:54:54,838 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 214 to 171. [2019-11-27 23:54:54,839 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 171 states. [2019-11-27 23:54:54,839 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 171 states to 171 states and 207 transitions. [2019-11-27 23:54:54,840 INFO L78 Accepts]: Start accepts. Automaton has 171 states and 207 transitions. Word has length 32 [2019-11-27 23:54:54,840 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-27 23:54:54,840 INFO L462 AbstractCegarLoop]: Abstraction has 171 states and 207 transitions. [2019-11-27 23:54:54,840 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-27 23:54:54,840 INFO L276 IsEmpty]: Start isEmpty. Operand 171 states and 207 transitions. [2019-11-27 23:54:54,841 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2019-11-27 23:54:54,841 INFO L402 BasicCegarLoop]: Found error trace [2019-11-27 23:54:54,841 INFO L410 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-27 23:54:54,841 INFO L410 AbstractCegarLoop]: === Iteration 19 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-27 23:54:54,841 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-27 23:54:54,841 INFO L82 PathProgramCache]: Analyzing trace with hash 1562646056, now seen corresponding path program 1 times [2019-11-27 23:54:54,842 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-27 23:54:54,842 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [154870385] [2019-11-27 23:54:54,842 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-27 23:54:54,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-27 23:54:55,035 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-27 23:54:55,035 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [154870385] [2019-11-27 23:54:55,036 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1420064313] [2019-11-27 23:54:55,036 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-27 23:54:55,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-27 23:54:55,090 INFO L255 TraceCheckSpWp]: Trace formula consists of 115 conjuncts, 30 conjunts are in the unsatisfiable core [2019-11-27 23:54:55,093 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-27 23:54:55,100 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-11-27 23:54:55,100 INFO L508 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-27 23:54:55,109 INFO L588 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-27 23:54:55,109 INFO L508 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-27 23:54:55,110 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2019-11-27 23:54:55,118 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2019-11-27 23:54:55,118 INFO L508 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-27 23:54:55,130 INFO L588 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-27 23:54:55,134 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2019-11-27 23:54:55,135 INFO L508 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-27 23:54:55,144 INFO L588 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-27 23:54:55,144 INFO L508 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-27 23:54:55,144 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:35, output treesize:27 [2019-11-27 23:54:55,207 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-27 23:54:55,207 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 15 [2019-11-27 23:54:55,208 INFO L508 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-27 23:54:55,229 INFO L588 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-27 23:54:55,240 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-27 23:54:55,245 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 27 [2019-11-27 23:54:55,246 INFO L508 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-27 23:54:55,263 INFO L588 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-27 23:54:55,269 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-27 23:54:55,271 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 27 [2019-11-27 23:54:55,271 INFO L508 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-11-27 23:54:55,287 INFO L588 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-27 23:54:55,287 INFO L508 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-27 23:54:55,288 INFO L221 ElimStorePlain]: Needed 4 recursive calls to eliminate 4 variables, input treesize:86, output treesize:47 [2019-11-27 23:54:55,327 INFO L404 ElimStorePlain]: Different costs {6=[|v_#memory_$Pointer$.offset_37|], 12=[|v_#memory_$Pointer$.base_36|]} [2019-11-27 23:54:55,332 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-27 23:54:55,333 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 42 treesize of output 40 [2019-11-27 23:54:55,334 INFO L508 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-27 23:54:55,352 INFO L588 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-27 23:54:55,355 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-27 23:54:55,430 INFO L343 Elim1Store]: treesize reduction 46, result has 65.2 percent of original size [2019-11-27 23:54:55,430 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 5 case distinctions, treesize of input 74 treesize of output 124 [2019-11-27 23:54:55,432 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-27 23:54:55,433 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 23:54:55,434 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 23:54:55,436 INFO L508 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 3 xjuncts. [2019-11-27 23:54:55,512 INFO L588 ElimStorePlain]: treesize reduction 273, result has 22.2 percent of original size [2019-11-27 23:54:55,514 INFO L508 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-27 23:54:55,514 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:94, output treesize:78 [2019-11-27 23:54:55,614 INFO L404 ElimStorePlain]: Different costs {6=[|#memory_$Pointer$.offset|], 10=[|#memory_$Pointer$.base|]} [2019-11-27 23:54:55,618 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-27 23:54:55,619 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 13 [2019-11-27 23:54:55,620 INFO L508 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-27 23:54:55,644 INFO L588 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-27 23:54:55,689 INFO L343 Elim1Store]: treesize reduction 10, result has 84.1 percent of original size [2019-11-27 23:54:55,690 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 5 new quantified variables, introduced 6 case distinctions, treesize of input 47 treesize of output 72 [2019-11-27 23:54:55,691 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-27 23:54:55,692 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-27 23:54:55,692 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-27 23:54:55,692 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-27 23:54:55,693 INFO L508 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-27 23:54:55,697 INFO L588 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-27 23:54:55,698 INFO L508 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-27 23:54:55,698 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:85, output treesize:7 [2019-11-27 23:54:55,714 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-27 23:54:55,714 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-27 23:54:55,714 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 13 [2019-11-27 23:54:55,714 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2058121126] [2019-11-27 23:54:55,715 INFO L442 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-11-27 23:54:55,715 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-27 23:54:55,715 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-11-27 23:54:55,716 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=116, Unknown=0, NotChecked=0, Total=156 [2019-11-27 23:54:55,716 INFO L87 Difference]: Start difference. First operand 171 states and 207 transitions. Second operand 13 states. [2019-11-27 23:54:56,784 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-27 23:54:56,784 INFO L93 Difference]: Finished difference Result 479 states and 569 transitions. [2019-11-27 23:54:56,786 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2019-11-27 23:54:56,786 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 36 [2019-11-27 23:54:56,786 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-27 23:54:56,788 INFO L225 Difference]: With dead ends: 479 [2019-11-27 23:54:56,788 INFO L226 Difference]: Without dead ends: 387 [2019-11-27 23:54:56,790 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 177 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=207, Invalid=605, Unknown=0, NotChecked=0, Total=812 [2019-11-27 23:54:56,791 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 387 states. [2019-11-27 23:54:56,803 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 387 to 205. [2019-11-27 23:54:56,803 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 205 states. [2019-11-27 23:54:56,804 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 205 states to 205 states and 247 transitions. [2019-11-27 23:54:56,804 INFO L78 Accepts]: Start accepts. Automaton has 205 states and 247 transitions. Word has length 36 [2019-11-27 23:54:56,805 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-27 23:54:56,805 INFO L462 AbstractCegarLoop]: Abstraction has 205 states and 247 transitions. [2019-11-27 23:54:56,805 INFO L463 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-11-27 23:54:56,805 INFO L276 IsEmpty]: Start isEmpty. Operand 205 states and 247 transitions. [2019-11-27 23:54:56,806 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2019-11-27 23:54:56,806 INFO L402 BasicCegarLoop]: Found error trace [2019-11-27 23:54:56,807 INFO L410 BasicCegarLoop]: trace histogram [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, 1, 1, 1] [2019-11-27 23:54:57,018 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-27 23:54:57,019 INFO L410 AbstractCegarLoop]: === Iteration 20 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-27 23:54:57,020 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-27 23:54:57,020 INFO L82 PathProgramCache]: Analyzing trace with hash -648373053, now seen corresponding path program 1 times [2019-11-27 23:54:57,021 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-27 23:54:57,021 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [595513069] [2019-11-27 23:54:57,021 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-27 23:54:57,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-27 23:54:57,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-27 23:54:57,068 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-27 23:54:57,068 INFO L475 BasicCegarLoop]: Counterexample might be feasible [2019-11-27 23:54:57,115 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 27.11 11:54:57 BoogieIcfgContainer [2019-11-27 23:54:57,115 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-11-27 23:54:57,116 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-11-27 23:54:57,116 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-11-27 23:54:57,116 INFO L275 PluginConnector]: Witness Printer initialized [2019-11-27 23:54:57,117 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.11 11:54:48" (3/4) ... [2019-11-27 23:54:57,119 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2019-11-27 23:54:57,186 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2019-11-27 23:54:57,186 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-11-27 23:54:57,188 INFO L168 Benchmark]: Toolchain (without parser) took 10348.72 ms. Allocated memory was 1.0 GB in the beginning and 1.3 GB in the end (delta: 276.8 MB). Free memory was 959.0 MB in the beginning and 877.7 MB in the end (delta: 81.3 MB). Peak memory consumption was 358.2 MB. Max. memory is 11.5 GB. [2019-11-27 23:54:57,188 INFO L168 Benchmark]: CDTParser took 0.30 ms. Allocated memory is still 1.0 GB. Free memory is still 987.2 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-27 23:54:57,189 INFO L168 Benchmark]: CACSL2BoogieTranslator took 559.72 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 149.4 MB). Free memory was 953.7 MB in the beginning and 1.1 GB in the end (delta: -172.8 MB). Peak memory consumption was 22.0 MB. Max. memory is 11.5 GB. [2019-11-27 23:54:57,189 INFO L168 Benchmark]: Boogie Procedure Inliner took 59.42 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.5 MB). Peak memory consumption was 6.5 MB. Max. memory is 11.5 GB. [2019-11-27 23:54:57,189 INFO L168 Benchmark]: Boogie Preprocessor took 48.96 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-27 23:54:57,190 INFO L168 Benchmark]: RCFGBuilder took 617.03 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: 36.9 MB). Peak memory consumption was 36.9 MB. Max. memory is 11.5 GB. [2019-11-27 23:54:57,190 INFO L168 Benchmark]: TraceAbstraction took 8987.93 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 127.4 MB). Free memory was 1.1 GB in the beginning and 877.7 MB in the end (delta: 205.3 MB). Peak memory consumption was 332.7 MB. Max. memory is 11.5 GB. [2019-11-27 23:54:57,191 INFO L168 Benchmark]: Witness Printer took 70.95 ms. Allocated memory is still 1.3 GB. Free memory is still 877.7 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-27 23:54:57,199 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.30 ms. Allocated memory is still 1.0 GB. Free memory is still 987.2 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 559.72 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 149.4 MB). Free memory was 953.7 MB in the beginning and 1.1 GB in the end (delta: -172.8 MB). Peak memory consumption was 22.0 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 59.42 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.5 MB). Peak memory consumption was 6.5 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 48.96 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 617.03 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: 36.9 MB). Peak memory consumption was 36.9 MB. Max. memory is 11.5 GB. * TraceAbstraction took 8987.93 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 127.4 MB). Free memory was 1.1 GB in the beginning and 877.7 MB in the end (delta: 205.3 MB). Peak memory consumption was 332.7 MB. Max. memory is 11.5 GB. * Witness Printer took 70.95 ms. Allocated memory is still 1.3 GB. Free memory is still 877.7 MB. There was no memory consumed. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 1025]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L991] SLL* list = malloc(sizeof(SLL)); [L992] list->next = ((void*)0) [L993] COND FALSE !(!(list != ((void*)0))) [L993] COND FALSE !(__VERIFIER_nondet_int()) [L993] list->inner = malloc(sizeof(SLL)) [L993] EXPR list->inner [L993] list->inner->next = ((void*)0) [L993] EXPR list->inner [L993] list->inner->inner = ((void*)0) [L993] EXPR list->inner [L993] EXPR list->inner != ((void*)0) || list->inner == ((void*)0) [L993] COND FALSE !(!(list->inner != ((void*)0) || list->inner == ((void*)0))) [L995] SLL* end = list; [L998] COND FALSE !(__VERIFIER_nondet_int()) [L1008] end = ((void*)0) [L1009] end = list [L1012] COND FALSE !(!(((void*)0) != end)) [L1014] COND TRUE ((void*)0) != end [L1016] int len = 0; [L1017] EXPR end->inner [L1017] SLL* inner = end->inner; [L1018] COND TRUE ((void*)0) != inner [L1020] COND TRUE len == 0 [L1021] len = 1 [L1024] COND FALSE !(!(((void*)0) != inner)) [L1025] EXPR inner->inner [L1025] COND FALSE !(!(((void*)0) == inner->inner)) [L1026] EXPR inner->next [L1026] COND FALSE !(!(((void*)0) == inner->next)) [L1027] EXPR inner->inner [L1027] inner = inner->inner [L1028] COND TRUE len == 1 [L1029] EXPR inner->inner [L1029] inner = inner->inner [L1018] COND TRUE ((void*)0) != inner [L1020] COND FALSE !(len == 0) [L1023] len = 2 [L1024] COND FALSE !(!(((void*)0) != inner)) [L1025] EXPR inner->inner [L1025] COND TRUE !(((void*)0) == inner->inner) [L1025] __VERIFIER_error() - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 84 locations, 13 error locations. Result: UNSAFE, OverallTime: 8.8s, OverallIterations: 20, TraceHistogramMax: 2, AutomataDifference: 4.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 1413 SDtfs, 2534 SDslu, 2750 SDs, 0 SdLazy, 1602 SolverSat, 242 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 2.1s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 269 GetRequests, 148 SyntacticMatches, 2 SemanticMatches, 119 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 286 ImplicationChecksByTransitivity, 2.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=205occurred in iteration=19, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.2s AutomataMinimizationTime, 19 MinimizatonAttempts, 805 StatesRemovedByMinimization, 16 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 2.6s InterpolantComputationTime, 582 NumberOfCodeBlocks, 582 NumberOfCodeBlocksAsserted, 24 NumberOfCheckSat, 523 ConstructedInterpolants, 10 QuantifiedInterpolants, 187056 SizeOfPredicates, 41 NumberOfNonLiveVariables, 412 ConjunctsInSsa, 91 ConjunctsInUnsatCore, 23 InterpolantComputations, 16 PerfectInterpolantSequences, 8/19 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...