./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/locks/test_locks_11.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 678e0110 Calling Ultimate with: /usr/lib/jvm/java-8-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/run_dir_8c77c0ed-60d8-44d1-92d8-02676e4d904c/bin/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/run_dir_8c77c0ed-60d8-44d1-92d8-02676e4d904c/bin/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_8c77c0ed-60d8-44d1-92d8-02676e4d904c/bin/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_8c77c0ed-60d8-44d1-92d8-02676e4d904c/bin/uautomizer/config/AutomizerReach.xml -i ../../sv-benchmarks/c/locks/test_locks_11.c -s /tmp/vcloud-vcloud-master/worker/run_dir_8c77c0ed-60d8-44d1-92d8-02676e4d904c/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_8c77c0ed-60d8-44d1-92d8-02676e4d904c/bin/uautomizer --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 56f043bec3037ec37b4a132611abd4a337934428 ...................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.24-678e011 [2019-11-19 22:59:23,322 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-19 22:59:23,324 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-19 22:59:23,337 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-19 22:59:23,337 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-19 22:59:23,338 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-19 22:59:23,340 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-19 22:59:23,342 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-19 22:59:23,344 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-19 22:59:23,345 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-19 22:59:23,347 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-19 22:59:23,351 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-19 22:59:23,352 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-19 22:59:23,355 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-19 22:59:23,357 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-19 22:59:23,358 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-19 22:59:23,360 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-19 22:59:23,363 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-19 22:59:23,366 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-19 22:59:23,371 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-19 22:59:23,374 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-19 22:59:23,375 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-19 22:59:23,377 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-19 22:59:23,378 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-19 22:59:23,380 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-19 22:59:23,380 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-19 22:59:23,381 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-19 22:59:23,382 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-19 22:59:23,382 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-19 22:59:23,383 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-19 22:59:23,383 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-19 22:59:23,384 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-19 22:59:23,385 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-19 22:59:23,385 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-19 22:59:23,391 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-19 22:59:23,391 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-19 22:59:23,392 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-19 22:59:23,392 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-19 22:59:23,393 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-19 22:59:23,394 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-19 22:59:23,396 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-19 22:59:23,396 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_8c77c0ed-60d8-44d1-92d8-02676e4d904c/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf [2019-11-19 22:59:23,417 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-19 22:59:23,418 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-19 22:59:23,419 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-19 22:59:23,420 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-19 22:59:23,420 INFO L138 SettingsManager]: * Use SBE=true [2019-11-19 22:59:23,420 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-19 22:59:23,421 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-19 22:59:23,421 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-19 22:59:23,422 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-19 22:59:23,422 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-19 22:59:23,423 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-11-19 22:59:23,423 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-19 22:59:23,424 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-11-19 22:59:23,424 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-19 22:59:23,424 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-19 22:59:23,425 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-19 22:59:23,425 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-11-19 22:59:23,425 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-19 22:59:23,425 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-19 22:59:23,426 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-19 22:59:23,426 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-11-19 22:59:23,426 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-19 22:59:23,427 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-19 22:59:23,427 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-19 22:59:23,427 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-11-19 22:59:23,427 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-11-19 22:59:23,428 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-11-19 22:59:23,428 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-11-19 22:59:23,428 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 -> /tmp/vcloud-vcloud-master/worker/run_dir_8c77c0ed-60d8-44d1-92d8-02676e4d904c/bin/uautomizer 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 -> 56f043bec3037ec37b4a132611abd4a337934428 [2019-11-19 22:59:23,585 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-19 22:59:23,595 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-19 22:59:23,600 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-19 22:59:23,602 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-19 22:59:23,609 INFO L275 PluginConnector]: CDTParser initialized [2019-11-19 22:59:23,610 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_8c77c0ed-60d8-44d1-92d8-02676e4d904c/bin/uautomizer/../../sv-benchmarks/c/locks/test_locks_11.c [2019-11-19 22:59:23,671 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_8c77c0ed-60d8-44d1-92d8-02676e4d904c/bin/uautomizer/data/9300e8a9c/544d710c6f6d4894a7f60c4249368983/FLAG92335a683 [2019-11-19 22:59:24,078 INFO L306 CDTParser]: Found 1 translation units. [2019-11-19 22:59:24,079 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_8c77c0ed-60d8-44d1-92d8-02676e4d904c/sv-benchmarks/c/locks/test_locks_11.c [2019-11-19 22:59:24,087 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_8c77c0ed-60d8-44d1-92d8-02676e4d904c/bin/uautomizer/data/9300e8a9c/544d710c6f6d4894a7f60c4249368983/FLAG92335a683 [2019-11-19 22:59:24,510 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_8c77c0ed-60d8-44d1-92d8-02676e4d904c/bin/uautomizer/data/9300e8a9c/544d710c6f6d4894a7f60c4249368983 [2019-11-19 22:59:24,513 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-19 22:59:24,515 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-11-19 22:59:24,516 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-19 22:59:24,516 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-19 22:59:24,519 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-19 22:59:24,520 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 10:59:24" (1/1) ... [2019-11-19 22:59:24,523 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@649f8f1a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 10:59:24, skipping insertion in model container [2019-11-19 22:59:24,523 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 10:59:24" (1/1) ... [2019-11-19 22:59:24,530 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-11-19 22:59:24,551 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-11-19 22:59:24,714 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-19 22:59:24,787 INFO L188 MainTranslator]: Completed pre-run [2019-11-19 22:59:24,824 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-19 22:59:24,844 INFO L192 MainTranslator]: Completed translation [2019-11-19 22:59:24,844 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 10:59:24 WrapperNode [2019-11-19 22:59:24,845 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-19 22:59:24,846 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-11-19 22:59:24,846 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-11-19 22:59:24,846 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-11-19 22:59:24,855 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 10:59:24" (1/1) ... [2019-11-19 22:59:24,865 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 10:59:24" (1/1) ... [2019-11-19 22:59:24,889 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-11-19 22:59:24,889 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-19 22:59:24,889 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-19 22:59:24,890 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-19 22:59:24,897 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 10:59:24" (1/1) ... [2019-11-19 22:59:24,897 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 10:59:24" (1/1) ... [2019-11-19 22:59:24,899 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 10:59:24" (1/1) ... [2019-11-19 22:59:24,899 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 10:59:24" (1/1) ... [2019-11-19 22:59:24,904 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 10:59:24" (1/1) ... [2019-11-19 22:59:24,911 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 10:59:24" (1/1) ... [2019-11-19 22:59:24,913 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 10:59:24" (1/1) ... [2019-11-19 22:59:24,916 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-19 22:59:24,916 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-19 22:59:24,917 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-19 22:59:24,917 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-19 22:59:24,918 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 10:59:24" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_8c77c0ed-60d8-44d1-92d8-02676e4d904c/bin/uautomizer/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-19 22:59:24,988 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-19 22:59:24,988 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-19 22:59:25,357 INFO L280 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-19 22:59:25,357 INFO L285 CfgBuilder]: Removed 5 assume(true) statements. [2019-11-19 22:59:25,359 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 10:59:25 BoogieIcfgContainer [2019-11-19 22:59:25,359 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-19 22:59:25,361 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-11-19 22:59:25,362 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-11-19 22:59:25,373 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-11-19 22:59:25,373 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 19.11 10:59:24" (1/3) ... [2019-11-19 22:59:25,374 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4737a1fa and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.11 10:59:25, skipping insertion in model container [2019-11-19 22:59:25,374 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 10:59:24" (2/3) ... [2019-11-19 22:59:25,375 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4737a1fa and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.11 10:59:25, skipping insertion in model container [2019-11-19 22:59:25,375 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 10:59:25" (3/3) ... [2019-11-19 22:59:25,376 INFO L109 eAbstractionObserver]: Analyzing ICFG test_locks_11.c [2019-11-19 22:59:25,385 INFO L153 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-11-19 22:59:25,391 INFO L165 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-11-19 22:59:25,400 INFO L249 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-11-19 22:59:25,425 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-11-19 22:59:25,425 INFO L374 AbstractCegarLoop]: Hoare is true [2019-11-19 22:59:25,425 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-11-19 22:59:25,425 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-19 22:59:25,426 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-19 22:59:25,426 INFO L378 AbstractCegarLoop]: Difference is false [2019-11-19 22:59:25,426 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-19 22:59:25,426 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-11-19 22:59:25,440 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states. [2019-11-19 22:59:25,446 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-11-19 22:59:25,447 INFO L402 BasicCegarLoop]: Found error trace [2019-11-19 22:59:25,448 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-19 22:59:25,448 INFO L410 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-19 22:59:25,454 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 22:59:25,454 INFO L82 PathProgramCache]: Analyzing trace with hash -233107426, now seen corresponding path program 1 times [2019-11-19 22:59:25,462 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 22:59:25,463 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1921204674] [2019-11-19 22:59:25,463 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 22:59:25,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 22:59:25,651 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-19 22:59:25,652 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1921204674] [2019-11-19 22:59:25,653 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-19 22:59:25,653 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-19 22:59:25,655 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1238363312] [2019-11-19 22:59:25,660 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-19 22:59:25,660 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-19 22:59:25,675 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-19 22:59:25,676 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-19 22:59:25,678 INFO L87 Difference]: Start difference. First operand 42 states. Second operand 3 states. [2019-11-19 22:59:25,738 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-19 22:59:25,738 INFO L93 Difference]: Finished difference Result 88 states and 156 transitions. [2019-11-19 22:59:25,740 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-19 22:59:25,741 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 17 [2019-11-19 22:59:25,741 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-19 22:59:25,752 INFO L225 Difference]: With dead ends: 88 [2019-11-19 22:59:25,753 INFO L226 Difference]: Without dead ends: 74 [2019-11-19 22:59:25,755 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-19 22:59:25,771 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74 states. [2019-11-19 22:59:25,790 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74 to 50. [2019-11-19 22:59:25,791 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 50 states. [2019-11-19 22:59:25,793 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 93 transitions. [2019-11-19 22:59:25,795 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 93 transitions. Word has length 17 [2019-11-19 22:59:25,795 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-19 22:59:25,795 INFO L462 AbstractCegarLoop]: Abstraction has 50 states and 93 transitions. [2019-11-19 22:59:25,796 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-19 22:59:25,796 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 93 transitions. [2019-11-19 22:59:25,797 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-11-19 22:59:25,797 INFO L402 BasicCegarLoop]: Found error trace [2019-11-19 22:59:25,797 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-19 22:59:25,797 INFO L410 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-19 22:59:25,798 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 22:59:25,798 INFO L82 PathProgramCache]: Analyzing trace with hash -1244224676, now seen corresponding path program 1 times [2019-11-19 22:59:25,798 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 22:59:25,799 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [132361063] [2019-11-19 22:59:25,799 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 22:59:25,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 22:59:25,870 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-19 22:59:25,870 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [132361063] [2019-11-19 22:59:25,871 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-19 22:59:25,871 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-19 22:59:25,871 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1935265687] [2019-11-19 22:59:25,873 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-19 22:59:25,874 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-19 22:59:25,874 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-19 22:59:25,874 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-19 22:59:25,875 INFO L87 Difference]: Start difference. First operand 50 states and 93 transitions. Second operand 3 states. [2019-11-19 22:59:25,907 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-19 22:59:25,907 INFO L93 Difference]: Finished difference Result 123 states and 228 transitions. [2019-11-19 22:59:25,911 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-19 22:59:25,911 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 17 [2019-11-19 22:59:25,911 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-19 22:59:25,913 INFO L225 Difference]: With dead ends: 123 [2019-11-19 22:59:25,913 INFO L226 Difference]: Without dead ends: 74 [2019-11-19 22:59:25,914 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-19 22:59:25,915 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74 states. [2019-11-19 22:59:25,928 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74 to 72. [2019-11-19 22:59:25,929 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 72 states. [2019-11-19 22:59:25,934 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 133 transitions. [2019-11-19 22:59:25,936 INFO L78 Accepts]: Start accepts. Automaton has 72 states and 133 transitions. Word has length 17 [2019-11-19 22:59:25,937 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-19 22:59:25,937 INFO L462 AbstractCegarLoop]: Abstraction has 72 states and 133 transitions. [2019-11-19 22:59:25,937 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-19 22:59:25,938 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 133 transitions. [2019-11-19 22:59:25,939 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-11-19 22:59:25,939 INFO L402 BasicCegarLoop]: Found error trace [2019-11-19 22:59:25,939 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-19 22:59:25,940 INFO L410 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-19 22:59:25,940 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 22:59:25,941 INFO L82 PathProgramCache]: Analyzing trace with hash 1363817409, now seen corresponding path program 1 times [2019-11-19 22:59:25,941 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 22:59:25,941 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1458161748] [2019-11-19 22:59:25,942 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 22:59:25,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 22:59:26,041 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-19 22:59:26,041 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1458161748] [2019-11-19 22:59:26,041 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-19 22:59:26,042 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-19 22:59:26,042 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [631637464] [2019-11-19 22:59:26,042 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-19 22:59:26,043 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-19 22:59:26,043 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-19 22:59:26,043 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-19 22:59:26,043 INFO L87 Difference]: Start difference. First operand 72 states and 133 transitions. Second operand 3 states. [2019-11-19 22:59:26,070 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-19 22:59:26,070 INFO L93 Difference]: Finished difference Result 113 states and 203 transitions. [2019-11-19 22:59:26,071 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-19 22:59:26,071 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 18 [2019-11-19 22:59:26,072 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-19 22:59:26,073 INFO L225 Difference]: With dead ends: 113 [2019-11-19 22:59:26,073 INFO L226 Difference]: Without dead ends: 77 [2019-11-19 22:59:26,074 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-19 22:59:26,075 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77 states. [2019-11-19 22:59:26,082 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 75. [2019-11-19 22:59:26,083 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 75 states. [2019-11-19 22:59:26,084 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 135 transitions. [2019-11-19 22:59:26,085 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 135 transitions. Word has length 18 [2019-11-19 22:59:26,085 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-19 22:59:26,085 INFO L462 AbstractCegarLoop]: Abstraction has 75 states and 135 transitions. [2019-11-19 22:59:26,085 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-19 22:59:26,086 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 135 transitions. [2019-11-19 22:59:26,087 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-11-19 22:59:26,087 INFO L402 BasicCegarLoop]: Found error trace [2019-11-19 22:59:26,087 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-19 22:59:26,087 INFO L410 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-19 22:59:26,088 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 22:59:26,088 INFO L82 PathProgramCache]: Analyzing trace with hash 83953731, now seen corresponding path program 1 times [2019-11-19 22:59:26,088 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 22:59:26,094 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1882716353] [2019-11-19 22:59:26,095 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 22:59:26,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 22:59:26,184 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-19 22:59:26,184 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1882716353] [2019-11-19 22:59:26,185 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-19 22:59:26,185 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-19 22:59:26,185 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2139239877] [2019-11-19 22:59:26,185 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-19 22:59:26,185 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-19 22:59:26,186 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-19 22:59:26,186 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-19 22:59:26,186 INFO L87 Difference]: Start difference. First operand 75 states and 135 transitions. Second operand 3 states. [2019-11-19 22:59:26,205 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-19 22:59:26,206 INFO L93 Difference]: Finished difference Result 144 states and 260 transitions. [2019-11-19 22:59:26,206 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-19 22:59:26,206 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 18 [2019-11-19 22:59:26,207 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-19 22:59:26,209 INFO L225 Difference]: With dead ends: 144 [2019-11-19 22:59:26,209 INFO L226 Difference]: Without dead ends: 142 [2019-11-19 22:59:26,209 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-19 22:59:26,210 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 142 states. [2019-11-19 22:59:26,226 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 142 to 100. [2019-11-19 22:59:26,226 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 100 states. [2019-11-19 22:59:26,228 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 180 transitions. [2019-11-19 22:59:26,228 INFO L78 Accepts]: Start accepts. Automaton has 100 states and 180 transitions. Word has length 18 [2019-11-19 22:59:26,229 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-19 22:59:26,229 INFO L462 AbstractCegarLoop]: Abstraction has 100 states and 180 transitions. [2019-11-19 22:59:26,229 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-19 22:59:26,229 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 180 transitions. [2019-11-19 22:59:26,230 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-11-19 22:59:26,230 INFO L402 BasicCegarLoop]: Found error trace [2019-11-19 22:59:26,231 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-19 22:59:26,231 INFO L410 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-19 22:59:26,231 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 22:59:26,231 INFO L82 PathProgramCache]: Analyzing trace with hash -927163519, now seen corresponding path program 1 times [2019-11-19 22:59:26,232 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 22:59:26,232 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [241855040] [2019-11-19 22:59:26,232 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 22:59:26,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 22:59:26,287 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-19 22:59:26,288 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [241855040] [2019-11-19 22:59:26,288 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-19 22:59:26,288 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-19 22:59:26,289 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2056081102] [2019-11-19 22:59:26,289 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-19 22:59:26,289 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-19 22:59:26,289 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-19 22:59:26,290 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-19 22:59:26,290 INFO L87 Difference]: Start difference. First operand 100 states and 180 transitions. Second operand 3 states. [2019-11-19 22:59:26,331 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-19 22:59:26,331 INFO L93 Difference]: Finished difference Result 240 states and 434 transitions. [2019-11-19 22:59:26,332 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-19 22:59:26,332 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 18 [2019-11-19 22:59:26,332 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-19 22:59:26,334 INFO L225 Difference]: With dead ends: 240 [2019-11-19 22:59:26,334 INFO L226 Difference]: Without dead ends: 144 [2019-11-19 22:59:26,335 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-19 22:59:26,336 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 144 states. [2019-11-19 22:59:26,358 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 144 to 142. [2019-11-19 22:59:26,359 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 142 states. [2019-11-19 22:59:26,360 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 142 states to 142 states and 254 transitions. [2019-11-19 22:59:26,360 INFO L78 Accepts]: Start accepts. Automaton has 142 states and 254 transitions. Word has length 18 [2019-11-19 22:59:26,361 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-19 22:59:26,361 INFO L462 AbstractCegarLoop]: Abstraction has 142 states and 254 transitions. [2019-11-19 22:59:26,367 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-19 22:59:26,368 INFO L276 IsEmpty]: Start isEmpty. Operand 142 states and 254 transitions. [2019-11-19 22:59:26,369 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-11-19 22:59:26,369 INFO L402 BasicCegarLoop]: Found error trace [2019-11-19 22:59:26,369 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-19 22:59:26,369 INFO L410 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-19 22:59:26,369 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 22:59:26,370 INFO L82 PathProgramCache]: Analyzing trace with hash -1692188271, now seen corresponding path program 1 times [2019-11-19 22:59:26,370 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 22:59:26,370 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1692989103] [2019-11-19 22:59:26,370 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 22:59:26,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 22:59:26,411 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-19 22:59:26,412 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1692989103] [2019-11-19 22:59:26,412 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-19 22:59:26,412 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-19 22:59:26,413 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1097286651] [2019-11-19 22:59:26,413 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-19 22:59:26,413 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-19 22:59:26,413 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-19 22:59:26,414 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-19 22:59:26,414 INFO L87 Difference]: Start difference. First operand 142 states and 254 transitions. Second operand 3 states. [2019-11-19 22:59:26,430 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-19 22:59:26,431 INFO L93 Difference]: Finished difference Result 215 states and 381 transitions. [2019-11-19 22:59:26,431 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-19 22:59:26,431 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 19 [2019-11-19 22:59:26,432 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-19 22:59:26,433 INFO L225 Difference]: With dead ends: 215 [2019-11-19 22:59:26,433 INFO L226 Difference]: Without dead ends: 146 [2019-11-19 22:59:26,434 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-19 22:59:26,435 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 146 states. [2019-11-19 22:59:26,443 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 146 to 144. [2019-11-19 22:59:26,443 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 144 states. [2019-11-19 22:59:26,444 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 144 states to 144 states and 254 transitions. [2019-11-19 22:59:26,444 INFO L78 Accepts]: Start accepts. Automaton has 144 states and 254 transitions. Word has length 19 [2019-11-19 22:59:26,445 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-19 22:59:26,445 INFO L462 AbstractCegarLoop]: Abstraction has 144 states and 254 transitions. [2019-11-19 22:59:26,445 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-19 22:59:26,445 INFO L276 IsEmpty]: Start isEmpty. Operand 144 states and 254 transitions. [2019-11-19 22:59:26,446 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-11-19 22:59:26,446 INFO L402 BasicCegarLoop]: Found error trace [2019-11-19 22:59:26,447 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-19 22:59:26,447 INFO L410 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-19 22:59:26,447 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 22:59:26,447 INFO L82 PathProgramCache]: Analyzing trace with hash 1322915347, now seen corresponding path program 1 times [2019-11-19 22:59:26,448 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 22:59:26,448 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1199411655] [2019-11-19 22:59:26,448 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 22:59:26,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 22:59:26,472 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-19 22:59:26,473 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1199411655] [2019-11-19 22:59:26,473 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-19 22:59:26,473 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-19 22:59:26,473 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1275488147] [2019-11-19 22:59:26,474 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-19 22:59:26,474 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-19 22:59:26,474 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-19 22:59:26,474 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-19 22:59:26,475 INFO L87 Difference]: Start difference. First operand 144 states and 254 transitions. Second operand 3 states. [2019-11-19 22:59:26,499 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-19 22:59:26,499 INFO L93 Difference]: Finished difference Result 416 states and 736 transitions. [2019-11-19 22:59:26,500 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-19 22:59:26,500 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 19 [2019-11-19 22:59:26,500 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-19 22:59:26,502 INFO L225 Difference]: With dead ends: 416 [2019-11-19 22:59:26,502 INFO L226 Difference]: Without dead ends: 278 [2019-11-19 22:59:26,503 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-19 22:59:26,504 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 278 states. [2019-11-19 22:59:26,516 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 278 to 276. [2019-11-19 22:59:26,516 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 276 states. [2019-11-19 22:59:26,519 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 276 states to 276 states and 482 transitions. [2019-11-19 22:59:26,519 INFO L78 Accepts]: Start accepts. Automaton has 276 states and 482 transitions. Word has length 19 [2019-11-19 22:59:26,519 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-19 22:59:26,519 INFO L462 AbstractCegarLoop]: Abstraction has 276 states and 482 transitions. [2019-11-19 22:59:26,519 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-19 22:59:26,520 INFO L276 IsEmpty]: Start isEmpty. Operand 276 states and 482 transitions. [2019-11-19 22:59:26,521 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-11-19 22:59:26,521 INFO L402 BasicCegarLoop]: Found error trace [2019-11-19 22:59:26,521 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-19 22:59:26,522 INFO L410 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-19 22:59:26,522 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 22:59:26,522 INFO L82 PathProgramCache]: Analyzing trace with hash -1960934699, now seen corresponding path program 1 times [2019-11-19 22:59:26,522 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 22:59:26,522 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1424230217] [2019-11-19 22:59:26,523 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 22:59:26,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 22:59:26,554 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-19 22:59:26,554 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1424230217] [2019-11-19 22:59:26,555 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-19 22:59:26,555 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-19 22:59:26,555 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1381328168] [2019-11-19 22:59:26,555 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-19 22:59:26,556 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-19 22:59:26,556 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-19 22:59:26,556 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-19 22:59:26,556 INFO L87 Difference]: Start difference. First operand 276 states and 482 transitions. Second operand 3 states. [2019-11-19 22:59:26,589 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-19 22:59:26,590 INFO L93 Difference]: Finished difference Result 352 states and 620 transitions. [2019-11-19 22:59:26,590 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-19 22:59:26,591 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 19 [2019-11-19 22:59:26,591 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-19 22:59:26,596 INFO L225 Difference]: With dead ends: 352 [2019-11-19 22:59:26,596 INFO L226 Difference]: Without dead ends: 350 [2019-11-19 22:59:26,597 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-19 22:59:26,599 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 350 states. [2019-11-19 22:59:26,619 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 350 to 276. [2019-11-19 22:59:26,619 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 276 states. [2019-11-19 22:59:26,621 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 276 states to 276 states and 478 transitions. [2019-11-19 22:59:26,622 INFO L78 Accepts]: Start accepts. Automaton has 276 states and 478 transitions. Word has length 19 [2019-11-19 22:59:26,622 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-19 22:59:26,622 INFO L462 AbstractCegarLoop]: Abstraction has 276 states and 478 transitions. [2019-11-19 22:59:26,622 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-19 22:59:26,623 INFO L276 IsEmpty]: Start isEmpty. Operand 276 states and 478 transitions. [2019-11-19 22:59:26,626 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2019-11-19 22:59:26,627 INFO L402 BasicCegarLoop]: Found error trace [2019-11-19 22:59:26,627 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-19 22:59:26,627 INFO L410 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-19 22:59:26,628 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 22:59:26,628 INFO L82 PathProgramCache]: Analyzing trace with hash -1939083498, now seen corresponding path program 1 times [2019-11-19 22:59:26,628 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 22:59:26,628 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [122035710] [2019-11-19 22:59:26,629 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 22:59:26,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 22:59:26,655 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-19 22:59:26,656 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [122035710] [2019-11-19 22:59:26,656 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-19 22:59:26,656 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-19 22:59:26,656 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [596490356] [2019-11-19 22:59:26,657 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-19 22:59:26,657 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-19 22:59:26,657 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-19 22:59:26,657 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-19 22:59:26,658 INFO L87 Difference]: Start difference. First operand 276 states and 478 transitions. Second operand 3 states. [2019-11-19 22:59:26,684 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-19 22:59:26,685 INFO L93 Difference]: Finished difference Result 516 states and 904 transitions. [2019-11-19 22:59:26,685 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-19 22:59:26,685 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 20 [2019-11-19 22:59:26,686 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-19 22:59:26,689 INFO L225 Difference]: With dead ends: 516 [2019-11-19 22:59:26,689 INFO L226 Difference]: Without dead ends: 514 [2019-11-19 22:59:26,690 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-19 22:59:26,691 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 514 states. [2019-11-19 22:59:26,702 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 514 to 384. [2019-11-19 22:59:26,702 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 384 states. [2019-11-19 22:59:26,704 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 384 states to 384 states and 654 transitions. [2019-11-19 22:59:26,704 INFO L78 Accepts]: Start accepts. Automaton has 384 states and 654 transitions. Word has length 20 [2019-11-19 22:59:26,705 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-19 22:59:26,705 INFO L462 AbstractCegarLoop]: Abstraction has 384 states and 654 transitions. [2019-11-19 22:59:26,705 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-19 22:59:26,705 INFO L276 IsEmpty]: Start isEmpty. Operand 384 states and 654 transitions. [2019-11-19 22:59:26,706 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2019-11-19 22:59:26,707 INFO L402 BasicCegarLoop]: Found error trace [2019-11-19 22:59:26,707 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-19 22:59:26,707 INFO L410 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-19 22:59:26,707 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 22:59:26,708 INFO L82 PathProgramCache]: Analyzing trace with hash 1344766548, now seen corresponding path program 1 times [2019-11-19 22:59:26,708 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 22:59:26,708 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1778593074] [2019-11-19 22:59:26,708 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 22:59:26,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 22:59:26,729 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-19 22:59:26,730 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1778593074] [2019-11-19 22:59:26,730 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-19 22:59:26,730 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-19 22:59:26,730 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [144283948] [2019-11-19 22:59:26,731 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-19 22:59:26,731 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-19 22:59:26,731 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-19 22:59:26,731 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-19 22:59:26,731 INFO L87 Difference]: Start difference. First operand 384 states and 654 transitions. Second operand 3 states. [2019-11-19 22:59:26,761 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-19 22:59:26,762 INFO L93 Difference]: Finished difference Result 916 states and 1568 transitions. [2019-11-19 22:59:26,762 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-19 22:59:26,762 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 20 [2019-11-19 22:59:26,763 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-19 22:59:26,766 INFO L225 Difference]: With dead ends: 916 [2019-11-19 22:59:26,770 INFO L226 Difference]: Without dead ends: 538 [2019-11-19 22:59:26,772 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-19 22:59:26,773 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 538 states. [2019-11-19 22:59:26,801 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 538 to 536. [2019-11-19 22:59:26,804 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 536 states. [2019-11-19 22:59:26,807 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 536 states to 536 states and 906 transitions. [2019-11-19 22:59:26,808 INFO L78 Accepts]: Start accepts. Automaton has 536 states and 906 transitions. Word has length 20 [2019-11-19 22:59:26,808 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-19 22:59:26,810 INFO L462 AbstractCegarLoop]: Abstraction has 536 states and 906 transitions. [2019-11-19 22:59:26,810 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-19 22:59:26,810 INFO L276 IsEmpty]: Start isEmpty. Operand 536 states and 906 transitions. [2019-11-19 22:59:26,811 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-11-19 22:59:26,812 INFO L402 BasicCegarLoop]: Found error trace [2019-11-19 22:59:26,812 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-19 22:59:26,812 INFO L410 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-19 22:59:26,812 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 22:59:26,812 INFO L82 PathProgramCache]: Analyzing trace with hash 18167752, now seen corresponding path program 1 times [2019-11-19 22:59:26,812 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 22:59:26,813 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [920521818] [2019-11-19 22:59:26,813 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 22:59:26,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 22:59:26,853 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-19 22:59:26,853 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [920521818] [2019-11-19 22:59:26,854 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-19 22:59:26,854 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-19 22:59:26,854 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1862883165] [2019-11-19 22:59:26,854 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-19 22:59:26,854 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-19 22:59:26,855 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-19 22:59:26,855 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-19 22:59:26,855 INFO L87 Difference]: Start difference. First operand 536 states and 906 transitions. Second operand 3 states. [2019-11-19 22:59:26,887 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-19 22:59:26,887 INFO L93 Difference]: Finished difference Result 812 states and 1368 transitions. [2019-11-19 22:59:26,888 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-19 22:59:26,889 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 21 [2019-11-19 22:59:26,889 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-19 22:59:26,892 INFO L225 Difference]: With dead ends: 812 [2019-11-19 22:59:26,893 INFO L226 Difference]: Without dead ends: 550 [2019-11-19 22:59:26,893 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-19 22:59:26,895 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 550 states. [2019-11-19 22:59:26,911 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 550 to 548. [2019-11-19 22:59:26,912 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 548 states. [2019-11-19 22:59:26,914 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 548 states to 548 states and 914 transitions. [2019-11-19 22:59:26,915 INFO L78 Accepts]: Start accepts. Automaton has 548 states and 914 transitions. Word has length 21 [2019-11-19 22:59:26,917 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-19 22:59:26,917 INFO L462 AbstractCegarLoop]: Abstraction has 548 states and 914 transitions. [2019-11-19 22:59:26,917 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-19 22:59:26,917 INFO L276 IsEmpty]: Start isEmpty. Operand 548 states and 914 transitions. [2019-11-19 22:59:26,919 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-11-19 22:59:26,920 INFO L402 BasicCegarLoop]: Found error trace [2019-11-19 22:59:26,920 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-19 22:59:26,920 INFO L410 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-19 22:59:26,920 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 22:59:26,921 INFO L82 PathProgramCache]: Analyzing trace with hash -1261695926, now seen corresponding path program 1 times [2019-11-19 22:59:26,921 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 22:59:26,921 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [222278409] [2019-11-19 22:59:26,921 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 22:59:26,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 22:59:26,955 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-19 22:59:26,955 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [222278409] [2019-11-19 22:59:26,955 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-19 22:59:26,955 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-19 22:59:26,956 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1010858434] [2019-11-19 22:59:26,956 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-19 22:59:26,956 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-19 22:59:26,956 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-19 22:59:26,957 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-19 22:59:26,957 INFO L87 Difference]: Start difference. First operand 548 states and 914 transitions. Second operand 3 states. [2019-11-19 22:59:26,990 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-19 22:59:26,990 INFO L93 Difference]: Finished difference Result 1000 states and 1692 transitions. [2019-11-19 22:59:26,991 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-19 22:59:26,991 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 21 [2019-11-19 22:59:26,991 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-19 22:59:26,997 INFO L225 Difference]: With dead ends: 1000 [2019-11-19 22:59:26,997 INFO L226 Difference]: Without dead ends: 998 [2019-11-19 22:59:26,998 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-19 22:59:26,999 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 998 states. [2019-11-19 22:59:27,020 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 998 to 772. [2019-11-19 22:59:27,020 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 772 states. [2019-11-19 22:59:27,024 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 772 states to 772 states and 1258 transitions. [2019-11-19 22:59:27,024 INFO L78 Accepts]: Start accepts. Automaton has 772 states and 1258 transitions. Word has length 21 [2019-11-19 22:59:27,025 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-19 22:59:27,025 INFO L462 AbstractCegarLoop]: Abstraction has 772 states and 1258 transitions. [2019-11-19 22:59:27,025 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-19 22:59:27,025 INFO L276 IsEmpty]: Start isEmpty. Operand 772 states and 1258 transitions. [2019-11-19 22:59:27,027 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-11-19 22:59:27,027 INFO L402 BasicCegarLoop]: Found error trace [2019-11-19 22:59:27,027 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-19 22:59:27,027 INFO L410 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-19 22:59:27,027 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 22:59:27,028 INFO L82 PathProgramCache]: Analyzing trace with hash 2022154120, now seen corresponding path program 1 times [2019-11-19 22:59:27,028 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 22:59:27,028 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [542659300] [2019-11-19 22:59:27,028 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 22:59:27,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 22:59:27,049 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-19 22:59:27,050 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [542659300] [2019-11-19 22:59:27,050 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-19 22:59:27,050 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-19 22:59:27,050 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [887736102] [2019-11-19 22:59:27,051 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-19 22:59:27,051 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-19 22:59:27,051 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-19 22:59:27,051 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-19 22:59:27,051 INFO L87 Difference]: Start difference. First operand 772 states and 1258 transitions. Second operand 3 states. [2019-11-19 22:59:27,085 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-19 22:59:27,086 INFO L93 Difference]: Finished difference Result 1816 states and 2972 transitions. [2019-11-19 22:59:27,086 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-19 22:59:27,086 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 21 [2019-11-19 22:59:27,087 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-19 22:59:27,093 INFO L225 Difference]: With dead ends: 1816 [2019-11-19 22:59:27,094 INFO L226 Difference]: Without dead ends: 1062 [2019-11-19 22:59:27,095 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-19 22:59:27,097 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1062 states. [2019-11-19 22:59:27,128 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1062 to 1060. [2019-11-19 22:59:27,128 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1060 states. [2019-11-19 22:59:27,134 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1060 states to 1060 states and 1714 transitions. [2019-11-19 22:59:27,134 INFO L78 Accepts]: Start accepts. Automaton has 1060 states and 1714 transitions. Word has length 21 [2019-11-19 22:59:27,135 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-19 22:59:27,135 INFO L462 AbstractCegarLoop]: Abstraction has 1060 states and 1714 transitions. [2019-11-19 22:59:27,135 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-19 22:59:27,135 INFO L276 IsEmpty]: Start isEmpty. Operand 1060 states and 1714 transitions. [2019-11-19 22:59:27,137 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-11-19 22:59:27,137 INFO L402 BasicCegarLoop]: Found error trace [2019-11-19 22:59:27,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] [2019-11-19 22:59:27,138 INFO L410 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-19 22:59:27,138 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 22:59:27,139 INFO L82 PathProgramCache]: Analyzing trace with hash -457653655, now seen corresponding path program 1 times [2019-11-19 22:59:27,139 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 22:59:27,139 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [624672949] [2019-11-19 22:59:27,139 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 22:59:27,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 22:59:27,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-19 22:59:27,162 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [624672949] [2019-11-19 22:59:27,163 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-19 22:59:27,163 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-19 22:59:27,163 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1897260748] [2019-11-19 22:59:27,163 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-19 22:59:27,163 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-19 22:59:27,164 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-19 22:59:27,164 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-19 22:59:27,164 INFO L87 Difference]: Start difference. First operand 1060 states and 1714 transitions. Second operand 3 states. [2019-11-19 22:59:27,204 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-19 22:59:27,204 INFO L93 Difference]: Finished difference Result 1592 states and 2564 transitions. [2019-11-19 22:59:27,205 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-19 22:59:27,205 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 22 [2019-11-19 22:59:27,205 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-19 22:59:27,213 INFO L225 Difference]: With dead ends: 1592 [2019-11-19 22:59:27,213 INFO L226 Difference]: Without dead ends: 1078 [2019-11-19 22:59:27,215 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-19 22:59:27,217 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1078 states. [2019-11-19 22:59:27,246 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1078 to 1076. [2019-11-19 22:59:27,247 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1076 states. [2019-11-19 22:59:27,252 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1076 states to 1076 states and 1714 transitions. [2019-11-19 22:59:27,252 INFO L78 Accepts]: Start accepts. Automaton has 1076 states and 1714 transitions. Word has length 22 [2019-11-19 22:59:27,253 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-19 22:59:27,253 INFO L462 AbstractCegarLoop]: Abstraction has 1076 states and 1714 transitions. [2019-11-19 22:59:27,253 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-19 22:59:27,253 INFO L276 IsEmpty]: Start isEmpty. Operand 1076 states and 1714 transitions. [2019-11-19 22:59:27,255 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-11-19 22:59:27,255 INFO L402 BasicCegarLoop]: Found error trace [2019-11-19 22:59:27,255 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-19 22:59:27,256 INFO L410 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-19 22:59:27,256 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 22:59:27,256 INFO L82 PathProgramCache]: Analyzing trace with hash -1737517333, now seen corresponding path program 1 times [2019-11-19 22:59:27,257 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 22:59:27,257 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1818703478] [2019-11-19 22:59:27,257 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 22:59:27,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 22:59:27,290 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-19 22:59:27,291 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1818703478] [2019-11-19 22:59:27,291 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-19 22:59:27,291 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-19 22:59:27,291 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [607468264] [2019-11-19 22:59:27,291 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-19 22:59:27,292 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-19 22:59:27,292 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-19 22:59:27,292 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-19 22:59:27,292 INFO L87 Difference]: Start difference. First operand 1076 states and 1714 transitions. Second operand 3 states. [2019-11-19 22:59:27,335 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-19 22:59:27,335 INFO L93 Difference]: Finished difference Result 1928 states and 3124 transitions. [2019-11-19 22:59:27,336 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-19 22:59:27,336 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 22 [2019-11-19 22:59:27,337 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-19 22:59:27,349 INFO L225 Difference]: With dead ends: 1928 [2019-11-19 22:59:27,349 INFO L226 Difference]: Without dead ends: 1926 [2019-11-19 22:59:27,352 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-19 22:59:27,354 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1926 states. [2019-11-19 22:59:27,399 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1926 to 1540. [2019-11-19 22:59:27,400 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1540 states. [2019-11-19 22:59:27,408 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1540 states to 1540 states and 2386 transitions. [2019-11-19 22:59:27,408 INFO L78 Accepts]: Start accepts. Automaton has 1540 states and 2386 transitions. Word has length 22 [2019-11-19 22:59:27,409 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-19 22:59:27,409 INFO L462 AbstractCegarLoop]: Abstraction has 1540 states and 2386 transitions. [2019-11-19 22:59:27,409 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-19 22:59:27,410 INFO L276 IsEmpty]: Start isEmpty. Operand 1540 states and 2386 transitions. [2019-11-19 22:59:27,412 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-11-19 22:59:27,413 INFO L402 BasicCegarLoop]: Found error trace [2019-11-19 22:59:27,413 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-19 22:59:27,413 INFO L410 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-19 22:59:27,413 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 22:59:27,414 INFO L82 PathProgramCache]: Analyzing trace with hash 1546332713, now seen corresponding path program 1 times [2019-11-19 22:59:27,414 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 22:59:27,414 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1960747068] [2019-11-19 22:59:27,414 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 22:59:27,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 22:59:27,442 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-19 22:59:27,443 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1960747068] [2019-11-19 22:59:27,443 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-19 22:59:27,443 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-19 22:59:27,443 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [311094156] [2019-11-19 22:59:27,444 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-19 22:59:27,444 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-19 22:59:27,444 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-19 22:59:27,444 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-19 22:59:27,444 INFO L87 Difference]: Start difference. First operand 1540 states and 2386 transitions. Second operand 3 states. [2019-11-19 22:59:27,503 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-19 22:59:27,503 INFO L93 Difference]: Finished difference Result 3592 states and 5588 transitions. [2019-11-19 22:59:27,504 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-19 22:59:27,504 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 22 [2019-11-19 22:59:27,504 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-19 22:59:27,517 INFO L225 Difference]: With dead ends: 3592 [2019-11-19 22:59:27,517 INFO L226 Difference]: Without dead ends: 2086 [2019-11-19 22:59:27,520 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-19 22:59:27,523 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2086 states. [2019-11-19 22:59:27,617 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2086 to 2084. [2019-11-19 22:59:27,617 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2084 states. [2019-11-19 22:59:27,627 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2084 states to 2084 states and 3202 transitions. [2019-11-19 22:59:27,628 INFO L78 Accepts]: Start accepts. Automaton has 2084 states and 3202 transitions. Word has length 22 [2019-11-19 22:59:27,628 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-19 22:59:27,629 INFO L462 AbstractCegarLoop]: Abstraction has 2084 states and 3202 transitions. [2019-11-19 22:59:27,629 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-19 22:59:27,629 INFO L276 IsEmpty]: Start isEmpty. Operand 2084 states and 3202 transitions. [2019-11-19 22:59:27,632 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2019-11-19 22:59:27,632 INFO L402 BasicCegarLoop]: Found error trace [2019-11-19 22:59:27,632 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-19 22:59:27,632 INFO L410 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-19 22:59:27,633 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 22:59:27,633 INFO L82 PathProgramCache]: Analyzing trace with hash 1971752253, now seen corresponding path program 1 times [2019-11-19 22:59:27,633 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 22:59:27,633 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [123719397] [2019-11-19 22:59:27,634 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 22:59:27,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 22:59:27,672 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-19 22:59:27,672 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [123719397] [2019-11-19 22:59:27,672 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-19 22:59:27,672 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-19 22:59:27,673 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1255994691] [2019-11-19 22:59:27,673 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-19 22:59:27,673 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-19 22:59:27,673 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-19 22:59:27,673 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-19 22:59:27,674 INFO L87 Difference]: Start difference. First operand 2084 states and 3202 transitions. Second operand 3 states. [2019-11-19 22:59:27,719 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-19 22:59:27,719 INFO L93 Difference]: Finished difference Result 3128 states and 4788 transitions. [2019-11-19 22:59:27,719 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-19 22:59:27,720 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 23 [2019-11-19 22:59:27,720 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-19 22:59:27,732 INFO L225 Difference]: With dead ends: 3128 [2019-11-19 22:59:27,732 INFO L226 Difference]: Without dead ends: 2118 [2019-11-19 22:59:27,734 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-19 22:59:27,737 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2118 states. [2019-11-19 22:59:27,789 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2118 to 2116. [2019-11-19 22:59:27,790 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2116 states. [2019-11-19 22:59:27,800 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2116 states to 2116 states and 3202 transitions. [2019-11-19 22:59:27,801 INFO L78 Accepts]: Start accepts. Automaton has 2116 states and 3202 transitions. Word has length 23 [2019-11-19 22:59:27,801 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-19 22:59:27,801 INFO L462 AbstractCegarLoop]: Abstraction has 2116 states and 3202 transitions. [2019-11-19 22:59:27,801 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-19 22:59:27,802 INFO L276 IsEmpty]: Start isEmpty. Operand 2116 states and 3202 transitions. [2019-11-19 22:59:27,804 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2019-11-19 22:59:27,805 INFO L402 BasicCegarLoop]: Found error trace [2019-11-19 22:59:27,805 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-19 22:59:27,805 INFO L410 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-19 22:59:27,806 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 22:59:27,806 INFO L82 PathProgramCache]: Analyzing trace with hash 691888575, now seen corresponding path program 1 times [2019-11-19 22:59:27,806 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 22:59:27,806 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [718360376] [2019-11-19 22:59:27,806 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 22:59:27,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 22:59:27,831 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-19 22:59:27,832 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [718360376] [2019-11-19 22:59:27,832 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-19 22:59:27,832 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-19 22:59:27,832 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2041565653] [2019-11-19 22:59:27,832 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-19 22:59:27,833 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-19 22:59:27,833 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-19 22:59:27,833 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-19 22:59:27,833 INFO L87 Difference]: Start difference. First operand 2116 states and 3202 transitions. Second operand 3 states. [2019-11-19 22:59:27,905 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-19 22:59:27,905 INFO L93 Difference]: Finished difference Result 3720 states and 5732 transitions. [2019-11-19 22:59:27,906 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-19 22:59:27,906 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 23 [2019-11-19 22:59:27,906 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-19 22:59:27,929 INFO L225 Difference]: With dead ends: 3720 [2019-11-19 22:59:27,929 INFO L226 Difference]: Without dead ends: 3718 [2019-11-19 22:59:27,931 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-19 22:59:27,936 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3718 states. [2019-11-19 22:59:28,023 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3718 to 3076. [2019-11-19 22:59:28,023 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3076 states. [2019-11-19 22:59:28,037 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3076 states to 3076 states and 4514 transitions. [2019-11-19 22:59:28,038 INFO L78 Accepts]: Start accepts. Automaton has 3076 states and 4514 transitions. Word has length 23 [2019-11-19 22:59:28,038 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-19 22:59:28,038 INFO L462 AbstractCegarLoop]: Abstraction has 3076 states and 4514 transitions. [2019-11-19 22:59:28,038 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-19 22:59:28,038 INFO L276 IsEmpty]: Start isEmpty. Operand 3076 states and 4514 transitions. [2019-11-19 22:59:28,043 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2019-11-19 22:59:28,044 INFO L402 BasicCegarLoop]: Found error trace [2019-11-19 22:59:28,044 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-19 22:59:28,044 INFO L410 AbstractCegarLoop]: === Iteration 19 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-19 22:59:28,044 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 22:59:28,045 INFO L82 PathProgramCache]: Analyzing trace with hash -319228675, now seen corresponding path program 1 times [2019-11-19 22:59:28,046 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 22:59:28,046 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1723535454] [2019-11-19 22:59:28,047 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 22:59:28,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 22:59:28,072 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-19 22:59:28,072 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1723535454] [2019-11-19 22:59:28,073 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-19 22:59:28,073 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-19 22:59:28,073 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1563594709] [2019-11-19 22:59:28,073 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-19 22:59:28,073 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-19 22:59:28,074 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-19 22:59:28,074 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-19 22:59:28,074 INFO L87 Difference]: Start difference. First operand 3076 states and 4514 transitions. Second operand 3 states. [2019-11-19 22:59:28,165 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-19 22:59:28,165 INFO L93 Difference]: Finished difference Result 7112 states and 10468 transitions. [2019-11-19 22:59:28,166 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-19 22:59:28,166 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 23 [2019-11-19 22:59:28,166 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-19 22:59:28,190 INFO L225 Difference]: With dead ends: 7112 [2019-11-19 22:59:28,191 INFO L226 Difference]: Without dead ends: 4102 [2019-11-19 22:59:28,195 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-19 22:59:28,201 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4102 states. [2019-11-19 22:59:28,304 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4102 to 4100. [2019-11-19 22:59:28,304 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4100 states. [2019-11-19 22:59:28,322 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4100 states to 4100 states and 5954 transitions. [2019-11-19 22:59:28,323 INFO L78 Accepts]: Start accepts. Automaton has 4100 states and 5954 transitions. Word has length 23 [2019-11-19 22:59:28,323 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-19 22:59:28,323 INFO L462 AbstractCegarLoop]: Abstraction has 4100 states and 5954 transitions. [2019-11-19 22:59:28,323 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-19 22:59:28,323 INFO L276 IsEmpty]: Start isEmpty. Operand 4100 states and 5954 transitions. [2019-11-19 22:59:28,328 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2019-11-19 22:59:28,328 INFO L402 BasicCegarLoop]: Found error trace [2019-11-19 22:59:28,329 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-19 22:59:28,329 INFO L410 AbstractCegarLoop]: === Iteration 20 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-19 22:59:28,329 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 22:59:28,330 INFO L82 PathProgramCache]: Analyzing trace with hash -26075586, now seen corresponding path program 1 times [2019-11-19 22:59:28,330 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 22:59:28,330 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1771943556] [2019-11-19 22:59:28,330 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 22:59:28,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 22:59:28,366 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-19 22:59:28,366 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1771943556] [2019-11-19 22:59:28,366 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-19 22:59:28,366 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-19 22:59:28,367 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1984016171] [2019-11-19 22:59:28,367 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-19 22:59:28,367 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-19 22:59:28,367 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-19 22:59:28,367 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-19 22:59:28,368 INFO L87 Difference]: Start difference. First operand 4100 states and 5954 transitions. Second operand 3 states. [2019-11-19 22:59:28,446 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-19 22:59:28,447 INFO L93 Difference]: Finished difference Result 6152 states and 8900 transitions. [2019-11-19 22:59:28,447 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-19 22:59:28,447 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 24 [2019-11-19 22:59:28,448 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-19 22:59:28,494 INFO L225 Difference]: With dead ends: 6152 [2019-11-19 22:59:28,494 INFO L226 Difference]: Without dead ends: 4166 [2019-11-19 22:59:28,497 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-19 22:59:28,503 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4166 states. [2019-11-19 22:59:28,623 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4166 to 4164. [2019-11-19 22:59:28,623 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4164 states. [2019-11-19 22:59:28,643 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4164 states to 4164 states and 5954 transitions. [2019-11-19 22:59:28,643 INFO L78 Accepts]: Start accepts. Automaton has 4164 states and 5954 transitions. Word has length 24 [2019-11-19 22:59:28,644 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-19 22:59:28,644 INFO L462 AbstractCegarLoop]: Abstraction has 4164 states and 5954 transitions. [2019-11-19 22:59:28,644 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-19 22:59:28,644 INFO L276 IsEmpty]: Start isEmpty. Operand 4164 states and 5954 transitions. [2019-11-19 22:59:28,649 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2019-11-19 22:59:28,650 INFO L402 BasicCegarLoop]: Found error trace [2019-11-19 22:59:28,650 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-19 22:59:28,650 INFO L410 AbstractCegarLoop]: === Iteration 21 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-19 22:59:28,650 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 22:59:28,651 INFO L82 PathProgramCache]: Analyzing trace with hash -1305939264, now seen corresponding path program 1 times [2019-11-19 22:59:28,651 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 22:59:28,651 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [275503479] [2019-11-19 22:59:28,651 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 22:59:28,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 22:59:28,678 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-19 22:59:28,679 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [275503479] [2019-11-19 22:59:28,679 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-19 22:59:28,679 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-19 22:59:28,679 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [934443676] [2019-11-19 22:59:28,680 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-19 22:59:28,680 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-19 22:59:28,680 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-19 22:59:28,680 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-19 22:59:28,680 INFO L87 Difference]: Start difference. First operand 4164 states and 5954 transitions. Second operand 3 states. [2019-11-19 22:59:28,834 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-19 22:59:28,835 INFO L93 Difference]: Finished difference Result 7176 states and 10436 transitions. [2019-11-19 22:59:28,835 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-19 22:59:28,835 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 24 [2019-11-19 22:59:28,836 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-19 22:59:28,849 INFO L225 Difference]: With dead ends: 7176 [2019-11-19 22:59:28,849 INFO L226 Difference]: Without dead ends: 7174 [2019-11-19 22:59:28,851 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-19 22:59:28,859 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7174 states. [2019-11-19 22:59:28,989 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7174 to 6148. [2019-11-19 22:59:28,989 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6148 states. [2019-11-19 22:59:29,009 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6148 states to 6148 states and 8514 transitions. [2019-11-19 22:59:29,009 INFO L78 Accepts]: Start accepts. Automaton has 6148 states and 8514 transitions. Word has length 24 [2019-11-19 22:59:29,010 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-19 22:59:29,010 INFO L462 AbstractCegarLoop]: Abstraction has 6148 states and 8514 transitions. [2019-11-19 22:59:29,010 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-19 22:59:29,010 INFO L276 IsEmpty]: Start isEmpty. Operand 6148 states and 8514 transitions. [2019-11-19 22:59:29,018 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2019-11-19 22:59:29,018 INFO L402 BasicCegarLoop]: Found error trace [2019-11-19 22:59:29,018 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-19 22:59:29,019 INFO L410 AbstractCegarLoop]: === Iteration 22 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-19 22:59:29,019 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 22:59:29,019 INFO L82 PathProgramCache]: Analyzing trace with hash 1977910782, now seen corresponding path program 1 times [2019-11-19 22:59:29,019 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 22:59:29,020 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1834321161] [2019-11-19 22:59:29,020 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 22:59:29,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 22:59:29,039 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-19 22:59:29,040 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1834321161] [2019-11-19 22:59:29,040 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-19 22:59:29,040 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-19 22:59:29,040 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [804297646] [2019-11-19 22:59:29,040 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-19 22:59:29,040 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-19 22:59:29,041 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-19 22:59:29,041 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-19 22:59:29,041 INFO L87 Difference]: Start difference. First operand 6148 states and 8514 transitions. Second operand 3 states. [2019-11-19 22:59:29,176 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-19 22:59:29,177 INFO L93 Difference]: Finished difference Result 14088 states and 19524 transitions. [2019-11-19 22:59:29,178 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-19 22:59:29,178 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 24 [2019-11-19 22:59:29,178 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-19 22:59:29,192 INFO L225 Difference]: With dead ends: 14088 [2019-11-19 22:59:29,192 INFO L226 Difference]: Without dead ends: 8070 [2019-11-19 22:59:29,201 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-19 22:59:29,212 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8070 states. [2019-11-19 22:59:29,422 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8070 to 8068. [2019-11-19 22:59:29,422 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8068 states. [2019-11-19 22:59:29,437 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8068 states to 8068 states and 11010 transitions. [2019-11-19 22:59:29,437 INFO L78 Accepts]: Start accepts. Automaton has 8068 states and 11010 transitions. Word has length 24 [2019-11-19 22:59:29,437 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-19 22:59:29,437 INFO L462 AbstractCegarLoop]: Abstraction has 8068 states and 11010 transitions. [2019-11-19 22:59:29,437 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-19 22:59:29,438 INFO L276 IsEmpty]: Start isEmpty. Operand 8068 states and 11010 transitions. [2019-11-19 22:59:29,447 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-11-19 22:59:29,448 INFO L402 BasicCegarLoop]: Found error trace [2019-11-19 22:59:29,448 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-19 22:59:29,450 INFO L410 AbstractCegarLoop]: === Iteration 23 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-19 22:59:29,450 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 22:59:29,451 INFO L82 PathProgramCache]: Analyzing trace with hash -1829196110, now seen corresponding path program 1 times [2019-11-19 22:59:29,451 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 22:59:29,453 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1274706868] [2019-11-19 22:59:29,453 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 22:59:29,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 22:59:29,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-19 22:59:29,474 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1274706868] [2019-11-19 22:59:29,475 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-19 22:59:29,475 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-19 22:59:29,475 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1688418195] [2019-11-19 22:59:29,475 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-19 22:59:29,475 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-19 22:59:29,475 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-19 22:59:29,476 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-19 22:59:29,476 INFO L87 Difference]: Start difference. First operand 8068 states and 11010 transitions. Second operand 3 states. [2019-11-19 22:59:29,594 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-19 22:59:29,594 INFO L93 Difference]: Finished difference Result 12104 states and 16452 transitions. [2019-11-19 22:59:29,595 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-19 22:59:29,595 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 25 [2019-11-19 22:59:29,595 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-19 22:59:29,610 INFO L225 Difference]: With dead ends: 12104 [2019-11-19 22:59:29,611 INFO L226 Difference]: Without dead ends: 8198 [2019-11-19 22:59:29,617 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-19 22:59:29,628 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8198 states. [2019-11-19 22:59:29,846 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8198 to 8196. [2019-11-19 22:59:29,847 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8196 states. [2019-11-19 22:59:29,956 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8196 states to 8196 states and 11010 transitions. [2019-11-19 22:59:29,957 INFO L78 Accepts]: Start accepts. Automaton has 8196 states and 11010 transitions. Word has length 25 [2019-11-19 22:59:29,957 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-19 22:59:29,957 INFO L462 AbstractCegarLoop]: Abstraction has 8196 states and 11010 transitions. [2019-11-19 22:59:29,957 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-19 22:59:29,957 INFO L276 IsEmpty]: Start isEmpty. Operand 8196 states and 11010 transitions. [2019-11-19 22:59:29,967 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-11-19 22:59:29,968 INFO L402 BasicCegarLoop]: Found error trace [2019-11-19 22:59:29,968 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-19 22:59:29,968 INFO L410 AbstractCegarLoop]: === Iteration 24 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-19 22:59:29,969 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 22:59:29,969 INFO L82 PathProgramCache]: Analyzing trace with hash 1185907508, now seen corresponding path program 1 times [2019-11-19 22:59:29,969 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 22:59:29,969 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1587099099] [2019-11-19 22:59:29,969 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 22:59:29,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 22:59:29,995 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-19 22:59:29,995 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1587099099] [2019-11-19 22:59:29,995 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-19 22:59:29,995 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-19 22:59:29,996 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1663762906] [2019-11-19 22:59:29,996 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-19 22:59:29,996 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-19 22:59:29,996 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-19 22:59:29,996 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-19 22:59:29,997 INFO L87 Difference]: Start difference. First operand 8196 states and 11010 transitions. Second operand 3 states. [2019-11-19 22:59:30,190 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-19 22:59:30,190 INFO L93 Difference]: Finished difference Result 13832 states and 18820 transitions. [2019-11-19 22:59:30,191 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-19 22:59:30,191 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 25 [2019-11-19 22:59:30,191 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-19 22:59:30,220 INFO L225 Difference]: With dead ends: 13832 [2019-11-19 22:59:30,220 INFO L226 Difference]: Without dead ends: 13830 [2019-11-19 22:59:30,226 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-19 22:59:30,247 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13830 states. [2019-11-19 22:59:30,517 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13830 to 12292. [2019-11-19 22:59:30,517 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12292 states. [2019-11-19 22:59:30,536 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12292 states to 12292 states and 16002 transitions. [2019-11-19 22:59:30,537 INFO L78 Accepts]: Start accepts. Automaton has 12292 states and 16002 transitions. Word has length 25 [2019-11-19 22:59:30,537 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-19 22:59:30,537 INFO L462 AbstractCegarLoop]: Abstraction has 12292 states and 16002 transitions. [2019-11-19 22:59:30,537 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-19 22:59:30,537 INFO L276 IsEmpty]: Start isEmpty. Operand 12292 states and 16002 transitions. [2019-11-19 22:59:30,555 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-11-19 22:59:30,556 INFO L402 BasicCegarLoop]: Found error trace [2019-11-19 22:59:30,556 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-19 22:59:30,557 INFO L410 AbstractCegarLoop]: === Iteration 25 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-19 22:59:30,557 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 22:59:30,557 INFO L82 PathProgramCache]: Analyzing trace with hash 174790258, now seen corresponding path program 1 times [2019-11-19 22:59:30,557 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 22:59:30,558 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [313749476] [2019-11-19 22:59:30,558 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 22:59:30,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 22:59:30,574 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-19 22:59:30,574 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [313749476] [2019-11-19 22:59:30,574 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-19 22:59:30,574 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-19 22:59:30,575 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [913091878] [2019-11-19 22:59:30,575 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-19 22:59:30,575 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-19 22:59:30,575 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-19 22:59:30,575 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-19 22:59:30,576 INFO L87 Difference]: Start difference. First operand 12292 states and 16002 transitions. Second operand 3 states. [2019-11-19 22:59:30,822 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-19 22:59:30,823 INFO L93 Difference]: Finished difference Result 27912 states and 36228 transitions. [2019-11-19 22:59:30,823 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-19 22:59:30,823 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 25 [2019-11-19 22:59:30,824 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-19 22:59:30,857 INFO L225 Difference]: With dead ends: 27912 [2019-11-19 22:59:30,858 INFO L226 Difference]: Without dead ends: 15878 [2019-11-19 22:59:30,874 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-19 22:59:30,892 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15878 states. [2019-11-19 22:59:31,295 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15878 to 15876. [2019-11-19 22:59:31,295 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15876 states. [2019-11-19 22:59:31,318 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15876 states to 15876 states and 20226 transitions. [2019-11-19 22:59:31,318 INFO L78 Accepts]: Start accepts. Automaton has 15876 states and 20226 transitions. Word has length 25 [2019-11-19 22:59:31,319 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-19 22:59:31,319 INFO L462 AbstractCegarLoop]: Abstraction has 15876 states and 20226 transitions. [2019-11-19 22:59:31,319 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-19 22:59:31,319 INFO L276 IsEmpty]: Start isEmpty. Operand 15876 states and 20226 transitions. [2019-11-19 22:59:31,337 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2019-11-19 22:59:31,338 INFO L402 BasicCegarLoop]: Found error trace [2019-11-19 22:59:31,338 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-19 22:59:31,338 INFO L410 AbstractCegarLoop]: === Iteration 26 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-19 22:59:31,338 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 22:59:31,339 INFO L82 PathProgramCache]: Analyzing trace with hash -1891357165, now seen corresponding path program 1 times [2019-11-19 22:59:31,339 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 22:59:31,339 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1762555539] [2019-11-19 22:59:31,339 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 22:59:31,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 22:59:31,368 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-19 22:59:31,369 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1762555539] [2019-11-19 22:59:31,369 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-19 22:59:31,369 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-19 22:59:31,369 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [650571059] [2019-11-19 22:59:31,369 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-19 22:59:31,370 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-19 22:59:31,370 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-19 22:59:31,370 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-19 22:59:31,370 INFO L87 Difference]: Start difference. First operand 15876 states and 20226 transitions. Second operand 3 states. [2019-11-19 22:59:31,563 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-19 22:59:31,563 INFO L93 Difference]: Finished difference Result 23816 states and 30212 transitions. [2019-11-19 22:59:31,564 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-19 22:59:31,564 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 26 [2019-11-19 22:59:31,564 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-19 22:59:31,592 INFO L225 Difference]: With dead ends: 23816 [2019-11-19 22:59:31,592 INFO L226 Difference]: Without dead ends: 16134 [2019-11-19 22:59:31,605 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-19 22:59:31,622 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16134 states. [2019-11-19 22:59:31,956 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16134 to 16132. [2019-11-19 22:59:31,956 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16132 states. [2019-11-19 22:59:31,982 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16132 states to 16132 states and 20226 transitions. [2019-11-19 22:59:31,982 INFO L78 Accepts]: Start accepts. Automaton has 16132 states and 20226 transitions. Word has length 26 [2019-11-19 22:59:31,982 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-19 22:59:31,982 INFO L462 AbstractCegarLoop]: Abstraction has 16132 states and 20226 transitions. [2019-11-19 22:59:31,983 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-19 22:59:31,983 INFO L276 IsEmpty]: Start isEmpty. Operand 16132 states and 20226 transitions. [2019-11-19 22:59:32,004 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2019-11-19 22:59:32,004 INFO L402 BasicCegarLoop]: Found error trace [2019-11-19 22:59:32,004 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-19 22:59:32,004 INFO L410 AbstractCegarLoop]: === Iteration 27 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-19 22:59:32,005 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 22:59:32,005 INFO L82 PathProgramCache]: Analyzing trace with hash 1123746453, now seen corresponding path program 1 times [2019-11-19 22:59:32,005 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 22:59:32,005 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1986007872] [2019-11-19 22:59:32,005 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 22:59:32,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 22:59:32,020 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-19 22:59:32,021 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1986007872] [2019-11-19 22:59:32,021 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-19 22:59:32,021 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-19 22:59:32,021 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1316563247] [2019-11-19 22:59:32,021 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-19 22:59:32,021 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-19 22:59:32,022 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-19 22:59:32,022 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-19 22:59:32,022 INFO L87 Difference]: Start difference. First operand 16132 states and 20226 transitions. Second operand 3 states. [2019-11-19 22:59:32,492 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-19 22:59:32,492 INFO L93 Difference]: Finished difference Result 26632 states and 33540 transitions. [2019-11-19 22:59:32,493 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-19 22:59:32,493 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 26 [2019-11-19 22:59:32,493 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-19 22:59:32,535 INFO L225 Difference]: With dead ends: 26632 [2019-11-19 22:59:32,535 INFO L226 Difference]: Without dead ends: 26630 [2019-11-19 22:59:32,540 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-19 22:59:32,564 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26630 states. [2019-11-19 22:59:33,052 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26630 to 24580. [2019-11-19 22:59:33,053 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24580 states. [2019-11-19 22:59:33,094 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24580 states to 24580 states and 29954 transitions. [2019-11-19 22:59:33,095 INFO L78 Accepts]: Start accepts. Automaton has 24580 states and 29954 transitions. Word has length 26 [2019-11-19 22:59:33,095 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-19 22:59:33,095 INFO L462 AbstractCegarLoop]: Abstraction has 24580 states and 29954 transitions. [2019-11-19 22:59:33,095 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-19 22:59:33,096 INFO L276 IsEmpty]: Start isEmpty. Operand 24580 states and 29954 transitions. [2019-11-19 22:59:33,136 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2019-11-19 22:59:33,137 INFO L402 BasicCegarLoop]: Found error trace [2019-11-19 22:59:33,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-19 22:59:33,137 INFO L410 AbstractCegarLoop]: === Iteration 28 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-19 22:59:33,138 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 22:59:33,138 INFO L82 PathProgramCache]: Analyzing trace with hash 112629203, now seen corresponding path program 1 times [2019-11-19 22:59:33,138 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 22:59:33,138 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1897317567] [2019-11-19 22:59:33,139 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 22:59:33,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 22:59:33,160 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-19 22:59:33,160 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1897317567] [2019-11-19 22:59:33,160 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-19 22:59:33,160 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-19 22:59:33,160 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1693813663] [2019-11-19 22:59:33,161 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-19 22:59:33,161 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-19 22:59:33,161 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-19 22:59:33,161 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-19 22:59:33,161 INFO L87 Difference]: Start difference. First operand 24580 states and 29954 transitions. Second operand 3 states. [2019-11-19 22:59:33,603 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-19 22:59:33,603 INFO L93 Difference]: Finished difference Result 55304 states and 66820 transitions. [2019-11-19 22:59:33,605 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-19 22:59:33,605 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 26 [2019-11-19 22:59:33,605 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-19 22:59:33,663 INFO L225 Difference]: With dead ends: 55304 [2019-11-19 22:59:33,663 INFO L226 Difference]: Without dead ends: 31238 [2019-11-19 22:59:33,828 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-19 22:59:33,860 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31238 states. [2019-11-19 22:59:34,401 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31238 to 31236. [2019-11-19 22:59:34,402 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31236 states. [2019-11-19 22:59:34,450 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31236 states to 31236 states and 36866 transitions. [2019-11-19 22:59:34,450 INFO L78 Accepts]: Start accepts. Automaton has 31236 states and 36866 transitions. Word has length 26 [2019-11-19 22:59:34,451 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-19 22:59:34,451 INFO L462 AbstractCegarLoop]: Abstraction has 31236 states and 36866 transitions. [2019-11-19 22:59:34,451 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-19 22:59:34,451 INFO L276 IsEmpty]: Start isEmpty. Operand 31236 states and 36866 transitions. [2019-11-19 22:59:34,477 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-11-19 22:59:34,478 INFO L402 BasicCegarLoop]: Found error trace [2019-11-19 22:59:34,478 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-19 22:59:34,478 INFO L410 AbstractCegarLoop]: === Iteration 29 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-19 22:59:34,478 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 22:59:34,478 INFO L82 PathProgramCache]: Analyzing trace with hash 476617767, now seen corresponding path program 1 times [2019-11-19 22:59:34,479 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 22:59:34,479 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2065560399] [2019-11-19 22:59:34,479 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 22:59:34,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 22:59:34,504 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-19 22:59:34,504 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2065560399] [2019-11-19 22:59:34,504 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-19 22:59:34,505 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-19 22:59:34,505 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1273055238] [2019-11-19 22:59:34,505 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-19 22:59:34,505 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-19 22:59:34,505 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-19 22:59:34,505 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-19 22:59:34,506 INFO L87 Difference]: Start difference. First operand 31236 states and 36866 transitions. Second operand 3 states. [2019-11-19 22:59:34,837 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-19 22:59:34,837 INFO L93 Difference]: Finished difference Result 46856 states and 55044 transitions. [2019-11-19 22:59:34,838 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-19 22:59:34,838 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 27 [2019-11-19 22:59:34,838 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-19 22:59:34,898 INFO L225 Difference]: With dead ends: 46856 [2019-11-19 22:59:34,899 INFO L226 Difference]: Without dead ends: 31750 [2019-11-19 22:59:34,917 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-19 22:59:34,947 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31750 states. [2019-11-19 22:59:35,812 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31750 to 31748. [2019-11-19 22:59:35,812 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31748 states. [2019-11-19 22:59:35,855 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31748 states to 31748 states and 36866 transitions. [2019-11-19 22:59:35,855 INFO L78 Accepts]: Start accepts. Automaton has 31748 states and 36866 transitions. Word has length 27 [2019-11-19 22:59:35,855 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-19 22:59:35,855 INFO L462 AbstractCegarLoop]: Abstraction has 31748 states and 36866 transitions. [2019-11-19 22:59:35,856 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-19 22:59:35,856 INFO L276 IsEmpty]: Start isEmpty. Operand 31748 states and 36866 transitions. [2019-11-19 22:59:35,882 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-11-19 22:59:35,882 INFO L402 BasicCegarLoop]: Found error trace [2019-11-19 22:59:35,882 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-19 22:59:35,883 INFO L410 AbstractCegarLoop]: === Iteration 30 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-19 22:59:35,883 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 22:59:35,883 INFO L82 PathProgramCache]: Analyzing trace with hash -803245911, now seen corresponding path program 1 times [2019-11-19 22:59:35,883 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 22:59:35,883 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1537374007] [2019-11-19 22:59:35,884 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 22:59:35,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 22:59:35,904 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-19 22:59:35,904 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1537374007] [2019-11-19 22:59:35,904 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-19 22:59:35,905 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-19 22:59:35,905 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [612004532] [2019-11-19 22:59:35,905 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-19 22:59:35,905 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-19 22:59:35,905 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-19 22:59:35,905 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-19 22:59:35,906 INFO L87 Difference]: Start difference. First operand 31748 states and 36866 transitions. Second operand 3 states. [2019-11-19 22:59:36,475 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-19 22:59:36,476 INFO L93 Difference]: Finished difference Result 92166 states and 104451 transitions. [2019-11-19 22:59:36,476 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-19 22:59:36,476 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 27 [2019-11-19 22:59:36,477 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-19 22:59:36,537 INFO L225 Difference]: With dead ends: 92166 [2019-11-19 22:59:36,538 INFO L226 Difference]: Without dead ends: 31748 [2019-11-19 22:59:36,572 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-19 22:59:36,597 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31748 states. [2019-11-19 22:59:37,105 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31748 to 31748. [2019-11-19 22:59:37,106 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31748 states. [2019-11-19 22:59:37,148 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31748 states to 31748 states and 34818 transitions. [2019-11-19 22:59:37,149 INFO L78 Accepts]: Start accepts. Automaton has 31748 states and 34818 transitions. Word has length 27 [2019-11-19 22:59:37,149 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-19 22:59:37,149 INFO L462 AbstractCegarLoop]: Abstraction has 31748 states and 34818 transitions. [2019-11-19 22:59:37,149 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-19 22:59:37,149 INFO L276 IsEmpty]: Start isEmpty. Operand 31748 states and 34818 transitions. [2019-11-19 22:59:37,169 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-11-19 22:59:37,169 INFO L402 BasicCegarLoop]: Found error trace [2019-11-19 22:59:37,169 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-19 22:59:37,169 INFO L410 AbstractCegarLoop]: === Iteration 31 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-19 22:59:37,170 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 22:59:37,170 INFO L82 PathProgramCache]: Analyzing trace with hash 207871339, now seen corresponding path program 1 times [2019-11-19 22:59:37,170 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 22:59:37,170 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1673038746] [2019-11-19 22:59:37,170 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 22:59:37,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 22:59:37,194 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-19 22:59:37,194 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1673038746] [2019-11-19 22:59:37,194 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-19 22:59:37,194 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-19 22:59:37,194 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [390475100] [2019-11-19 22:59:37,194 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-19 22:59:37,195 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-19 22:59:37,195 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-19 22:59:37,195 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-19 22:59:37,195 INFO L87 Difference]: Start difference. First operand 31748 states and 34818 transitions. Second operand 3 states. [2019-11-19 22:59:37,725 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-19 22:59:37,725 INFO L93 Difference]: Finished difference Result 31748 states and 34818 transitions. [2019-11-19 22:59:37,726 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-19 22:59:37,726 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 27 [2019-11-19 22:59:37,726 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-19 22:59:37,726 INFO L225 Difference]: With dead ends: 31748 [2019-11-19 22:59:37,727 INFO L226 Difference]: Without dead ends: 0 [2019-11-19 22:59:37,741 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-19 22:59:37,742 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-11-19 22:59:37,742 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-11-19 22:59:37,742 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-11-19 22:59:37,742 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-11-19 22:59:37,743 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 27 [2019-11-19 22:59:37,743 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-19 22:59:37,743 INFO L462 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-11-19 22:59:37,743 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-19 22:59:37,743 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-11-19 22:59:37,744 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-11-19 22:59:37,748 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2019-11-19 22:59:37,773 INFO L444 ceAbstractionStarter]: For program point L118(line 118) no Hoare annotation was computed. [2019-11-19 22:59:37,773 INFO L447 ceAbstractionStarter]: At program point L176(lines 4 177) the Hoare annotation is: true [2019-11-19 22:59:37,773 INFO L444 ceAbstractionStarter]: For program point L143(line 143) no Hoare annotation was computed. [2019-11-19 22:59:37,773 INFO L444 ceAbstractionStarter]: For program point L44(lines 44 46) no Hoare annotation was computed. [2019-11-19 22:59:37,773 INFO L444 ceAbstractionStarter]: For program point L168(line 168) no Hoare annotation was computed. [2019-11-19 22:59:37,774 INFO L440 ceAbstractionStarter]: At program point L168-1(lines 5 177) the Hoare annotation is: false [2019-11-19 22:59:37,774 INFO L444 ceAbstractionStarter]: For program point L127-1(lines 42 172) no Hoare annotation was computed. [2019-11-19 22:59:37,774 INFO L444 ceAbstractionStarter]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2019-11-19 22:59:37,774 INFO L444 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2019-11-19 22:59:37,774 INFO L444 ceAbstractionStarter]: For program point L152-1(lines 42 172) no Hoare annotation was computed. [2019-11-19 22:59:37,774 INFO L444 ceAbstractionStarter]: For program point L111-1(lines 42 172) no Hoare annotation was computed. [2019-11-19 22:59:37,774 INFO L444 ceAbstractionStarter]: For program point L103-1(lines 42 172) no Hoare annotation was computed. [2019-11-19 22:59:37,774 INFO L444 ceAbstractionStarter]: For program point L128(line 128) no Hoare annotation was computed. [2019-11-19 22:59:37,774 INFO L444 ceAbstractionStarter]: For program point L95-1(lines 42 172) no Hoare annotation was computed. [2019-11-19 22:59:37,774 INFO L444 ceAbstractionStarter]: For program point L153(line 153) no Hoare annotation was computed. [2019-11-19 22:59:37,775 INFO L444 ceAbstractionStarter]: For program point L87-1(lines 42 172) no Hoare annotation was computed. [2019-11-19 22:59:37,775 INFO L444 ceAbstractionStarter]: For program point L79-1(lines 42 172) no Hoare annotation was computed. [2019-11-19 22:59:37,775 INFO L444 ceAbstractionStarter]: For program point L137-1(lines 42 172) no Hoare annotation was computed. [2019-11-19 22:59:37,775 INFO L444 ceAbstractionStarter]: For program point L71(lines 71 73) no Hoare annotation was computed. [2019-11-19 22:59:37,775 INFO L444 ceAbstractionStarter]: For program point L71-2(lines 42 172) no Hoare annotation was computed. [2019-11-19 22:59:37,775 INFO L444 ceAbstractionStarter]: For program point L162-1(lines 42 172) no Hoare annotation was computed. [2019-11-19 22:59:37,775 INFO L444 ceAbstractionStarter]: For program point L138(line 138) no Hoare annotation was computed. [2019-11-19 22:59:37,775 INFO L444 ceAbstractionStarter]: For program point L163(line 163) no Hoare annotation was computed. [2019-11-19 22:59:37,775 INFO L444 ceAbstractionStarter]: For program point L122-1(lines 42 172) no Hoare annotation was computed. [2019-11-19 22:59:37,775 INFO L444 ceAbstractionStarter]: For program point L147-1(lines 42 172) no Hoare annotation was computed. [2019-11-19 22:59:37,776 INFO L444 ceAbstractionStarter]: For program point L123(line 123) no Hoare annotation was computed. [2019-11-19 22:59:37,776 INFO L444 ceAbstractionStarter]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 175) no Hoare annotation was computed. [2019-11-19 22:59:37,776 INFO L444 ceAbstractionStarter]: For program point L148(line 148) no Hoare annotation was computed. [2019-11-19 22:59:37,776 INFO L447 ceAbstractionStarter]: At program point L173(lines 5 177) the Hoare annotation is: true [2019-11-19 22:59:37,776 INFO L444 ceAbstractionStarter]: For program point L107-1(lines 42 172) no Hoare annotation was computed. [2019-11-19 22:59:37,776 INFO L444 ceAbstractionStarter]: For program point L132-1(lines 42 172) no Hoare annotation was computed. [2019-11-19 22:59:37,776 INFO L444 ceAbstractionStarter]: For program point L99-1(lines 42 172) no Hoare annotation was computed. [2019-11-19 22:59:37,776 INFO L444 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2019-11-19 22:59:37,776 INFO L444 ceAbstractionStarter]: For program point L157-1(lines 42 172) no Hoare annotation was computed. [2019-11-19 22:59:37,776 INFO L444 ceAbstractionStarter]: For program point L91-1(lines 42 172) no Hoare annotation was computed. [2019-11-19 22:59:37,777 INFO L444 ceAbstractionStarter]: For program point L83-1(lines 42 172) no Hoare annotation was computed. [2019-11-19 22:59:37,777 INFO L444 ceAbstractionStarter]: For program point L75-1(lines 42 172) no Hoare annotation was computed. [2019-11-19 22:59:37,777 INFO L444 ceAbstractionStarter]: For program point L133(line 133) no Hoare annotation was computed. [2019-11-19 22:59:37,777 INFO L444 ceAbstractionStarter]: For program point L158(line 158) no Hoare annotation was computed. [2019-11-19 22:59:37,777 INFO L444 ceAbstractionStarter]: For program point L117-1(lines 42 172) no Hoare annotation was computed. [2019-11-19 22:59:37,777 INFO L444 ceAbstractionStarter]: For program point L142-1(lines 42 172) no Hoare annotation was computed. [2019-11-19 22:59:37,777 INFO L447 ceAbstractionStarter]: At program point L167-1(lines 42 172) the Hoare annotation is: true [2019-11-19 22:59:37,791 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 19.11 10:59:37 BoogieIcfgContainer [2019-11-19 22:59:37,791 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-11-19 22:59:37,792 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-11-19 22:59:37,792 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-11-19 22:59:37,792 INFO L275 PluginConnector]: Witness Printer initialized [2019-11-19 22:59:37,793 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 10:59:25" (3/4) ... [2019-11-19 22:59:37,796 INFO L137 WitnessPrinter]: Generating witness for correct program [2019-11-19 22:59:37,815 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2019-11-19 22:59:37,816 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2019-11-19 22:59:37,918 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/run_dir_8c77c0ed-60d8-44d1-92d8-02676e4d904c/bin/uautomizer/witness.graphml [2019-11-19 22:59:37,918 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-11-19 22:59:37,920 INFO L168 Benchmark]: Toolchain (without parser) took 13405.07 ms. Allocated memory was 1.0 GB in the beginning and 2.0 GB in the end (delta: 1.0 GB). Free memory was 944.7 MB in the beginning and 1.6 GB in the end (delta: -665.2 MB). Peak memory consumption was 348.2 MB. Max. memory is 11.5 GB. [2019-11-19 22:59:37,920 INFO L168 Benchmark]: CDTParser took 0.26 ms. Allocated memory is still 1.0 GB. Free memory is still 967.5 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-19 22:59:37,921 INFO L168 Benchmark]: CACSL2BoogieTranslator took 329.82 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 140.5 MB). Free memory was 944.7 MB in the beginning and 1.1 GB in the end (delta: -190.6 MB). Peak memory consumption was 23.1 MB. Max. memory is 11.5 GB. [2019-11-19 22:59:37,921 INFO L168 Benchmark]: Boogie Procedure Inliner took 43.32 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-19 22:59:37,922 INFO L168 Benchmark]: Boogie Preprocessor took 26.72 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: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. [2019-11-19 22:59:37,922 INFO L168 Benchmark]: RCFGBuilder took 443.49 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: 23.7 MB). Peak memory consumption was 23.7 MB. Max. memory is 11.5 GB. [2019-11-19 22:59:37,922 INFO L168 Benchmark]: TraceAbstraction took 12429.87 ms. Allocated memory was 1.2 GB in the beginning and 2.0 GB in the end (delta: 872.9 MB). Free memory was 1.1 GB in the beginning and 1.6 GB in the end (delta: -512.0 MB). Peak memory consumption was 361.0 MB. Max. memory is 11.5 GB. [2019-11-19 22:59:37,923 INFO L168 Benchmark]: Witness Printer took 126.34 ms. Allocated memory is still 2.0 GB. Free memory was 1.6 GB in the beginning and 1.6 GB in the end (delta: 8.2 MB). Peak memory consumption was 8.2 MB. Max. memory is 11.5 GB. [2019-11-19 22:59:37,925 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.26 ms. Allocated memory is still 1.0 GB. Free memory is still 967.5 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 329.82 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 140.5 MB). Free memory was 944.7 MB in the beginning and 1.1 GB in the end (delta: -190.6 MB). Peak memory consumption was 23.1 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 43.32 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. * Boogie Preprocessor took 26.72 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: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. * RCFGBuilder took 443.49 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: 23.7 MB). Peak memory consumption was 23.7 MB. Max. memory is 11.5 GB. * TraceAbstraction took 12429.87 ms. Allocated memory was 1.2 GB in the beginning and 2.0 GB in the end (delta: 872.9 MB). Free memory was 1.1 GB in the beginning and 1.6 GB in the end (delta: -512.0 MB). Peak memory consumption was 361.0 MB. Max. memory is 11.5 GB. * Witness Printer took 126.34 ms. Allocated memory is still 2.0 GB. Free memory was 1.6 GB in the beginning and 1.6 GB in the end (delta: 8.2 MB). Peak memory consumption was 8.2 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 175]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 4]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 42]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 5]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 5]: Loop Invariant Derived loop invariant: 1 - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 42 locations, 1 error locations. Result: SAFE, OverallTime: 12.3s, OverallIterations: 31, TraceHistogramMax: 1, AutomataDifference: 5.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 2722 SDtfs, 1400 SDslu, 1804 SDs, 0 SdLazy, 163 SolverSat, 31 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.3s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 93 GetRequests, 62 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=31748occurred in iteration=29, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 5.4s AutomataMinimizationTime, 31 MinimizatonAttempts, 6176 StatesRemovedByMinimization, 29 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 4 LocationsWithAnnotation, 4 PreInvPairs, 2057 NumberOfFragments, 4 HoareAnnotationTreeSize, 4 FomulaSimplifications, 0 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 4 FomulaSimplificationsInter, 0 FormulaSimplificationTreeSizeReductionInter, 0.0s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 0.7s InterpolantComputationTime, 689 NumberOfCodeBlocks, 689 NumberOfCodeBlocksAsserted, 31 NumberOfCheckSat, 658 ConstructedInterpolants, 0 QuantifiedInterpolants, 31360 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 31 InterpolantComputations, 31 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...